84
\$\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 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

\$\endgroup\$
10
  • 5
    \$\begingroup\$ How do you have a bounty without a deadline? \$\endgroup\$
    – Beta Decay
    Jul 5 '15 at 18:11
  • 25
    \$\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
  • 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
  • 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\$ 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\$ 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
  • 1
    \$\begingroup\$ -2: his/her --> their? (if i could edit, id do it myself) \$\endgroup\$ Oct 19 at 14:15

65 Answers 65

4
\$\begingroup\$

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).
\$\endgroup\$
1
  • \$\begingroup\$ 256 bytes? Wow, that thing would probably win Bignum Bakeoff when it was made earlier. \$\endgroup\$
    – Naruyoko
    Apr 30 '19 at 0:15
4
\$\begingroup\$

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

\$\endgroup\$
4
  • 1
    \$\begingroup\$ Since a proof wouldn't be a valid answer to that challenge, you might want to award the bounty to a different answer of whoever claims it. \$\endgroup\$
    – rues
    Mar 29 at 19:47
  • 1
    \$\begingroup\$ Is the number of matches a valid output form, or must the output be the length of the first match? \$\endgroup\$
    – tjjfvi
    Sep 14 at 2:34
  • \$\begingroup\$ @tjjfvi Thanks for the question. The output does indeed have to be the length of the first match and there needs to be only one match ("scalar unary output"). It would of course be trivial to output as the number of matches; just match all the primes not greater than n, (?!(xx+)\1+$|x?$). \$\endgroup\$
    – Deadcode
    Sep 17 at 2:31
  • \$\begingroup\$ Yeah, I figured that probably wasn't what you were looking for, but I thought I'd at least check. \$\endgroup\$
    – tjjfvi
    Sep 17 at 4:32
4
\$\begingroup\$

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!".

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

\$\endgroup\$
1
  • \$\begingroup\$ I hope my answer to Convert Prefix to Infix qualifies. \$\endgroup\$
    – rues
    Nov 28 at 20:08
3
\$\begingroup\$

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).
\$\endgroup\$
3
  • 1
    \$\begingroup\$ I don't believe you can offer a 60 rep bounty so I am not sure what you mean by the +10 bonus. \$\endgroup\$
    – Grain Ghost Mod
    Mar 5 '17 at 18:57
  • \$\begingroup\$ @WheatWizard : the upvote ? \$\endgroup\$ Mar 5 '17 at 19:47
  • 4
    \$\begingroup\$ @user2284570 Upvotes are not for doing something extra you wanted, they're for when you think a submission is clever/valid/good/golfy. \$\endgroup\$
    – MD XF
    May 28 '17 at 22:55
3
\$\begingroup\$

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

\$\endgroup\$
3
\$\begingroup\$

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!

\$\endgroup\$
9
  • \$\begingroup\$ @PeterTaylor: That was a really annoying mis-feature of the language, I changed the specs as follows: Out_"..." will print the string ... and Out_xxx will print the amount of xxx atoms. (I also changed the way string-literals get parsed, it now behaves as if it were a Haskell string-literal (eg. parsing \n instead of a real new-line or \NUL for null-bytes etc.)). (Couldn't fit the link into a message, editing it into the answer itself for the time being, until TIO pulls the latest commit) \$\endgroup\$ Jan 17 '19 at 14:42
  • 1
    \$\begingroup\$ @PeterTaylor: TIO.run and esolangs.org are up-to-date now. \$\endgroup\$ Jan 17 '19 at 15:34
  • \$\begingroup\$ @PeterTaylor: What problems? If you have ghc installed an need help, let me know. \$\endgroup\$ Jan 19 '19 at 12:40
  • \$\begingroup\$ @PeterTaylor: Oh wow, that's quite an old one. Instead of using Data.Map.Strict does Data.Map work? It shouldn't make a big difference. The other transformations you did seem sound. \$\endgroup\$ Jan 19 '19 at 14:42
  • \$\begingroup\$ That allows me to make progress; it also can't find Data.Bifunctor and suggests Data.Functor, which again allows me to make progress. Then there's a whole bunch of errors, a mixture of ambiguities between functions from Data.List and from Data.Foldable, and various methods not in scope (sortOn, pure, first, second, <*>). Meanwhile I've got my Python implementation finished and done some basic testing. I think I'm about ready to start the actual challenge. \$\endgroup\$ Jan 19 '19 at 23:46
  • \$\begingroup\$ @PeterTaylor: I'm terribly sorry about all this :( Pushed a change, that doesn't rely on Data.Bifunctor. I'm not sure about the ones with List and Foldable. I know where the issue with pure and (<*>) is, but tbh I'm not sure how to do a backwards compatible implementation just yet without rewriting lots just yet. \$\endgroup\$ Jan 19 '19 at 23:56
  • \$\begingroup\$ @PeterTaylor: Sounds good, will do tmw. Created a new branch here which could fix things (oldest version I should be able to test is ghc-7.8.4, but can't get it to work). Still not sure about the List/Foldable issues. \$\endgroup\$ Jan 20 '19 at 0:33
  • \$\begingroup\$ It is kind of interesting to see how Haskell is changing :) Btw. I can't see your changes to the esolangs entry. \$\endgroup\$ Jan 20 '19 at 0:39
  • 3
    \$\begingroup\$ Took me a while, but I finally got it debugged and golfed. \$\endgroup\$ Feb 7 '19 at 16:14
3
\$\begingroup\$

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.

\$\endgroup\$
1
  • \$\begingroup\$ I don't understand: in what situation would you only be giving 200 rep? \$\endgroup\$ 9 hours ago
3
\$\begingroup\$

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.

\$\endgroup\$
3
\$\begingroup\$

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

\$\endgroup\$
1
  • 1
    \$\begingroup\$ If this ever gets claimed, the answer's going to be a strong candidate for yearly Best Of. \$\endgroup\$
    – Bubbler
    Apr 20 at 3:54
3
\$\begingroup\$

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.

\$\endgroup\$
1
  • 1
    \$\begingroup\$ Done! \$\endgroup\$
    – pxeger
    Jun 18 at 17:04
3
\$\begingroup\$

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.

\$\endgroup\$
2
\$\begingroup\$

More unsuitable language bounties: 2 x 500

Similar in spirit to lirtosiast's bounties

\$\endgroup\$
1
  • 1
    \$\begingroup\$ I'll add another 500 to the HexaRegex. \$\endgroup\$
    – NieDzejkob
    Apr 7 '18 at 14:00
2
\$\begingroup\$

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.

\$\endgroup\$
1
  • \$\begingroup\$ I was looking into this. First thought: Oh surely it couldn't be that bad. Then I realized that Damerau-Levenshtein includes swapping. Second thought: Holy ****, I don't think anyone will ever be able to do this. \$\endgroup\$
    – DJMcMayhem
    Feb 1 '18 at 22:19
2
\$\begingroup\$

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.

\$\endgroup\$
2
  • \$\begingroup\$ I upped the challenge :) \$\endgroup\$
    – user9207
    Jul 14 '18 at 6:54
  • \$\begingroup\$ I won't edit myself as I don't want to assume which is your intended amount, but the 200 in the title doesn't match the 100 in the body. \$\endgroup\$
    – trichoplax
    Sep 2 '18 at 10:12
2
\$\begingroup\$

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.
\$\endgroup\$
2
  • \$\begingroup\$ Does it have to be three bytes shorter than the shortest answer overall, or just 3 bytes shorter than the shortest corresponding answer in the same language? \$\endgroup\$
    – Dennis
    Nov 29 '18 at 1:01
  • \$\begingroup\$ @Dennis To the shortest overall. \$\endgroup\$
    – lirtosiast
    Nov 29 '18 at 1:03
2
\$\begingroup\$

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.
\$\endgroup\$
2
\$\begingroup\$

50 rep for each first sed answer

If these conditions are met:

  • Giving away this bounty does not make me go below 400 rep.

  • The question has at least 3 total upvotes

  • The answer is the first answer for that question

  • It's not

  • The answer has at least 1 total upvote

  • I approve (I probably will)

  • The answer is in POSIX or Gnu sed, and I'm less likely to award the bounty if it uses e unnecessarily.

\$\endgroup\$
2
  • \$\begingroup\$ So currently, you can only give it once… \$\endgroup\$
    – Adám
    Feb 17 at 20:10
  • \$\begingroup\$ @Adám yes, but I'm working on that :) \$\endgroup\$ Feb 17 at 21:50
2
\$\begingroup\$

50-200 rep for good programming puzzles

We need more 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.

\$\endgroup\$
2
\$\begingroup\$

50-200 rep for interesting zsh answers

Zsh is the Language of the Month for November 2021! For the month of November only, all first time Zsh users' answers will be eligible for this bounty!

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
\$\endgroup\$
4
  • \$\begingroup\$ Hi, is this answer eligible for a +50 bounty? \$\endgroup\$
    – wasif
    Mar 25 at 16:20
  • \$\begingroup\$ @Wasif not as an answer to your own challenge I'm afraid (especially since it wasn't a particularly interesting question) \$\endgroup\$
    – pxeger
    Mar 25 at 16:33
  • \$\begingroup\$ Does this apply to zsh answers that also work in bash, or do they have to use at least one uniquely zsh feature? \$\endgroup\$
    – AviFS
    Sep 15 at 5:19
  • \$\begingroup\$ @AviFS yes a Bash polyglot is fine, but it mainly depends how interesting it is ;) \$\endgroup\$
    – pxeger
    Sep 15 at 6:17
2
\$\begingroup\$

100 rep for interpreting a TC language in Tarfish

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

Some ideas:

\$\endgroup\$
1
\$\begingroup\$

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:

\$\endgroup\$
2
  • 2
    \$\begingroup\$ You cannot place two +50 bounties on the same question. Every time you offer another bounty, you have to double the amount, up to the limit of +500. Also, since you posted an answer yourself, the first bounty must be +100 or higher. \$\endgroup\$
    – Dennis
    Apr 28 '17 at 15:56
  • 3
    \$\begingroup\$ Finally, if these bounties are going to be awarded at a specific moment, they're not really bounties with no deadlines. \$\endgroup\$
    – Dennis
    Apr 28 '17 at 15:57
1
\$\begingroup\$

100 rep for beating me in the Cardinal code challenge

What it says on the tin. Beat my Brain-Flak answer (in Brain-Flak of course) and I'll give you 100 rep.

\$\endgroup\$
1
  • \$\begingroup\$ I had a stab at this just now, and it is deceptively difficult. \$\endgroup\$
    – Razetime
    Sep 21 '20 at 14:54
1
\$\begingroup\$

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.

\$\endgroup\$
2
  • \$\begingroup\$ Man, I've never tried to use the electronics in Factorio. I will give this a try though \$\endgroup\$
    – Jo King Mod
    Nov 13 '18 at 7:21
  • \$\begingroup\$ 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. \$\endgroup\$
    – jimmy23013
    Dec 10 '18 at 10:56
1
\$\begingroup\$

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.
\$\endgroup\$
3
  • \$\begingroup\$ Do you have any docs or tutorials for Whispers? \$\endgroup\$
    – Bubbler
    Aug 31 '20 at 5:25
  • 1
    \$\begingroup\$ 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.) \$\endgroup\$
    – Bubbler
    Aug 31 '20 at 6:31
  • 3
    \$\begingroup\$ Posted an answer. Looks like eval will have the best score even if there are language-internal ways to achieve TC. \$\endgroup\$
    – Bubbler
    Aug 31 '20 at 8:06
1
\$\begingroup\$

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!

\$\endgroup\$
2
  • \$\begingroup\$ I'll fork over another 500 if that 2D language is Lost. \$\endgroup\$
    – Grain Ghost Mod
    May 13 at 12:04
  • \$\begingroup\$ @WheatWizard it's already been claimed, but I can add in a bounty for Lost if you want. \$\endgroup\$
    – Razetime
    May 13 at 12:28
1
\$\begingroup\$

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.

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.

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

300+ rep for any nontrivial code golf answer in Lean or Coq

Partially influenced by the LotM of October 2021 (Lean), but not limited to this period.

Coq and Lean are academic languages mainly designed to establish and prove mathematical theories. Due to their type-theoretic and logical nature, they are NOT Turing-complete (any function should have some kind of evidence that it terminates for every possible input), and it is significantly harder to even write seemingly simple functions. (They don't even have a way to interact with stdin/stdout like other languages, so full-program challenges are out of scope by default.) Turing-incompleteness also means that a bunch of "Turing-complete language interpreter" challenges are rightout unsolvable.

Therefore, I'll award at least 300 rep to any Lean or Coq answer that shows any kind of nontrivial effort to solve a code golf challenge. There is no upper bound; if I see an answer as extremely impressive, I'm ready to award multiple 500s to a single answer.

Trivial solutions include (but are not limited to): simple combinations of library functions, trivial modifications to easily searchable piece of code on the Internet. I reserve the right to refuse to award the bounty to relatively cheap solutions of any kind.

\$\endgroup\$
1
  • \$\begingroup\$ No love for Agda :( \$\endgroup\$
    – Grain Ghost Mod
    Oct 4 at 16:37
0
\$\begingroup\$

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.

\$\endgroup\$
5
  • 1
    \$\begingroup\$ Queues, GOTOs, definitely tryable. goes and starts solving \$\endgroup\$ Mar 22 '17 at 10:33
  • \$\begingroup\$ @SIGSEGV thanks, good luck. \$\endgroup\$ Mar 22 '17 at 20:14
  • \$\begingroup\$ In the GitHub page I see Keyboard Binding, and Graphics. Oh yes, this would be good. \$\endgroup\$ Mar 23 '17 at 9:28
  • \$\begingroup\$ @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. \$\endgroup\$ Mar 23 '17 at 19:07
  • \$\begingroup\$ Yup. Thought of that too. \$\endgroup\$ Mar 23 '17 at 22:56
0
\$\begingroup\$

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.
\$\endgroup\$
0
\$\begingroup\$

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.

\$\endgroup\$
3
  • \$\begingroup\$ For your C# interactive program, Write("Hello, World!") is shorter than what you have right now, at 22 bytes \$\endgroup\$
    – Gymhgy
    Mar 10 '19 at 4:18
  • \$\begingroup\$ oh, true, will change soon \$\endgroup\$
    – ASCII-only
    Mar 10 '19 at 5:24
  • 1
    \$\begingroup\$ Can you add l33t? \$\endgroup\$
    – MilkyWay90
    Apr 26 '19 at 1:04

You must log in to answer this question.

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