List of bounties with no deadline

Question

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

Answer 1

50+ rep whenever you outgolf xnor

I've reached 100K and it's time to gift it back! I offer +50 rep to any new answer that outgolfs one of mine.

Answers to outgolf

Rules

• Submit an answer that's shorter than mine and in the same language to a code golf challenge.
• It's fair game to shave bytes off my code after you look at it. Post an answer with your improvement.
• Any code golf answer of mine is eligible if it's at least one hour old and from 2016 or later.
• Only your new answers count, that is, those posted after this bounty.

I'm trying convey my intent with these rules, but it's up to my judgment what qualifies or not. Feel free to ask if unsure. Some further details:

• Even saving 1 byte counts. I may award a larger bounty for bigger golfs, or those that are particularly interesting or well-explained.
• "Cheap" golfs don't count. This means those mainly due to a different language version, looser I/O, or a changed or clarified spec. Remember that liberal I/O defaults weren't always a thing. Where I say I'm purposely avoiding some method or library, your answer needs to do so too.
• Non-code-golf challenges don't qualify.
• If you further golf someone else's answer that already outgolfed me, I'll decide case-by-case whether to award another bounty.
• Where I have answers in different languages to a question, these count separately.

---

Please edit in bounty claims here.

Bounty claims

• isaacg's solution to the challenge Length-terminated sequences. Outgolfs xnor's Python solution, 62 bytes to 67 bytes.
• To wilkben for their Python solution on "Egg, sausage, bacon and spam (lovely spam!)", outgolfing xnor's by one byte to 31 bytes from 32.
• To Jonathan Allan's Python solution on "Egg, sausage, bacon and spam (lovely spam!)", further outgolfing xnor's solution down to 28 bytes.
• To Lynn's Python solution on "Repeat every other character in string starting with second character", outgolfing xnor's 38-byte answer to 36 bytes.
• To Arnauld's Python answer on "How many petals around the rose" for outgolfing xnor's 31-byte answer by a byte.
• To Bubbler's answer on Random spanning tree of a rectangular grid for saving 2 bytes over xnor's 136-byte answer in Python
• To Kevin Cruijssen's 33-bytes Python 2 answer on Be the First 1 (leave only the first Truthy) for saving 2 bytes on @xnor's 35 byte answer.
• To dingledooper's 53-byte Python 2 answer on Code Golf Christmas Edition: How to print out a Christmas tree of height N, saving 3 bytes over xnor's.
• To Surculose Sputum's 68-byte Python 3 answer on Perimeter of Conway Hexagon for outgolfing xnor's 68 bytes to 76.
• To Surculose Sputum's 93-byte Python 2 answer on Remove loops from a walk for outgolfing xnor's by 5 bytes.
• To dingledooper's 66-byte Python 2 answer on Judge a book by its cover for saving 2 bytes from xnor's.
• To David's Python 2 answer on Determine the Sharpness of a Word for saving one byte off xnor's.
• To Sisyphus for saving a byte off xnor's 46-byte answer in Python 3 on List of primes under a million.
• To Arnauld for a Python 2 solution using a new method on The Knight's Dialer, saving 10 bytes from xnor's 83.
• To ovs for a Haskell answer on Landau logarithm saving 3 bytes off xnor's 72-byte answer, and to Wheat Wizard for saving an additional 2 bytes.
• To Sisyphus's Python 2 answer on Compute the Kolakoski sequence for being 5 bytes shorter than xnor's, and to j4at's brute-forced answer for saving a further 3 bytes.
• To dingledooper's Python 2 answer on Semidivisibility for cutting a byte of xnor's 24 bytes.
• To kops' Haskell answer on Negative Space Graphs for saving 2 bytes over xnor's.
• To dingledooper's 37-byte Python 2 answer on Output a Latin Square for outgolfing xnor's 40 bytes.
• To att's Python 2 answer on Is it better to walk or run in the rain? for saving 2 bytes off xnor's.
• To ovs's Python 2 answer on Plz Halp, Need Investors ASAP for saving 1 byte over xnor's.
• To dingledooper's 47-byte Python 2 answer on Draw a hollow square of # with given width for being 3 bytes shorter than xnor's.
• To Wheat Wizard's 50-byte Haskell answer on Eh, codegolf shmodegolf for being 2 bytes shorter than xnor's.
• To Wheat Wizard's 48-byte Haskell answer on Find the capacity of 2D printed objects for being 6 bytes shorter than xnor's.
• To Wheat Wizard's 46-byte Haskell answer on Print the N-bonacci sequence for being 1 byte shorter than xnor's.
• To loopy walt's 42-byte Python 2 answer on Is it a plausible chess move? for outgolfing xnor's by 7 bytes.
• To Albert.Lang's 73-byte Python 3 answer on Vertices of a regular dodecahedron being 9 bytes shorter than xnor's solution.
• To dingledooper's 124-byte Python 3 answer on Draw the initial positions of Mölkky pins in ASCII art for outgolfing xnor's solution by 13 bytes.
• To Albert.Lang's 55-byte and Phan Trọng Nhân's 51-byte Python answers on aaabbabbc for outgolfing xnor's answer by many bytes.
• To Jonathan Allan's 34-byter on Smallest Harmonic number greater than N for cutting two bytes versus xnor's.
• To l4m2's 67 bytes in Python on Print 4 billion if statements, which is 3 bytes shorter than xnor's.
• To Albert.Lang's 61-byte Python answer, which is 11 bytes shorter than xnor's.

Answer 2

Fitting but Unsuitable Languages(no longer active)

There are some challenges for which we all want to see answers in a certain language, even if the solution is very difficult. I'll award 500 points for an answer in such a language to any.

Help! My Calculator Broke! in TI-BASIC, with all three bonuses (Claimed by Conor O'Brien)

Gravity Simulator in Marbelous (Claimed by user197974)

Since it has been more than a year since lirtosaist has logged onto this site, Razetime has given the bounty for this on their behalf.

Current shortest solution: 157 bytes in JavaScript ES6 using regex.

I don't know if this is even possible in Marbelous, a Turing-incomplete language, so I'd be very happy to see a solution.

Hexagonal Maze Time! in Hexagony (claimed by boboquack)

Minify Brainfuck in Brainfuck (Claimed by Mitch Schwartz)

I'm willing to give thousands more rep away in bounties of this type, so comment below to suggest challenges!

Answer 3

1000 – 2000 rep for figuring out how to program with both halves of a Stack Cats program

This bounty needs a bit of background, so bear with me.

Stack Cats is an esolang with fairly strong constraints on its program structure. Specifically, each valid program has to have mirror symmetry, and the commands are designed such that mirroring a character results in the inverse operation. That means that the second half of the program (disregarding the character in the centre) exactly undoes what the first half did. So in a way it's on that central character to change the program state in a meaningful way, such that the undoing part actually results in the program behaviour you want.

Of course, there's only a handful of possible commands that can even be used for that single central character. For the mathematically inclined, this means that programming in Stack Cats is all about finding a conjugate relation that transforms one of 12 built-ins into the program you want to write. Nevertheless, I believe that Stack Cats is in fact Turing-complete.

While I've written non-trivial programs in Stack Cats (for example this primality test), they all rely on a certain construction that essentially works around these limitations, by skipping the entire first half of the program. This lets us put arbitrary "unbalanced" code in the second half, so we don't really have to worry about the conjugation. The basic construction looks like this:

<(...)*(...)>

The () are conditionals, which are always false in the first half and always true in the second half, so the first ... is skipped and the second ... is executed. The problem is that this is clearly inefficient for golfing: we could be doing useful stuff with both halves of the program, but we're just throwing one half away to be able to make sense of the program in the first place.

For very trivial problems, Sp3000 and I have found some programs that don't use this construction, but even those were usually found by an automated search. Here is an example of that for adding two numbers. In particular, our brute force approaches are usually nowhere near fast enough to find solutions that actually require control flow/loops. As far as I know, the only program that was ever written which uses both halves and contains a loop is this program by feersum (and given that the task was to implement an arbitrary OEIS sequence, it's likely that they just tried some programs with loops until one of them produced a reasonable OEIS sequence).

So, Sp3000 and I will together award 1000 rep to a Stack Cats answer, which:

