81
\$\begingroup\$

This is a list of unofficial, deadline-less (hence not searchable) bounties offered by users on various challenges on the main site.

Disclaimer: There is no guarantee that the user will award the bounty for you in case you fulfill its requirement. Especially if the user isn't an active member anymore. The only guarantee is his/her written word.


Guidelines for updating

  • To add a bounty, create an answer.
  • Answers can be sorted to see which bounties are newest.
  • Answers can be commented on, allowing someone to notify the bounty's creator that the bounty may have been earned.
  • If a bounty is awarded, delete the answer.

Browse your current bounties

\$\endgroup\$
14
  • 5
    \$\begingroup\$ How do you have a bounty without a deadline? \$\endgroup\$ – Beta Decay Jul 5 '15 at 18:11
  • 24
    \$\begingroup\$ @BetaDecay They're unofficial bounties - if and when the feat is accomplished, a bounty will be created and the rep will be awarded. \$\endgroup\$ – isaacg Jul 5 '15 at 19:16
  • 7
    \$\begingroup\$ This would be much more useful if people posted answers as answers rather than editing them into the question. That way when I see that it's changed I could just look at the answers sorted by activity (which is my default sort order on PPCG) rather than having to view the edit history of the question. \$\endgroup\$ – Peter Taylor Jun 30 '16 at 7:34
  • 9
    \$\begingroup\$ There's a TNB feed for these bounties now. In order to pick your bounty up, you have to add an answer to this question. Question edits and answer edits won't be picked up by the feed. \$\endgroup\$ – Dennis Oct 22 '16 at 17:36
  • 3
    \$\begingroup\$ Would it help to have a stack snippet in the question that just lists the first line of each answer as a link, rather than keep editing? \$\endgroup\$ – trichoplax Oct 23 '16 at 22:23
  • 8
    \$\begingroup\$ Bounties that are only present in the meta question, and not posted as separate meta answers, leave no way to contact the bounty poster when time comes to claim the bounty. Please consider posting an answer if you have a bounty offered that doesn't yet have a meta answer. \$\endgroup\$ – trichoplax Oct 24 '16 at 0:49
  • \$\begingroup\$ 100 Rep for a <100 byte answer to this question \$\endgroup\$ – Gryphon Jun 14 '17 at 14:17
  • \$\begingroup\$ @JonathanFrech Fixed. \$\endgroup\$ – ASCII-only Jan 3 '18 at 8:50
  • 2
    \$\begingroup\$ @Gryphon Post the bounty in an answer, not a comment. \$\endgroup\$ – mbomb007 Apr 30 '18 at 21:56
  • 3
    \$\begingroup\$ Since the problem of stuff being posted in the question wasn't fixing itself, I've taken extreme action. If people want to sort bounties by amount offered, there are plenty of stack snippets which produce a table based on the answers: one of those can be adapted. Similarly, checking whether users are "active" or "passive" can be done with the SE API. \$\endgroup\$ – Peter Taylor May 7 '18 at 10:34
  • 1
    \$\begingroup\$ @PeterTaylor It should be noted that not all the bounties in the question had corresponding answers, so you may have removed some completely. \$\endgroup\$ – mbomb007 May 10 '18 at 20:34
  • \$\begingroup\$ @mbomb007, I checked the first dozen manually and then I counted and reasoned that since there were considerably more answers than lines in the question I was wasting my time. \$\endgroup\$ – Peter Taylor May 10 '18 at 22:40
  • \$\begingroup\$ @PeterTaylor As an example, randomra had some bounties, but this search shows he has no current answers. Maybe you could write a script? Or ping everyone who had a bounty in the question, and they can deal with their own bounties. \$\endgroup\$ – mbomb007 May 11 '18 at 3:25
  • \$\begingroup\$ I wish a bounty on Windows Batch/VBScript answers \$\endgroup\$ – Wasif Mar 24 at 15:50

64 Answers 64

1 2
3
0
\$\begingroup\$

100 rep for an answer to Shortest code to produce non-deterministic output in Tamsin

The Tamsin specification describes no mechanism for non-determinism. However, there is a compiler from Tamsin to C; it might be possible to use a bug in this compiler to generate C code that invokes undefined behavior (this behavior wouldn't manifest on TIO because it uses the interpreter rather than the compiler). I'm not sure whether this is possible, but if somebody demonstrates a solution, I'll award an 100-point bounty.

\$\endgroup\$
0
\$\begingroup\$

1000, 750, and 250 rep for answers to my Totally Cubular Question

Four months ago I received a little reputation jump from the retroactive reputation increase for question upvotes.

Three years ago I posted my last question, and it still has no answers. That may be down to the fact that it's pretty difficult, but I'd like to give it a bump to see if anyone can get it done.

So I'm offering 2000 of the reputation I got from the recent increase in the form of three bounties for answers to this question.

  1. A 750 1000 rep bounty for the first working answer. Bounty increased
  2. A 1000 rep bounty for shortest working answer on the 1st of May. Deadline passed.
  3. A 250 rep bounty for what I consider to be the best answer. This is a bit hard to quantify, which is why gets the smallest bounty. An answer in an unlikely language, or an answer with a good explanation of the method the program uses to solve the problem might qualify for this. In the absence of an obvious best answer, I will award this to the highest voted answer. Deadline passed.

All bounties will be awarded on the 1st of May (in case one answer qualifies for more than one bounty, so I can combine the amounts when I award them). If there are no answers by the deadline Bounties 2 and 3 will no longer be offered, but bounty 1 will continue indefinitely.

\$\endgroup\$
1
  • \$\begingroup\$ Note: I am also offering 200 rep on this question from this bounty \$\endgroup\$ – Jo King Jul 10 '20 at 2:17
0
\$\begingroup\$

150 rep for <25 bytes answer on Determine Circle

If This bounty hasn't been award after a week, I will loosen the limit by 5 bytes, up to 3 week, which ends up 40 bytes

\$\endgroup\$
-8
\$\begingroup\$

500 reputation bounty - for cracking this whitespace cop

As computers get faster and faster or other mathematical developements arise (sorry can't entirely give away the premise), this may become crackable. At any such time I will award the mathematical genius 500 reputation points.

\$\endgroup\$
1
  • 9
    \$\begingroup\$ The "premise" is factoring a large semiprime - this is roughly equivalent to the RSA problem. \$\endgroup\$ – user45941 Feb 23 '17 at 14:39
1 2
3

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .