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

500 rep for the first engineered pattern in Live a longer life

Currently, all the answers to Live a longer life, except the first few ones, are either found by soup search, or is a predecessor of other answers. They are discovered instead of constructed.

I offer 500 rep for the first answer with an engineered pattern. This mean that the pattern should be constructed from small parts and make use of the reactions between the parts. Some examples of engineered patterns can be found here.

Answer 2

200 reputation for golfing in Vyxal 3

Note that this is separate and distinct from the other Vyxal deadlineless bounty.

Hi so Vyxal 3 exists and it's brand new and doesn't have very many answers at all. I think that needs to change, because it's a very cool language and y'all'll like it. In fact, I think you'll like it so much that you'll get free rep for using it! That's right free rep! Wonderful stuff!

And I don't mean the rep you get from upvotes. I mean I will give you 200 green points if you post five (5) Vyxal 3 answers. With 200 rep you can buy, well, uh, nothing because there's no rep-to-USD exchange, but still, that's like 20 upvotes. Much rep! Much wow!

Is this solicitation of golfers? Probably. Is it a form of bribery? Maybe. Will you end up wanting to stick around for more than 5 answers? I'm very confident you will!

Like last time:

Bounties will be suspended if rewarding the bounty dips my (lyxal's) reputation below 10k. If, on the off-chance, this bounty proves to be popular enough, I may adjust the rep I award to avoid completely tanking it.

A final note: If you've already claimed the Vyxal 2 bounty, cool. Those don't count towards this bounty, so you'll need to post 5 answers in Vyxal 3.

---

Useful links

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

Claims

Format:

|**[$username](\$link)**| link1 | link2 | link3 | link4 | link5 | ❌ | ❌ |

Make sure you put spaces before and after the links so that the markdown formatter converts them to question titles when rendering. Also, leave the last two columns empty, those are for admin and keeping track of what's been bountied..

User	Answer 1	Answer 2	Answer 3	Answer 4	Answer 5	Posted (Which Post Number)	Awarded
Pacmanboss256	Lolololololololololololol	Multiplicative persistence	Count without 3	Determine your language's version	Diagonal Alphabet	✅ (3)	✅
Fmbalbuena	Find the Factorial!	Play the "bzzt" game	Count up forever	Even or odd: three player	Drawing the Stack Overflow logo	✅ (4)	✅
Nick Kennedy	Print the Christmas alphabet	Limited letter renderer: BIOPD	How many paint tins do I need?	Finding the power sandwich	80% of respondents agreed…	✅ (2)	❌
math scat	"Perfect" an array	Output all the different counts of points	Can the chefs go?	ASCII-art milk carton	Validate a CPF number	✅ (5)	❌

Answer 3

100 rep for a neural network (or other new thing) that writes Moby Dick

This will be awarded in Write Moby Dick, approximately when one of the following conditions is met:

• an answer is posted based on neural networks and gets a reasonable score. (It doesn't need to compete with the top answers, just do reasonably well.)

• an answer is posted that takes a different method from the existing answers, in my subjective opinion. All the current top answers use variations on a Markov model (i.e. store substrings of length n and guess the most common next letter); I'm looking for an answer that does something significantly different from this. As above, this should score reasonably well but need not compete with the top answers.

• an answer is posted that (a) uses a sophisticated method (in my subjective opinion), and (b) has a good explanation of that method, where "good explanation" means I could implement it myself without reading the code. This bounty could be awarded to an existing answer, if one is updated with a good explanation.

Answer 4

500 reputation bounty to the first Turing completeness proof or disproof for any answer to this question based on proofs or disproofs of their respective conjectures

This is a long-term bounty which I am not making for the "lol"s.

I will create a 500 reputation bounty to the first answer to prove or disprove the Turing completeness of their program in this challenge. To celebrate the proving or disproving for any of the conjectures referenced in this challenge, I will gladly give a 500 rep bounty.

Answer 5

400 reputation for an answer to Paint Starry Night that takes top place without built-in compression

The bounty will be awarded to the first answer that takes first place (i.e. lowest score) without using an off-the-shelf compression routine. I'll award it even if it's immediately beaten by another answer. Currently the score to beat is 4159.06.

Answer 6

200 rep for an Abstract Rewriting System under 100 points

This will be awarded to the first answer to Abstract Rewriting Challenge (Cops) that scores less than 100 points and doesn't get cracked (or invalidated).

Answer 7

100 rep for a Haskell answer to "Make me some curry"

I'll offer a 100 rep bounty for a Haskell answer to the above mentioned challenge. I might offer more than 100 rep for an interesting answer (for example not just copying the Idris answer or a clever TH answer).

Given that tuples are tricky with Haskell and that you can't use lists (can only contain one type), feel free to define your own data-type or use an appropriate one from an existing library on hackage.

Note: This bounty is tied to the one below, if someone gets the second bounty I will delete this one!

200 rep for a low-level answer (machine language, C or similar)

I'd love to see an answer that's really low-level, that's the main reason I allowed taking the number of arguments as input because otherwise it seems impossible.

Answer 8

200 reputation for the true Alchemist

I don't know a lot about chemistry (nor alchemy), however - having written Alchemist - I'd be impressed if someone manages to use it as an actual chemistry tool:

If you manage to write a solution in Alchemist for the question Number of n-carbon alkanes, I'll reward you with a bounty of 200 reputation.

---

_{Edit: Changed the language's specs slightly to make integer output easier, proper string literals & a forgotten feature printing whether a computation was deterministic (using -d1): Try it online!}

Answer 9

500 rep for a ridiculously huge number

There are currently no valid answers to Golf a number bigger than Loader's number. This bounty will be awarded to the valid first answer that either

• Is under 256 bytes, or
• Outputs a number significantly larger than Loader's number (i.e. larger than any simple modification to loader.c).

Answer 10

200 – 500 rep for outgolfing my Fibonacci regex

If you can write an ECMAScript (pre-2018, no lookbehind) regex that matches exactly the same set within the domain ^x*$ as my 161 byte regex, i.e. all nonnegative Fibonacci numbers in unary, I will award at minimum a 200 rep bounty. If it's a really significant reduction in size, or especially interesting mathematically, that bounty may increase (up to 500).

This was the first really large regex I ever wrote, and I think I've finally milked it dry golf-wise. But I've been wrong before.

Answer 11

1000 rep for \$\pi(n)\$ in unary ECMAScript regex

This is something I've been thinking about ever since 2014, and I haven't been able to get anywhere with it. See my answer to Prime counting function for an explanation as to why I suspect it is impossible.

I will award 1000 rep (or 100-500 rep for (4)) for one of the following things regarding the implementation of \$\pi(n)\$ in a regex:

1. An implementation of \$\pi(n)\$ in one of the following regex flavors (see below), posted as an answer
2. A convincing explanation of an algorithm that could be used (which I could then set about implementing in a regex).
3. A proof that it is impossible in one of these flavors – the bounty will be awarded as soon as I can understand the proof, at least to some satisfying degree (which might involve some Q&A).
4. 100-500 rep for either (1) or (2) but using scratch space, where the amount of scratch space needed is less than \$O({n^2\over log(n)})\$, or equivalently less than \$O({n\pi(n)})\$, in its asymptotic growth. The scratch space will be provided as delimited unary, with your choice of delimiter character (i.e., the input to the regex will be \$n\$ in unary followed by a delimiter followed by the scratch space in unary). The amount of bounty will depend on how much less than \$O({n\pi(n)})\$ the required scratch space is, as well as the creativity/ingenuity of the solution. The regex should of course not be able to take its answer by measuring how much scratch space it's given – it should expect some random number will be added to the minimum required scratch for a given \$n\$, and for any amount of supplied scratch space of the minimum or higher, should always give the same answer.

The regex flavors (with scalar unary input and output):

• ECMAScript (pre-2018)
• ECMAScript with (?*) molecular lookahead / non-atomic lookahead, as supported by RegexMathEngine
• ECMAScript 2018, with (?<=) / (?<!) right-to-left evaluated variable-length lookbehind

Post it as an answer to Prime counting function, even though for (2), and (4) it's technically not one, since this is my only way of awarding the bounty. In the case of (2) or (4).(2), once I've constructed the regex, I'll either post it as my own answer (giving credit to you for the algorithm), or as an edit to your post, whichever you prefer (if the latter, then please specify).

In the case of (3), I guess the best way to do this is that you post the proof as an answer to this CS.SE question or elsewhere, and tell me which post on CGCC you would like me to award the bounty to.

(Only 500 rep can be awarded at a time, so the 1000 will be awarded in two back-to-back bounties. Or in the case of (3), to two different posts if you prefer.)

Answer 12

50-450 rep for answers in Scala

I'm giving out bounties for answers in Scala, an amazing language that is unfortunately rarely used here. Any Scala answers gets 50 rep from me, and if the following are met, you can get a bonus:

• Good explanation: +50-100
• Cleverly done: +50-200
• Wins challenge when posted: +100

The first two are subjective, but I'll try to be as fair as possible when awarding those. Also, I can only award the bounty if it won't cause my reputation to drop a privilege level. If I've already answered the same question or put a bounty on it, the bounty will have to be started on a different answer of yours.

Answer 13

500-2500 reputation for a non-trivial answer to Pristine Polyglots

The current - and only - answer is fairly trivial, exploiting the fact that multiple shell languages have almost identical behaviour for the echo.

I offer 500 reputation for an answer that uses 3 or more different languages such that each program in each language is non-trivial (i.e each program consists of different commands)^*. Additionally, I will offer an additional 500 reputation if each answer provides a distinct, non-trivial output, and a further 500 reputation if this (that is, a program that qualifies for 1000 rep) can be extended to 7 or more languages.

^*: Ultimately, "non-trivial" is a subjective quantifier. However, in this context, my judgement will qualify an answer, and a valid answer will consist of a program that is pristine in each language such that any given command in the program is likely to perform a different function in each language, but overall, the function should be the same for every language.

Furthermore, I'm willing to increase the bounty amount by either 500 or 1000 reputation, depending on how impressive I find the answer.

---

To claim the bounty, don't worry about notifying me - I should receive the notification when you answer. If the bounty hasn't been set within a week of your answer, leave a comment, or ping me in chat.

Answer 14

50 reputation for an Hello World version that consist of a Google’s native client executable.

These are just elf files. but with special calling conventions.

• the file should be less than 1000 bytes.
• the file should contains runnable code without modifications. So it must be a .nexe or a shared object.
• a +10 bonus if the elf file targets the armelv7 architecture (provided google chrome should load it on chrome os for arm).

Answer 15

More unsuitable language bounties: 2 x 500

Similar in spirit to lirtosiast's bounties

• 500 rep for an answer in Mornington Crescent to Somewhere On The Tube ...But On Which Lines?
• 500 rep for an answer in Hexagony to HexaRegex: A Tribute to Martin Ender

Answer 16

500 rep for a Brain-Flak answer to Balance the Brackets

The challenge is clearly brain-flak related, and should have a brain-flak answer, though this is understandably difficult.

Answer 17

200-400 rep for discompassionate geometry

Construct a pentagon avoiding compass use is about finding a compass-and-straightedge construction of a regular pentagon while minimizing the number of circles drawn.

The Poncelet-Steiner theorem says that any construction possible with a compass and straightedge is possible with one circle, its center, and a straightedge. Finding such a construction is another matter.

Because the construction rules in this challenge are slightly different from the premises of the theorem (arbitrary points cannot be drawn in this challenge, which necessitates a second circle to construct anything nontrivial), it will not be valid for that challenge. Nevertheless, 200 rep goes to the first answer to that challenge that both:

• Contains a construction in 1 circle (which necessarily includes adding arbitrary points) and makes a reasonable effort to golf the number of points and lines drawn
• Also contains a valid solution or a proof of optimality of the current best solution.

If the answer is an improvement on the current best or a proof of optimality, I will award an additional 200 rep.

Answer 18

50-250 rep for first answers in ThumbGolf

In celebration of ThumbGolf leaving pre-alpha, I will give the first ThumbGolf answer per user a bounty.

I will be following similar rules to Adám's APL challenge.

Specifically:

• The program must not be a normal Thumb-2 program. It must make use of the ThumbGolf runtime.
  • Specifically, if I remove all ThumbGolf instructions, the program should not solve the challenge.
• Only a user's first ThumbGolf answer will count.
• The user must not be a 👋 New contributor to avoid giving the rep to alt accounts
• I will reward between 50-250 rep depending on how much I like the solution and its explanation. Don't blow it on something lame.
• I will give this a maximum of 5 times (unlike my ACE challenge). If the bounty will make me lose a privilege level, I will queue it.

Answer 19

500 rep for a Vim answer to Sticky Polyhexes

What it says on the tin. An explanation would be appreciated.

Language must be Vim, not the V derivative. Good luck!

You may use bash commands in your script, but only commands which are in vanilla bash(no coreutils).

Answer 20

50-200 rep for good programming puzzles

We need more programming-puzzle questions! If you post a good one, I'll give you between 50 and 200 rep depending on how interesting it is to me.

I may decide to wait until someone posts a solution, and/or until your intended solution is revealed, before deciding to award a bounty.

I will decide to award one only if I see fit, not upon request, but if you think I might have missed your question (it's more likely I just wasn't interested in it (nothing personal)), you can message me in The Nineteenth Byte.

I will not award bounties if the rep decrease will cause me to lose SE privileges.

Since bounties can only be awarded on existing answers, not existing questions themselves, you need to have at least 1 answer to receive this.

Answer 21

500 rep for another answer to Print this text in Scala

hyper-neutrino's found an answer already, but it isn't the intended one. I'll award a 500 rep bounty to anyone who does it without using comments or multiple calls to print. Brownie points if it's the exact same as mine (not including spacing, of course).

Update: pxeger's also found an answer, but that isn't the intended one either. I'll award another 500 rep bounty to anyone whose code goes inside a single call to print (no defs or commented lines outside it).

Note that I don't want an answer that's the same as mine, and would prefer for it to be different, I'd just like to see a more interesting approach than printing the text and then dealing with the >) part outside of the original call to print.

Answer 22

500 rep for a shorter Hello, World in Lost

The Hello, World record in lost dropped to 36 bytes. Since then I have been trying to get it lower. I'm willing to give 500 reputation to anyone who can come up with a Hello World in 35 bytes or less.

It must be a valid answer to the hello world challenge. It must deterministically print the exact string Hello, World!.

100 rep for an answer in Lost

As a more general incentive for programming in Lost I am offering 100 rep for any answer in Lost.

Broadly speaking any Lost answer to any challenge which does not already have a Lost answer is eligible. However I reserve the right to deny the bounty to any "cheaty" answers. This includes

• answers to questions which seem to have been asked just so that one can cash in on this bounty
• answers to questions which have extremely lax validity criteria. For example making a cop on a cops and robbers challenge will probably not get you this bounty.

As long as your answer is, in lost, works, and shows a baseline amount of effort I would be happy to award this bounty.

If you are looking for a place to start here are some questions that I think are answerable in Lost.

• A Chiral Puzzle
• Happy Birthday Caird Coinheringahing Chartz Belatedly
• I'm a Lizard Cut Here

source-layout is a pretty good tag to browse to find more of these.

I may not be able to create a 100 rep bounty on the question you have answered. If this is the case we can work something out. If your answer is particularly impressive or inventive I will probably just award it more than 100.

Answer 23

50-200 rep for interesting zsh answers

I will award this if:

• the answer is interesting
• you have not been awarded this bounty before
• it will not cause me to go below a privilege level

Possible bonuses if:

• a particularly good explanation is provided
• it is the first answer to the question
• it out-golfs me

Answer 24

200 rep for n > 10 for my fastest-code challenge

This is a long-bounty. I will award 200 reputations to the first answer which gets a score of n=11 or better for my challenge.

Answer 25

200 rep for a low-entropy maximal discrepancy-2 sequence

Compress a maximal discrepancy-2 sequence is about compressing a particular discrepancy-2 sequence.

Maximal discrepancy-2 sequence with minimal entropy is about finding a maximal discrepancy-2 sequence that's easier to compress.

This bounty will be awarded to an answer meeting all the following conditions:

• It is the shortest answer to question 2
• It is at least 3 bytes shorter than the shortest answer to question 1
• Both of the above remain true for 1 week.

Answer 26

100 rep for interpreting a TC language in Tarfish

Answers should go to this question. Add a comment to this as well.

Some ideas:

• https://esolangs.org/wiki/Bitwise_Cyclic_Tag

• Any tag system

• Anything implemented in the linked question

• FRACTRAN

Answer 27

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)

NOTE: Comment to receive your reputation

Answer 28

100-200 reputation for the first crack of my "Find my other token" answer in Husk

I will offer a 100 rep bounty for the first crack of this, or 200 rep if it's the cracker's first Husk post.

Answer 29

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.

Answer 30

150 rep for the winning submission on the winning team of Team of The Hill!

Rules:

• The winning submission is the bot on the winning team with the most kills at the end.

To claim the rep, comment below: