# List of bounties with no deadline

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

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

# Guidelines for updating

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

# Browse your current bounties

• How do you have a bounty without a deadline? Jul 5, 2015 at 18:11
• @BetaDecay They're unofficial bounties - if and when the feat is accomplished, a bounty will be created and the rep will be awarded. Jul 5, 2015 at 19:16
• There's a TNB feed for these bounties now. In order to pick your bounty up, you have to add an answer to this question. Question edits and answer edits won't be picked up by the feed. Oct 22, 2016 at 17:36
• Would it help to have a stack snippet in the question that just lists the first line of each answer as a link, rather than keep editing? Oct 23, 2016 at 22:23
• Since the problem of stuff being posted in the question wasn't fixing itself, I've taken extreme action. If people want to sort bounties by amount offered, there are plenty of stack snippets which produce a table based on the answers: one of those can be adapted. Similarly, checking whether users are "active" or "passive" can be done with the SE API. May 7, 2018 at 10:34
• @PeterTaylor It should be noted that not all the bounties in the question had corresponding answers, so you may have removed some completely. May 10, 2018 at 20:34
• @mbomb007, I checked the first dozen manually and then I counted and reasoned that since there were considerably more answers than lines in the question I was wasting my time. May 10, 2018 at 22:40
• @PeterTaylor As an example, randomra had some bounties, but this search shows he has no current answers. Maybe you could write a script? Or ping everyone who had a bounty in the question, and they can deal with their own bounties. May 11, 2018 at 3:25
• I wish a bounty on Windows Batch/VBScript answers Mar 24, 2021 at 15:50

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

TL;DR: I 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 May 12, 2022, that means Acc!!, Appleseed, BitCycle, Exceptionally, 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: Exceptionally, 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 you solve Tiny Lisp, tiny interpreter in Acc!!, you're getting at least 1000. =P)

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) by [username](code golf user profile)


# 50-100 rep for posting a good fastest-code challenge

I like fast code. I even made a golflang that specializes in fast code. However, in my opinion, there are way too few challenges. We need more! Now that I have a bit more rep to wield, I decided to make this bounty. The challenge needs to be:

• Not restricted to any one language(s)
• Have the tag
• Have at least one scoring criterion that relates to execution time, so no scoring by time complexity
• Relatively interesting, in my opinion
• A challenge where I/O is not the main bottleneck for most of the answers
• Posted after May 11, 2022

I will award between 50 and 100 rep depending on how interesting I think it is. I will postpone awarding the bounty if it will cause me to go below a privilege level or when I am within 100 rep of the next privilege level. If I seem to have missed a challenge, please notify me in the comments.

## Awarded

Aiden4 for Generate Fibonacci Primes Quickly (awarded)

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

• What if one of the conjectures is proved by an outside source? Also just because a conjecture is no longer unproven does not mean that the answer is invalid. I only require answers to be reliant on conjectures unproven at the time of posting. If a proof arises later it is still a valid solution.
– Wheat Wizard Mod
Feb 23, 2017 at 22:34
• @WheatWizard This bounty relates to the TC proof, not the conjecture proof. They still have to prove stuff themselves. Feb 23, 2017 at 22:50
• @MartinEnder Oh! My apologies. This bounty is here for if any of those conjectures are proved, and if the answerer uses said proof to prove the TCness of their answer. Feb 23, 2017 at 23:16
• Hm, in that case, why favour proofs over disproofs? They will likely be equally impressive, no? Feb 23, 2017 at 23:17
• @MartinEnder Because they would then be unable to prove TCness. If they prove TCness without the conjecture, their answer is invalid anyway. Feb 23, 2017 at 23:19
• @VoteToClose I mean why is it more impressive to prove that the answer is TC (based on the conjecture) than proving that it isn't TC (because the conjecture turns out to be false)? Feb 23, 2017 at 23:20
• @MartinEnder Oh, I see your point. I still believe it to be more impressive as the answerer has to write a program to prove TC as well as apply what will likely be an incredibly difficult proof to their programming language. If you strongly suggest it, I wouldn't mind changing the scope of my bounty. Feb 23, 2017 at 23:23
• @VoteToClose honestly, I don't even know standard techniques for proving non-TC-ness of languages that have access to unlimited memory and non-trivial control flow. Feb 23, 2017 at 23:25
• @MartinEnder That's an excellent point I hadn't considered. Altering conditions. Feb 23, 2017 at 23:31
• @MartinEnder stimulate it with a non TC language (there are some very powerful non TC languages out there) Jun 18, 2017 at 23:08

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

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

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

• For an answer in machine language, I need some way to know the type (or actually just the size) of the arguments. May I assume all arguments are of some constant size or may I get a list of argument sizes as extra argument? Sep 21, 2019 at 1:03
• Hi, is this bounty still going? I've posted a Haskell answer to that question.
– user
Sep 13, 2020 at 0:01

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

• @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) Jan 17, 2019 at 14:42
• @PeterTaylor: TIO.run and esolangs.org are up-to-date now. Jan 17, 2019 at 15:34
• @PeterTaylor: What problems? If you have ghc installed an need help, let me know. Jan 19, 2019 at 12:40
• @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. Jan 19, 2019 at 14:42
• 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. Jan 19, 2019 at 23:46
• @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. Jan 19, 2019 at 23:56
• @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. Jan 20, 2019 at 0:33
• It is kind of interesting to see how Haskell is changing :) Btw. I can't see your changes to the esolangs entry. Jan 20, 2019 at 0:39
• Took me a while, but I finally got it debugged and golfed. Feb 7, 2019 at 16:14

# 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).
• 256 bytes? Wow, that thing would probably win Bignum Bakeoff when it was made earlier. Apr 30, 2019 at 0:15

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. # 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.) • 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. – user Mar 29, 2021 at 19:47 • Is the number of matches a valid output form, or must the output be the length of the first match? Sep 14, 2021 at 2:34 • @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?\$). Sep 17, 2021 at 2:31
• Yeah, I figured that probably wasn't what you were looking for, but I thought I'd at least check. Sep 17, 2021 at 4:32

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

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

# 1000 rep to an answer to this challenge in makina

Pretty self-explanatory. If you manage to post a functional answer to that challenge in makina, I'll give you 1k rep. I'm pretty sure this is impossible, but would loved to be proved wrong!

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

## More unsuitable language bounties: 2 x 500

Similar in spirit to lirtosiast's bounties

• I'll add another 500 to the HexaRegex.
– Maya
Apr 7, 2018 at 14:00

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

• 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. Feb 1, 2018 at 22:19

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

• I don't understand: in what situation would you only be giving 200 rep? Dec 1, 2021 at 14:02

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

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

• If this ever gets claimed, the answer's going to be a strong candidate for yearly Best Of. Apr 20, 2021 at 3:54

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

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

• Done! Jun 18, 2021 at 17:04

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

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

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

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

• I upped the challenge :)
– user9207
Jul 14, 2018 at 6:54
• 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. Sep 2, 2018 at 10:12

# 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.
• 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? Nov 29, 2018 at 1:01
• @Dennis To the shortest overall. Nov 29, 2018 at 1:03

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

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

# 100 rep for interpreting a TC language in Tarfish

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

Some ideas:

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

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

• 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. Apr 28, 2017 at 15:56
• Finally, if these bounties are going to be awarded at a specific moment, they're not really bounties with no deadlines. Apr 28, 2017 at 15:57