# List of bounties with no deadline

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 their 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

• How do you have a bounty without a deadline? Jul 5, 2015 at 18:11
• @BetaDecay They're unofficial bounties - if and when the feat is accomplished, a bounty will be created and the rep will be awarded. Jul 5, 2015 at 19:16
• 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. Oct 22, 2016 at 17:36
• 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? Oct 23, 2016 at 22:23
• 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. May 7, 2018 at 10:34
• @PeterTaylor It should be noted that not all the bounties in the question had corresponding answers, so you may have removed some completely. May 10, 2018 at 20:34
• @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. May 10, 2018 at 22:40
• @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. May 11, 2018 at 3:25
• I wish a bounty on Windows Batch/VBScript answers Mar 24, 2021 at 15:50
• -2: his/her --> their? (if i could edit, id do it myself) Oct 19, 2021 at 14:15

# 150*3 rep for answers in Factorio (a non-free game)

I'll award at least 150 rep to the first 3 answers in the latest version of vanilla Factorio without using commands, custom scenarios, etc, that:

• It is nontrival: either the shortest answer of all languages has at least 3 bytes, or you have used more combinators (or other structures that compute or generate things; poles and input don't count) than the number of input.
• I can't come up with a better answer in the same version. For code-golf questions, being better means both the grid size and the blueprint string length are smaller. I may not have enough time to play it, so this may take a while.
• Nobody else come up with a better answer while I'm looking at it. And no such bounties were awarded to the same question.

200 rep if it used at least 8 combinators, or 250 rep if it used at least 15.

I'm not sure there is a consensus about the I/O, but I'll try to use a format as close to the original answer as possible.

If there are less than 3 answers satisfying the criteria before Mar 31, 2019, I may (or may not) choose to award to any (previous or later) valid Factorio answers, even without satisfying the criteria. The bounty will be still open if less than 3 bounties are awarded.

• Man, I've never tried to use the electronics in Factorio. I will give this a try though
– Jo King Mod
Nov 13, 2018 at 7:21
• Note: I'm quite inactive in both PPCG and Factorio recently. It's not that I was away from PPCG to play Factorio... But that I'm afraid of forgetting how to golf in Factorio if I don't play it for too long. And it's not easy to find a good question for Factorio. Dec 10, 2018 at 10:56

# Up to 450 rep for answering Fewest (distinct) characters for Turing Completeness in Whispers

I'm offering a 150 rep bounty to anyone who posts a competitive (in my view) answer to Fewest (distinct) characters for Turing Completeness using Whispers. In addition, I will award a further 300 reputation if the answer is proven to be optimal.

Rules:

• You may use any version of Whispers, but the bounty will only be awarded once total, not once per version
• A competitive answer means you can't just post an answer claiming a score of "number of Unicode characters", rather it has to be an actual attempt at competing. This is subjective, but ultimately, I won't award the bounty to a low-effort answer
• Whispers is currently not known to be TC (I only think it is), so if it's proven to be Turing-incomplete, let me know, I'll make the latest version TC and the bounty will be up for grabs.
• Using the eval command ⍎ is forbidden (to claim the bounty, not to post an answer to the challenge)
• Comment, or ping me in chat, to claim the bounty, as well as posting an answer to the challenge, so I can judge and award it.
• Do you have any docs or tutorials for Whispers? Aug 31, 2020 at 5:25
• More specifically, is there any mechanism where calling a line repeatedly may give different results (i.e. mutable state)? Looks like the while loops are useless other than producing a trivial infinite loop, so I think it can only be TC by calling Python eval via ⍎. (And I think I have a proof that Python eval (as opposed to arbitrary program) is TC without Python 3.8's inline assignment.) Aug 31, 2020 at 6:31
• Posted an answer. Looks like eval will have the best score even if there are language-internal ways to achieve TC. Aug 31, 2020 at 8:06

# 200 rep for a 2D Language answer to Rotation-safe quine - Claimed by Martin Ender

What it says on the tin. You can use any language which uses two-dimensional syntax (Fish, Befunge, Klein, Labyrinth, etc) to create it. It must be a proper, valid quine and the language must have been made before this bounty offer had been posted.

The bounty value may increase based on the "impressiveness" of the answer. Explanations are appreciated!

• I'll fork over another 500 if that 2D language is Lost.
– Wheat Wizard Mod
May 13, 2021 at 12:04
• @WheatWizard it's already been claimed, but I can add in a bounty for Lost if you want. May 13, 2021 at 12:28

# 50 repz for first answer to 99 bottles in jelly

• For a challenge like this one with many answers, it's easiest to pop inquestion:64198 jelly in the search bar. The bounty is open! Jan 10 at 22:10
• @Dingus i keep forgetting about inquestion oops. Thank u Jan 11 at 13:45

# 500+500 Rep for beating my infinitely busy beavers

Specifically for an answer that outperforms my 5 state or 4 state answer to this question. I refuse to believe that they are optimal, however if they are, I'll give the respective bounties to whoever proves that they are optimal.

# 100-600 rep for answering Draw the Biohazard Symbol in Desmos (both completed by fireflame241)

I'm offering 100 rep for the first answer to the linked question in desmos.

Additionally, I'm offering 500 rep for an answer that uses a single equation to express the symbol.

• Completed including the one-liner May 4 at 12:49

# 500 rep for a SILOS submission of a 2048 clone.

I'll even throw in a bonus 250 rep bounty (and of course give a week of bonus visibility). for one that has gui output (this is harder than it sounds). Feel free to use the developer tools, which integrate into this language nicely.

# 50 rep for outgolfing me in the language (ping me in the nineteenth byte, and give me one week to attempt the challenge.)

So that you can police me, we both submit our submission concurrently.

• Queues, GOTOs, definitely tryable. goes and starts solving Mar 22, 2017 at 10:33
• @SIGSEGV thanks, good luck. Mar 22, 2017 at 20:14
• In the GitHub page I see Keyboard Binding, and Graphics. Oh yes, this would be good. Mar 23, 2017 at 9:28
• @SIGSEGV, this would come out top notch, it would be so much better than the next best game written (Snake). You can use colored tiles and have a color key. Mar 23, 2017 at 19:07
• Yup. Thought of that too. Mar 23, 2017 at 22:56

# 50 rep for the shortest "Hello, World!" in Pepe

If you can beat this, I will pass a 50 bounty for you.

I don't really believe a shorter solution exists - prove me wrong and you'll get it. My solution uses character constants which are probably the shortest way to push a number in Pepe. However, they are binary, so they span a lot of bytes - outgolfing it might be possible. Another problem is that most function pop the stack by default...

• If it will be really hard (it will), I'm might even pass a 100 rep bounty.

# 250 and 500 rep for the next two decent TIO Hello, World! golfs

"Decent" here meaning in beating any solution on this page by at least 25%. Bounty may be awarded if under 25% if solution is especially impressive (subjective) - for example, if golfing in a language is particularly difficult.

Note: jimmy23013 appears to be on track to claim both bounties right now - they will probably be awarded after the current one ends unless a more impressive solution appears.

• For your C# interactive program, Write("Hello, World!") is shorter than what you have right now, at 22 bytes Mar 10, 2019 at 4:18
• oh, true, will change soon Mar 10, 2019 at 5:24
• Can you add l33t? Apr 26, 2019 at 1:04

# 2000 rep for a Pain-Flak quine that uses the forward backward nature of the language.

I.E. it actually uses both the foward and the backward halves of the code and doesn't just try to work around it.

# 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.

## 100 rep to the shortest GNU sed 4.2.2 -r answer <70b to Count up forever outputting in decimal

The program must output in decimal. You must use the -r flag, although with no penalty to the bytecount. The GNU sed version is 4.2.2, so you can use empty labels. The program must be less than 70 bytes.

The program cannot use the e (shell execute) command, nor the e flag to s, nor anything else that I consider cheating that I may have missed here.

The way the bounty awarding works is that soon after I see a valid answer I will start the bounty. When the bounty is nearing its end (about a week hence), I will award it to the then shortest valid answer I see, which may not be to the first valid answer. So even if person A was the first to post a valid answer, and I start the bounty a day later, and then if person B posts a shorter valid answer 3 days into the bounty and noone matches it up, I will award the bounty to person B.

• I wonder if this way of awarding bounties is good or if it stifles participation. Maybe I should just award to the first valid answer? Sep 7, 2021 at 18:31

# 250 Reputation

I will give anyone who writes a working answer in C (not C++), for Jam don't add like that.

## Condition

The input must be taken as integers, not as char pointers (or strings)

• I assume that when you say "the input must be taken as integers," you mean a pointer to some data structure containing integers? May 12 at 21:44
• @DLosc yes .... May 13 at 6:32

# 50 - 100 Rep for answers in NLRNIS

if you do then i'll bounty 50-100 rep.

(Complex codes will bountied 100 rep)

# 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.

• The "premise" is factoring a large semiprime - this is roughly equivalent to the RSA problem.
– user45941
Feb 23, 2017 at 14:39