• Contains non-trivial control flow, i.e. (...) and/or {...} which don't always do the same regardless of program input (in particular, if there's a (...) it should be executed for some inputs and skipped for others, to make sure that it isn't used to skip unused parts of the code unconditionally).
• Contains an explanation for how one can find such an answer without resorting to automated search (of course, you're perfectly welcome to make use of automated searches to get a better understanding of the structure of Stack Cats programs).
• Can't be easily outgolfed by an answer which uses the <(...)*(...)> template or which uses no control flow operations at all (to ensure that the program isn't just a linear solution like the addition program, padded with some loops which don't end up doing anything; and also to ensure that this technique actually makes use of both halves in an efficient way).

To be clear, the explanation is the most important part: this bounty isn't for finding such a solution by serendipity but for understanding how to construct such a solution.

Don't try to find loopholes in these rules — we're in no obligation to actually hand out the bounty, so if we feel like your answer is clearly not in the spirit of this bounty, we won't award it. I'm pretty sure that any answer which actually deserves the bounty, will do so quite obviously. Also, if you can solve several challenges (which are sufficiently different) with your technique — which would be a great proof that it's actually a general technique and not just a way to solve one particular task — we will award another 1000 rep to a second answer.

Answer 4

Disclaimer: This bounty was posted by a person whose job is to promote APL.

50 – 500 rep for an APL answer

I will reward 50 rep if all of the following conditions are met:

1. The answer is in Dyalog APL Classic/Unicode/Extended/Prime, APL2, APL+, APLSE, GNU/APL, Sharp APL, sAPL, SAX, NARS, APLX, A+, dzaima/APL, ngn/APL, APL\iv, Watcom APL, or APL\360. Feel free to suggest additional languages along this theme.

2. The challenge had no previous answer in any of the above languages.

3. The challenge was posted no later than on 31 Dec 2021.

4. The answer was posted after this bounty was set (Feb. 6 2019).

5. Awarding the bounty will not cause my rep to be under 10000.

Hint: Bubbler's (amended) SEDE query for eligible questions (has arbitrary filters and ordering — fork and edit if you want!)

The amount will be doubled once for each of the following conditions that are met (or 500 whichever is less):

6. The answer is well explained (as judged by me)

7. It is the poster's first APL answer, but the poster is not a "👋︎ New contributor".

8. The answer wins the challenge when posted.

9. The answer is the first answer to the challenge.

---

Bounty list

Awarded bounties are struck-through.

Bounties in progress are bold.

Bounties on hold are italic.

If you have previously requested a bounty, add can add more requests after the struck-through ones, otherwise add add yourself to the below list to request a bounty.

The format is:

- [username](url-to-profile): [rep](url-to-answer-post), [rep](url-to-answer-post)

• lirtosiast: 200, 200, 100, 200, 200, 100, 200, 100, 100, 200, 200

• voidhawk: 100, 200, 100, 100, 100, 100, 100, 100, 100

• TRITICIMAGVS: 200

• Ven: 200, 200, 100, 100, 100

• ​Sherlock9: 100, 100, 100, 100, 100, 100, 200, 200

• J. Sallé: 100, 100

• Bubbler: 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 400, 200, 400, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 400, 200, 200, 200

• TessellatingHeckler: 200, 100

• mabel: 100

• RGS: 400, 100, 200, 200, 200, 200, 100

• JPeroutek: 200

• Jeff Zeitlin: 100, 100

• petStorm: 100

• Jarmex: 400, 100, 100, 100, 100, 200

• fireflame241: 200, 200, 200, 200, 200, 200, 200, 200

• Silvio Mayolo: 200

• Razetime: 100, 100, 100, 100, 100, 100, 100, 100, 200, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 200

• Jo King: 100, 100, 100, 100

• rak1507: 200, 100, 100, 100, 100, 200, 200, 200, 200, 200

• user: 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 200, 100

• Kamila Szewczyk: 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100

• ovs: 100

• Fmbalbuena: 100

• Seggan: 200

• Aiden Chow: 200

• The Thonnu: 200, 100, 100

• Mukundan314: 100, 100

• [username](profile url): [amount](answer url), [amount](answer url)

---

APL resources

On Code Golf Stack Exchange

• APL Cultivation — 50 chat lessons on most APL subjects

• The APL Orchard — a very active APL chat room

• Tips for golfing in APL — lots of sophisticated ideas

Other

• APLcart — collection of APL phrases

• APL Wiki — lots of info, including learning resources

Answer 5

200 rep for Vyxal answers

I'm basing this off the Japt bounty, so some of the wording is going to be the same

Vyxal. It's one of the golfing languages ever made, and I think you'll like it. In fact, I think you'll like it so much, that if any of y'all post 5 Vyxal solutions in a 30 day period, emanresu A and I (lyxal) will give you 200 reputation. This used to be 300 reputation, but sadly, Razetime is no longer with us.

The 5 answers have to be posted after 20/04/2021 (UTC).

We'll be monitoring new solutions and keeping the list at the end of this answer updated but if we miss a solution of yours, please leave a comment with a link to it, or ping us in the Vyxal chatroom.

Bounties will be suspended if rewarding the bounty dips our reputation below 10k. If, on the off-chance, this bounty proves to be popular enough, we may adjust the rep we award to avoid completely tanking it.

---

Useful links

• CGCC chatroom
• Official interpreter
• Repository (GitHub)
• Tutorial
• Tips

Now go forth and dominate the competition and get this language onto the ELO list!

---

Bounty Claims

• Aaron Miller: 1, 2, 3, 4, 5 (awarded)

• Wasif: 1, 2, 3, 4, 5 (awarded)

• A username: 1, 2, 3, 4, 5 (awarded)

• StackMeter: 1, 2, 3, 4, 5 (awarded)

• hyper-neutrino: 1 2 3 4 5 (awarded)

• xigoi: 1 2 3 4 5 (awarded)

• a stone arachnid: 1, 2, 3, 4, 5 (awarded)

• user: 1, 2, 3, 4, 5 (awarded)

• Underslash: 1, 2, 3, 4, 5 (awarded)

• SjoerdPennings: 1, 2, 3, 4, 5 (awarded)

• Seggan: 1, 2, 3, 4, 5 (awarded)

• mathcat: 1, 2, 3, 4, 5 (awarded)

• Bgil Midol: 1, 2, 3, 4, 5 (awarded)

• Steffan: 1, 2, 3, 4, 5 (awarded)

• cjquines: 1, 2, 3, 4, 5 (awarded)

• Deadcode: 1, 2, 3, 4, 5 (awarded)

• tybocopperkettle: 1, 2, 3, 4, 5 (awarded)

• Pacmanboss256: 1, 2, 3, 4, 5 (awarded)

• DialFrost: 1, 2, 3, 4, 5 (awarded)

• The Thonnu: 1, 2, 3, 4, 5 (awarded)

• 97.100.97.109: 1, 2, 3, 4, 5 (awarded)

Format:

- **[Username](code golf user profile)**: [1](link), [2](link), [3](link), [4](link), [5](link)

Answer 6

100-200 rep for good answers in interesting new languages

This is a bit subjective of course, but here are my criteria:

• The language is fairly new, and is interesting (in my opinion)
• The answer is clever, shows a lot of work put in, and shows off many features of the language (so no trivial posts in interesting languages)
• I have not awarded this bounty in a while (since I don't have much rep)

No requirements on what type of language (esoteric, golfing, practical, etc.). Doesn't have to be an answer by the language creator. I'm always interested in new languages, so if you think your post or someone else's deserves this bounty, leave a comment!

---

Awarded:

• Generate Pascal's Triangle (written in convey) by xash
• Simple cat program (written in v³) by Bo_Tie
• Follow a linked list (written in Rattle) by Daniel H.
• Fibonacci function or sequence (written in Barrel) by LorenDB
• Division and remainder (written in Grok) by Aaron Miller
• Hello, world! (written in Sandwich) by Y45HK4R4ND1K4R
• Print this diamond (written in Regenerate) by DLosc

Answer 7

1000 Rep for a meta answer that solves the popularity problem

Popularity contests have been discussed many times, always with much conflict over what counts as a pop con, whether they should be on topic, whether the rules need to be consistent between different pop cons, and with a frustrating lack of consensus.

Justin is offering 1000 rep in bounties for a solution to this.

Note that trichoplax (who originally posted this answer) is no longer active here and unlikely to see any comments, so you'll need to include @Justin in your comment to give a notification.

The bounties will be posted on a challenge of the answer author's choice if a meta answer presents a solution to this and meets the following conditions:

• 30 days after posting the meta answer, it has 10 or more upvotes and over 90% of its votes are upvotes.
• 3 popularity contests appear on main following the new meta answer, each of which after 30 days from posting has net 10 upvotes and is open.

The meta answer can be attached to a new meta question or an existing meta question.

The bounty target can be an existing challenge or a future one (the bounty can be deferred if the challenge is yet to be posted). It can be any challenge type.

The meta answer can make the rules on pop cons more restrictive, less restrictive, or any other combination of changes, provided it meets the voting criteria specified above.

There can be an arbitrary delay between posting the meta answer and the arrival of the 3 popularity contests on main.

Answer 8

100-500 rep for answers to good, old questions with few answers

Please note: I'm nearly out of rep and can't award anyone anymore. If someone else can continue the bounty, that'd be really great.

This bounty is for answers to questions that meet the following criteria:

• They have a score of 10 or more (and fewer than 4 downvotes)
• They haven't had an answer in 3 years
• There are between 1 and 9 answers (inclusive)

For questions not tagged tips, here are the bounty amounts, depending on how many answers there are and whether or not there is a good explanation:

• 1 to 3 answers (inclusive): 400 rep (500 with a good explanation)
• 4 to 6 answers: 200 rep (300 with a good explanation)
• 7 to 9 answers: 100 rep (200 with a good explanation)

This search from caird coineringaahing/ChartZ Belatedly may help find eligible questions.

For questions tagged tips, if there are 5 or fewer answers already, new answers can get 50 rep.

Please edit in your requests in the form username: [amount](answer link), [amount](answer link). Bolded requests are in progress, and those that are struck through have finished.

rak1507: 250, 300

ChartZ Belatedly: 500, 200^{why not 300?}, 400, 400

Wasif: 200, 300, 300, 200

Jonah: 200

Deadcode: 200, 300

pxeger: 300, 300, 300

Razetime: 200

Dion: 200

Aaroneous Miller: 400

pajonk: 200

Grain Ghost: 500, 400, 100

ophact: 100, 200

alephalpha: 400

mathcat: 200

Seggan: 300

matteo_c: 500, 200

bigyihsuan: 300, 300 500

Aurath: 400

nyxbird: 300

Answer 9

500 to 2000 rep for a quine in Hexagony

There are two ways to write a quine in Hexagony (which will probably result in very different solutions). The former is clearly the golfier version but the other one would be a lot neater. I'll give a 500 rep bounty to the first person who manages to write either of those:

• One program which is a quine when written most compactly, without whitespace and without unnecessary no-ops at the end (no-ops to pad the grid to the correct side-length are fine). (I have written one in the meantime but I'm happy to be beaten. You'll have to beat it at least by one side-length to qualify for the full bounty though.) This one has been awarded to Jo King's quine.
  • I, (Jo King), will pass the 500, as well as 500 of my own rep to an even shorter quine. Again, you'll have to beat it by at least one side length to qualify (though a quine of the same side length that employs a sufficiently different algorithm may also qualify). The bounty has been claimed (in record time too!) by user202729's size 11 answer.
  • Since the shortest Hexagony quine is now of side length 10, I (Jo King) will be awarding a bounty of 1000 for a shorter quine that beats it by at least 11 bytes (i.e. one row of the hexagon). If you can't quite get it that short, I will still award a 500 rep bounty for a side length 10 that uses a sufficiently novel algorithm. If you manage to golf another side length I will award 2000 rep (and my undying adoration)
• One program which is a quine when laid out nicely in a hexagon as usual, without a column of leading spaces and without any trailing spaces on the lines. There may be an optional trailing linefeed.

There should be some effort to golf the solution. And of course, the empty program is not a valid quine (I don't think there are any other possible cheats in Hexagony).

Answer 10

200 rep each for answering good unanswered questions

I don't like seeing good questions go unanswered, so I'm offering 200 rep each for valid answers to unanswered non-tips non-koth non-cops-and-robbers questions with a score of 20 15 or above. As of now (April 26, 2022), there are 2 such questions:

• Topologically distinct ways of dissecting a square into rectangles
• Find a Glider Synthesis (Game of Life)

You can check for yourself what questions are available via search, or vote for questions that are close to the vote count

Previous winners:

• Magic: the Gathering Combat Golf By Arnauld
• Optimize Compiler for simple Reverse Polish Notation Programming Language by Roman
• Auto BATCH golfer by Kamila Szewczyk
• Matrices Generated Using Rectangles by HyperNeutrino
• Determine if a Graph is Toroidal by isaacg
• Halting Problem for Simplified Hexagony by Bubbler
• Maximal discrepancy-2 sequence with minimal entropy by S.S. Anne
• Gerrymander North Carolina by my pronoun is monicareinstate
• Hexasweep (part 1): The Solver by Redwolf Programs
• How should I tile my kitchen? by Bubbler
• Complement a POSIX Extended Regular Expression by tjjfvi
• Totally Cubular by tjjfvi
• telgif: inverse figlet by tjjfvi

Answer 11

Absurd thematic challenges

These can only be claimed once each, first come first serve. I will answer any clarifying questions for any challenge given below if needed.

500 rep for answering Non-discriminating Programming in Incident

No twist.

500 rep for answering Transform characters of your choice into "Hello, world!"... as a self-validating challenge.

This challenge asks you to write a program or function which takes a printable ASCII character as input and outputs a printable ASCII character. It also asks you to choose a string of 13 distinct printable ASCII characters which, when input into your program/function, output the characters of Hello, world!. To claim this bounty, those two strings must be one in the same. To make this more feasible, character order does not matter. So for example: If your program is abcdefghijklm and inputting the characters in the order mlkjihgfedcba gives Hello, world!, you will be awarded this bounty.

500 rep for answering Is this hexagon symmetric? in Hexagony... with symmetric source code

"Symmetric source code" here is defined roughly as follows: replace all the nops in your program with 0s, and all the non-nops in your programs with 1s. When this string of 0s and 1s is input into your program as a hexagon, it should accept it as symmetric. You don't have to use specifically 0s and 1s, just two different values, or however you take input to your program.

500 rep for answering Solve a Rubik's Cube in Cubestack... with the final state of the cube being solved

Instructions in this language correspond to moves on a Rubik's cube. Your program should correspond to movements on a cube which leave it solved. You can check the cube's halt state with the official online interpreter.

500 rep for solving But is it a pretty place? in Positionally

Again, no extra twist, this is hard enough as is :P Here's the interpreter.

500 rep from @CommandMaster for solving Golf a LaTeΧ math expression in TeX

No twist. Feel free to use any common TeX variants or packages, but the computation has to be done in TeX - you can't use a package which lets you, for example, execute Python, and solve the problem in Python.

Answer 12

100-200 rep for your first 5 Pip answers

My language Pip has finally reached version 1.0! To celebrate, I, DLosc, will award 100 rep to anyone who:

• Is not a "👋︎ New contributor"
• Has posted fewer than 5 answers in Pip prior to 14 September 2021
• After 14 September 2021, posts valid Pip answers on 5 different code-golf challenges which:
  • Are not tips or other challenge types like cops-and-robbers or answer-chaining
  • Have fewer than 30 answers at the time the Pip answer is posted

Once the 5 answers are posted, I will choose my favorite of them to bounty. If the answer also comes with a good explanation (in my subjective judgement), the bounty may be increased up to 200 rep. I may increase the amount further if I find the answer especially impressive. If other factors (for example, whether I've previously bountied the question) prevent me from bountying the answer I would like with the amount I would like, I will pick a different answer or work out another arrangement with you.

---

Resources

• GitHub repository
• Documentation site
• Tutorial (in progress)
• Tips
• ATO (supports a recent release of Pip, currently 1.1.0)
• DSO (up to date with the latest commit; doesn't play well with infinite loops)
• Replit (up to date with the latest commit; command-line interface, defaulting to REPL mode)
• TIO (only supports version 0.18, aka Pip Classic)

Feel free to ping me in The Nineteenth Byte if you have questions.

---

Bounty Claims

• Aiden Chow: 1, 2, 3, 4, 5 (awarded)
• Baby_Boy: 1, 2, 3, 4, 5 (awarded)
• mathcat: 1, 2, 3, 4, 5 (awarded)
• The Thonnu: 1, 2, 3, 4, 5 (awarded)

Format:

- [Username](code golf user profile): [1](link), [2](link), [3](link), [4](link), [5](link)

Answer 13

50-500 rep for answers to Bubbler's challenges in any of previous LotM languages

LotM languages often go inactive again after the event ends, so here is an attempt to keep them alive (or revive?).

I (Bubbler) will award 50-500 rep for answering one of my code-golf, non-tips challenges in previous LotM languages.

An answer is eligible for this bounty if:

• the challenge is code-golf, non-tips, and at least a week old (search query),
• the language used was on LotM before,
• there isn't another endless bounty that awards answers in that language (so Whispers and Vyxal are out), and
• the challenge didn't have any other answer in the same language before it.

Also, if you have 5,000 rep or higher, I won't award the bounty for solving Easy or Medium challenges.

The bounty value will be decided as follows:

• Base value (depends on the language used)
  • +50: Brachylog, MATL, Japt, R, Husk, Rust, Scala, Factor, Red
  • +100: QBasic, Forth, Vim
  • +200: Brain-Flak, SMBF
• Multiplier (depends on the difficulty of the challenge)
  • ×0.5: Easy
  • ×1.0: Medium
  • ×2.0: Hard
  • ×4.0: Insane
  • +500 (fixed value, regardless of language): Higher than Insane
• Extra bonus (additive) if the answer is exceptionally good or interesting to me

Notes

• I won't award the bounty if the value goes below 50 (or the minimum value I can award on the challenge), and the bounty value is capped at 500.
• I don't have a fixed difficulty assigned to my challenges (yet). I'll try to be consistent though. You may generally assume a challenge is at least Hard if it has relatively high score and very few answers (and definitely Easy if it has very many short answers).

---

Awarded Bounties

• (none yet)

Bounty Requests

• Please edit in bounty requests here below the template, with relevant links.
• user: Forth and Vim to This code errors on this and that, is it really written in them? (50 rep probably)
• Template: [Username](link): [Answer](link) to [Challenge title](link)

Answer 14

250 or 500 rep for showing off some skillz on code.golf

code.golf is a competitive code golf site, where all solutions are hidden and users compete for a better solution for each task in each language supported. Many Code Golf SE users also compete there.

I found some of particularly insane solutions, and I hereby challenge all of you to find out (or even outgolf) those solutions. Golfing I/O is often considered boring, but there are some golfing techniques that can only be utilized in strict I/O setting.

Since the solutions cannot be shared, you need a code.golf account to be eligible for this bounty, so that any tie or outgolf is visible on the leaderboards. To claim the bounty, leave a comment on this answer with a link to your own Code Golf SE answer to receive the bounty.

Tie record (nullifying the "diamond" score) is worth 250 rep, and outgolf (setting a new diamond) is worth 500 rep.

Records to aim for

• Intersection in Python, 110 bytes (this one was once a hot topic on TNB, and I got a 117 here, and shortly after that JayXon outgolfed me with a 116. Several months passed and I suddenly found a golf on my own answer that swooped away 7 bytes at once(!), and no one seems to have found the trick, even though the other top 5 solvers also got their scores improved a lot.)
• Leap Years in J, 27 bytes
• Seven Segment in J, 61 bytes
• Musical Chords in J, 95 bytes outgolfed by HPWiz by large margin
• Intersection in J, 39 bytes (updated 2022-01-13; I found this by going back and forth between J and K, trying and backporting various possible algorithms. So the 39 is drastically different from my previous 40.)
• Collatz in J, 34 bytes & K, 33 bytes (added 2022-05-07)

Answer 15

500-1000 rep for further work on (-a) × (-a) = a × a (no longer active?)

This now classic atomic-code-golf question has 3 answers at score 18. Is 17 possible?

• 500 rep will be awarded for an answer with score 17 or lower.
• 500 rep will be awarded for strong evidence that a solution is optimal, with a possible additional bonus for a proof.

These bounties can be awarded either together or separately.

Answer 16

100-500 rep for APL answers to Bubbler's challenges

To celebrate me (Bubbler) reaching 25k rep (with over 100 answers in APL, 50 challenges written, and several thousands of rep gained from Adám's APL bounties), I will share some of my rep for even more APL answers!

Specifically, I offer 100 (or higher up to 500, depending on how impressive it is) rep for the following:

---

A competitive APL answer to one of my code-golf challenges which doesn't yet have one

"Competitive" is a bit subjective, but it generally means the solution

• is at least shorter than comparable solutions in general-purpose languages (e.g. Python/JS; from my experience, APL usually gets 50~70% byte count of Python for moderately hard challenges, and much lower for easier ones),
  • The code length is just a rule-of-thumb guide, and can be dismissed depending on the task (e.g. if the task makes it hard to use the SBCS).
• utilizes core APL features as appropriate, and
• does not look like a line-by-line translation from C or Python code.

If you think your answer is good but too long, you may ask for help at the APL Orchard for golfing. I will decide on the bounties based on the golfed answer.

In order to prevent rushing for the newest challenges, only challenges that are at least 2 months old are eligible for this bounty. This is also applied to the SEDE query below. Due to lack of interest, I decided to simply remove this condition.

List of challenges to answer (SEDE query)

These challenges (despite having an APL answer already) are also available for the bounty:

• (none at the moment)

Note that some of the challenges are also eligible for Adám's bounties. Feel free to claim both.

---

Awarded Bounties

• 150 rep: Jo King's answer to 20 cards with no Set
• 150 rep: TessellatingHeckler's answer to The Ultimate Inequality Challenge
• 200 rep: Jo King's answer to Bubbler numbers
• 150 rep: rak1507's answer to Cut resistance of a list
• 150 rep: Jo King's answer to Is this a circular step sequence?
• 150 rep: Razetime's answer to Area of diagonal-folded regular polygon
• 150 rep: Razetime's answer to Circumference of an ellipse
• 200 rep: Razetime's answer to Counting valid Binary Sudoku rows
• 250 rep: user's answer to Evaluate Conway chained arrow notation
• 200 rep: Razetime's answer to Perimeter of Conway Hexagon
• 250 rep: Razetime's answer to When is the closest Conway's Doomsday?
• 150 rep: rak1507's answer to Penney-Conway Odds
• 200 rep: Martin Janiczek's answer to Help me pair my left and right socks!
• 200 rep: user's answer to Read out the C variable declaration
• 200 rep: Razetime's answer to Nightmare Puzzlang Translator

Bounty Requests

• Please edit in bounty requests here below the template, with relevant links.
• Razetime: Answer to Circular Limited Sums
• Razetime: Answer to Is This an L Shape?
• Template: [Username](link): [Answer](link) to [Challenge title](link)

Answer 17

100-500 rep for solving challenges using an ACE exploit in an esoteric language

I've reached 2300 rep, so here's a bounty for you RE/CTF enthusiasts for an answer I really want to see.

CVE-2018-6849: Code execution results in code execution
— TheZZAZZGlitch, "A friendly reminder: Lua scripts are arbitrary code", YouTube

Esoteric language interpreters and compilers are often pretty shoddily written. It is usually shrugged off because "nobody is going to use it for anything serious".

Your goal:

1. Find an existing interpreter, translator, or compiler for an esoteric language published before January 2021. Preferably, this should have an entry on esolangs.org or be under the "Recreational" category on TIO.
2. Find a bug in the interpreter, compiler, or generated code that allows you to escape the language and execute arbitrary code. This can be direct code execution, launching a shell, cross-site scripting, return oriented programming, making compilers emit arbitrary code, or something similar. If you can execute arbitrary code in the compiler itself, that counts as well.
3. Explain the bug (and, preferably, explain a way to fix it if it hasn't been patched)
4. Solve a code challenge posted before January 2021 using code executed from that exploit instead of the tools provided by the language.
5. Also be sure to explain the payload itself.

To be clear: You are only allowed to use features provided by the language to set up the payload and exploit. The logic to solve the puzzle must be entirely in the payload.

However, you are allowed to execute some code from the interpreter/compiler itself in the payload, e.g. for input and output or ROP chaining.

The following do not count:

• Exploits that just run the interpreter on arbitrary code in the same language. You must demonstrate full control over the interpreter.
• Exploits caused by the code you wrote. The code you wrote must only exploit the bug.
• Tools in the language intended to execute code (e.g. execve()/system() in C or things like eval()).
• Bugs in third party code or the programming language that the interpreter/compiler uses. (e.g. exploiting a Node.js bug in an interpreter written in JavaScript)
• Code challenges that are simply "crash the program" or the like: It should be something interesting.

Older releases of an interpreter/compiler are fine.

Since these are very system specific, please either provide an online demo or a Docker image. You are required to provide the exact build instructions in the latter case.

Custom compiler flags for building interpreters follow the same loophole rules.

See some of my answers for Shortest code that raises a SIGSEGV which highlight some interpreter bugs I found for a starting point.

While I may not be able to award immediately, I will try to award anywhere from 100-500 rep, depending on how much you impress me. Finding new exploits is strongly encouraged instead of using the same one over and over.

Take that Phooey freebie while you can!

Add a comment here or ping me in chat if I (likely) don't notice your post.

Awarded bounties

• 200 rep to Aaron Miller for this answer for escaping a string to execute arbitrary Python in Vyxal 2.4.0.

Answer 18

50-300 rep for answers to unanswered questions

Similar to this offering, I will offer varying amounts of reputation for answers to questions that meet the following criteria:

• The question is unanswered^*
• The question is at least one month old
• The question has a net score \$\ge3\$ and \$\lt 15\$
• The question is not tagged tips
• The question is open

_{^*: Unanswered means that no answers have been posted to the question which fully complete the task in the question}

This list of questions, sorted by current score, can be found here.

The amount of reputation I will offer depends on the following criteria:

• Age of the question (older questions will merit more rep)
• How impressive I personally find the answer (based on language, score etc.)
• How difficult I perceive the challenge to be

Obviously, these are subjective, but I will try to be as fair as I can.

Furthermore, if awarding a bounty will drop me below a privilege level, causing me to lose it, I will postpone awarding the bounty until I have enough rep to avoid this. However, such bounties will only be postponed, so all valid answers will eventually receive their deserved bounties.

To claim a bounty, as normal, ping me in chat or leave a comment below. If unable to do so due to reputation requirements, ask another user to do so for you, so I don't miss any answers.

Once you claim one of these bounties, please edit it in below

Claimed bounties

• 150 rep to HyperNeutrino for answering Generate Menu Access Keys
• 50 rep to HyperNeutrino for answering Expand the variadic expression
• 150 rep to wastl for answering Recording xiangqi moves
• 200 rep to Neil for answering Score a 1 player game of Carcassonne
• 50 rep to EasyasPi for answering Test the endianness
• 300 rep to m90 for answering Final tribute to John Conway: FRACTRAN self-interpreter
• 100 rep to tjjfvi for answering Please parse this aLL1en language
• 100 rep to ryno for answering The knight's next tour
• 100 rep to Dingus for answering Simulate a Game of Quagmire
• 50 rep to Dingus for answering Printing the Cracker Barrel Game

Answer 19

500-1000 rep for outscoring in Multiply with restricted operations

The current best score is 22 operations.

itx = 1/(1+a+b)     #4
nx = -1/(itx+itx)   #4
c = -( 1/(itx + itx + 1/(1+nx)) + 1/(1/(a+nx) + 1/(b+nx)) ) #14

Try it online!

I'll give 500 rep to the first better score, that is 21 operations or fewer.

Alternatively, you can get the bounty by proving that 22 is in fact optimal, say with exhaustive search. A weaker proof or lower bound can get a partial bounty.

The maximum you can get is 1000 rep, 500 for the optimal proof, and 500 for the solution less than 22 operations long.

Answer 20

50-100 rep for answers in TypeScript's type system

There aren't many answers here written in TypeScript's (turing complete) type system; as of posting, there six, two of which are my own. I like seeing such answers, so I'll be awarding a 50 rep bounty to answers that meet all of the following criteria:

• Are posted later than 2021-11-27 (date of bounty posting)
• Consist of a valid TypeScript source file containing a type alias that, given valid input as type parameters, results in a type representing valid output for the challenge
  • Input and output types can be any types that reflect the challenge's I/O requirements
    • For example, string literals are allowed for a challenge requiring string input, and tuple types are valid where tuples would be
  • Type parameters that aren't part of the input but have defaults are valid, even for challenges with no input
    • For example, type X<T="a">=T would be valid for a challenge "Output the literal string a with no input"
• Beat all other existing TypeScript type system answers in the challenge, if applicable
  • Beat, for the purposes of this bounty, can be done either by the challenge's scoring criterion or by erroring due to the recursion limit on notably fewer inputs
• Produce no compile errors (//@ts-ignore is allowed)
• Make a reasonable attempt to avoid the recursion limit. TypeScript has a very strict recursion limit; 50 for regular types and 1000 for tail-recursive types. Reasonable attempts include:
  • Anything that supports most inputs without erroring
  • Use of tail recursion to get the 1000 limit
  • Anything where I either do not choose to or am not able to send you an altered version that errors on notably fewer inputs
• Use at least one conditional type (e.g. A extends B ? C : D), template literal type (e.g. `foo${T}baz`), or variadic tuple type (e.g. [T, ...U]), and cannot be beaten by a solution which uses none
  • Most answers will pass this criterion; this is to exclude things like type A="Hello world!".
• Do not have any external dependencies (e.g. on type utility libraries).

If your answer does not meet any of these criteria, but you believe it is in the spirit of the bounty nonetheless, any of the criteria can be overridden by my judgement.

---

I'll award 100 rep (total) to answers that match all of the above criteria and at least one of the following criteria:

• Are the answerer's first answer in TypeScript's type system
• Include a decent explanation (this is, obviously, subjective)
• Demonstrate the turing completeness of TypeScript's type system by implementing an interpreter for a turing complete language
• Are notable in some other way (again, subjective)

---

If you're not familiar with programming in TypeScript's type system, the TypeScript Handbook, TypeScript Discord Server (I'm @T6 there), and the TypeScript Tips Question are all great resources.

---

To claim a bounty, post a comment on this post with a link to your answer. If I don't respond promptly, feel free to ping me (@T6) in #random of the TypeScript Discord Server, as I'm more active there.

---

Awarded Bounties

• 100 rep for user's answer to Convert Prefix to Infix
• 50 rep for Jacob's answer to 1, 2, Fizz, 4, Buzz (pending)

Answer 21

50-500 rep for answering one of my challenges in one of my languages

TL;DR: I, DLosc, will bounty your answer if you answer one of my challenges using a language I made.

Eligibility

Eligible challenges are any of my code-golf challenges.

Eligible languages include any programming language that was primarily created and developed by me. As of April 21, 2024, that means Acc!, Acc!!, Appleseed, BitCycle, Exceptionally, FunStack, HBL, Ouroboros, Pip, Regenerate, Sisi, tinylisp, tinylisp 2, or Zephyr. If I make a new language in the future, feel free to ping me or update the list yourself.

If there is already an answer to a challenge in a given language, another answer in the same language is not eligible for a bounty unless it outgolfs the existing answer. If you further golf someone else's answer that already won this bounty, I'll decide case-by-case whether to award another bounty.

Amount

How big of a bounty I award depends on how difficult the challenge + language combination is. Here's a general difficulty ranking of the languages:

• Usable: Pip
• Reasonably usable: Appleseed, tinylisp, tinylisp 2
• Inconvenient: Acc!, Exceptionally, FunStack, HBL, Ouroboros, Regenerate, Sisi, Zephyr
• Tarpit: Acc!!, BitCycle

But the difficulty also depends a lot on the challenge. Things that are trivial in Regenerate may be quite hard in tinylisp. And some challenges aren't easy in any language. Ultimately, the exact bounty amount comes down to my subjective judgment. You also get bonus points for a good explanation!

(A particularly jaw-dropping answer may get more than 500 rep. For example, if hypothetically someone solves Tiny Lisp, tiny interpreter in Acc!!, they're getting at least 1000. =P)

(Note from emanresu A: Now that the above has been done, the logical next step is a tinylisp interpreter in BitCycle. If someone does this, I will happily grant them at least 2500 rep in addition to whatever DLosc's willing to give.)

If other factors (for example, whether I've previously bountied the question) prevent me from bountying the answer with the amount I would like, I will work out another arrangement with you. The ideal arrangement would be bountying an answer to a different challenge written in the same language.

Bounties will be paused if my rep drops below 20,000.

---

Bounty Claims

Format:

- [Challenge title](answer link) in language by [username](code golf user profile)

• Calculating Collatz Cousins in tinylisp by AndrewBayly

• Chinese Checkerboard in tinylisp by AndrewBayly

Awarded

• Ungolf my tinylisp code in tinylisp by emanresu A (250)
• Is it true? Ask Pip! in Acc!! by Command Master (200)
• {Curly Numbers}; in Acc!! by Mukundan314 (300)
• Weave two lists, cycling if necessary in Acc!! by Mukundan314 (500)
• Reconstruct an arithmetic sequence in Acc!! by Mukundan314 (300)
• Tiny Lisp, tiny interpreter in Acc!! by emanresu A (1200)
• Tiny Lisp, tiny interpreter in tinylisp by Andrew Bayly (500)

Answer 22

50-500 rep for answering in my languages

I've (currently) published 21 languages, all of which can be found here and 16 of which are on Try it online!

I'm offering 50 rep to any answer that meets the following criteria:

• It is written in one of Add++, Adjust, Bitwise Fuckery, Deorst, NotQuiteThere, Orst, Rutger, Verbosity, Verbosity v2 or any version of Whispers
• It is the shortest answer in that language, at time of posting
• The challenge has fewer than 30 answers, not counting the to-be-bountied answer
• The challenge is tagged code-golf, and is not tagged tips
• The challenge is older than a week

I'm offering 100 rep to any answer that meets the following criteria:

• It is written in one of Commentator, Flipbit, Geo, Levels, No, Sample, Uno, Yggdrasil or √ å ı ¥ ® Ï Ø ¿
• It is the shortest answer in that language, at time of posting
• The challenge has fewer than 30 answers, not counting the to-be-bountied answer
• The challenge is tagged code-golf, and is not tagged tips
• The challenge is older than a week

Additionally, I will double the rep awarded for each of the following points met (to a maximum of 500 rep):

• It is the first valid answer to the challenge
• It is shorter than all other answers to the challenge (the challenge must have at least one existing answer)
• It uses a non-obvious\${}^*\$ method that helps it save bytes over the obvious method
• It is an answer to one of my questions

^{\${}^*\$I'll be the judge of what's "non-obvious", but generally, it's a method that isn't the immediate, go-to method}

Additionally, I will delay awarding bounties if they cause me to drop below 25000 reputation, until a point where I can award them.

Don't comment to claim bounties. Instead, edit in claims below

---

Bounty list

_{Stolen shamelessly from Adám's APL bounties}

Awarded bounties are struck-through.

Bounties in progress are bold.

Bounties on hold are italic.

If you have previously requested a bounty, you add can add more requests after the struck-through ones, otherwise add yourself to the below list to request a bounty.

The format is:

- [username](url-to-profile): [rep](url-to-answer-post), [rep](url-to-answer-post)

---

• lyxal: 100

• Razetime: 200

• Fmbalbuena: 50

Answer 23

500 rep - Bubblegum Factorial

Bubblegum is designed for constant output - unless the code has a specific SHA-hash, you won't be able to write a program which takes input.

So, I will award 500 rep for a factorial program in Bubblegum. I don't really expect this to be fulfilled, as it requires major advances in cryptography to be possible.

If anyone ever completes this, post it as a submission to the Factorial challenge, where I will award the bounty.

Answer 24

100 rep for Making a calculator in GNU sed

Considering it is hard to even make addition in GNU sed, It is definitely worth a bounty.

Answer 25

150 rep for a shorter C quine

Currently, the shortest known C quine (written by me) is 64 60 bytes. I will give 150 rep to anyone who tops this.

Rules:

• Must be a full program (include the main function, or otherwise define main)
• Cannot use the filename to store data
• Cannot pull data from the internet
• Cannot read its source nor its executable (thanks, Dennis)
• Must be more than 1 byte (bytecount includes flags)
• Must be system-independent (you may assume POSIX and ASCII)

Answer 26

500 rep for a shorter payload capable V quine

Currently in V, there are two important quines:

2i2i

is the shortest known quine, but not modifiable. And

ñéÑ~"qpÿ

is the shortest known trivially modifiable quine. This is because

ñéÑ~"qp<CODE>ÿ

pretty much anything you want can go in the place of CODE, and it will still be a valid quine. You can see this on these answers:

• https://codegolf.stackexchange.com/a/111209/31716

• https://codegolf.stackexchange.com/a/107032/31716

Although these used a former version of the extensible quine, namely:

ñi<C-v>241<esc>"qpÿ

Either one could be easily modified to use this newer quine. Another good example is filling CODE with 'l's should always work. I will award this bounty to the first user to find a shorter extensible quine. For the purpose of this bounty, extensible means that any code you want to add to it will be recorded into some register and then pasted later, which is how the current solutions work (into register 'q' FWIW).

For completeness sake, I have found several 8-byte solutions:

ñéÑ~"qpÿ
ñéÑ~"qpx
ñéÑ~"qðÿ
ñéÑ~"qðx
ñ"qpÁÑ~x
ñ"qpÁÑ~ÿ

And many more trivial modifications that aren't worth posting. If you'd like more explanation on any of these, or want more examples, feel free to ping me in TNB or Vim-Golf.

Answer 27

100 bounty: Minecraft redstone prime checker

What it says on the tin.

My version of a valid prime checker uses:

• levers as input (ON = 1, OFF = 0), representing a binary number
• redstone lamp as output (ON = prime, OFF = not prime)

I offer 100 reputation to make an expandable prime checker - that means that you can expand the prime checker in any direction infinitely, with minimal redstone wiring (connect the two "modules" together using redstone) and the prime checker still works.

You are allowed to use any block except for structure blocks and command blocks.

Do I need more clarification?

Answer 28

500-2000 reputation for a golfy language

This bounty will be awarded to a new golfing language (more precisely, to an answer in that language by its author to Showcase of Languages) that

• Bests all pre-2019 languages by 10% or 2 bytes (whichever is greater) in 10 pure code-golf challenges.
  • The 10 challenges must be a subset of 100 consecutively posted challenges from before February 11, 2019.
  • No challenge of the 10 is written by the the language's author.
• Is on TIO.run.
• Has available documentation.
• Is otherwise sufficiently non-cheaty (at my discretion). Huffman coding is okay; builtins that don't generalize are not.
• All of the above remain true for 1 week.

The bounty amount doubles for every additional 10% improvement up to a 2000 rep, so a language that improves on all pre-2019 languages by 30% in each of the 10 challenges will be awarded the maximum 2000 rep; a 15% improvement nets 700 rep, and so on.

Answer 29

900 rep for a shorter Klein Topololyglot

What it says on the tin, beat the current best and I'll give you 400 rep. (and 500 from me, Jo King)

Previous winners:

• August 15th 2017: 0 '

• August 29th 2018: JoKing

Answer 30

50 reputation for first answers in FP languages

I find golfing in functional programming languages, and I'd like to get more people involved to make it more competitive. Therefor I am offering 50 reputation for each user's first answer in:

• Haskell
• Curry
• Elm

You may claim all 3 bounties.

In order to be eligible the following criteria should be met:

• You don't have any answers in the language prior to this bounty. (The point is to encourage newcomers)
• You haven't claimed a bounty here in this language previously.
• The answer is sufficiently novel. If it is the first FP language submission to the challenge or if it out-golfs an existing answer in the same language that suffices. If for example you simply port the existing Haskell answer to Curry by changing the pattern matching, that doesn't count. Cases in between I will judge on a case-by-case basis.

Edit the list below to claim the bounty:

• [username]: [challenge name](answer link) in Lang1, [challenge name](answer link) in Lang2