75
\$\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 his/her 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\$
  • 5
    \$\begingroup\$ How do you have a bounty without a deadline? \$\endgroup\$ – Beta Decay Jul 5 '15 at 18:11
  • 22
    \$\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
  • 7
    \$\begingroup\$ This would be much more useful if people posted answers as answers rather than editing them into the question. That way when I see that it's changed I could just look at the answers sorted by activity (which is my default sort order on PPCG) rather than having to view the edit history of the question. \$\endgroup\$ – Peter Taylor Jun 30 '16 at 7:34
  • 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
  • 8
    \$\begingroup\$ Bounties that are only present in the meta question, and not posted as separate meta answers, leave no way to contact the bounty poster when time comes to claim the bounty. Please consider posting an answer if you have a bounty offered that doesn't yet have a meta answer. \$\endgroup\$ – trichoplax Oct 24 '16 at 0:49
  • \$\begingroup\$ 100 Rep for a <100 byte answer to this question \$\endgroup\$ – Gryphon Jun 14 '17 at 14:17
  • \$\begingroup\$ @JonathanFrech Fixed. \$\endgroup\$ – ASCII-only Jan 3 '18 at 8:50
  • 2
    \$\begingroup\$ @Gryphon Post the bounty in an answer, not a comment. \$\endgroup\$ – mbomb007 Apr 30 '18 at 21:56
  • 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\$ – Peter Taylor 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\$ – Peter Taylor 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

50 Answers 50

1
2
2
\$\begingroup\$

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.

| |
\$\endgroup\$
  • \$\begingroup\$ 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? \$\endgroup\$ – wastl Sep 21 '19 at 1:03
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\$
  • \$\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\$

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

100+ rep for APL answers/outgolfs to Bubbler's challenges/answers

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, depending on how impressive it is) rep for the following two categories of answers:


A competitive APL answer to one of my 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),
  • 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.

List of challenges to answer (SEDE query)

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

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


An APL answer that outgolfs one of my APL answers in challenges

You can use any of the APL dialects listed on Adám's APL bounties. However, I will not give out bounties for simply porting into a strictly more expressive dialect (e.g. Dyalog Unicode into Extended).

List of my APL answers to outgolf


Bounty Requests

  • Please edit in bounty requests here, with relevant links.
  • Template 1: [Username](link): [Answer](link) to [Challenge title](link)
  • Template 2: [Username](link): [Answer](link) outgolfing [this answer](link) to [Challenge title](link)
| |
\$\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
    \$\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\$

500 reputation

500 reputation by Mego in Seriously, GolfScript, CJam, or Pyth? for finding a solution using pattern matching or something similar (no running the input through the interpreters and checking the result) that correctly identifies all of the test cases in the question.

I already did the trivial solution of running the interpreters. I'd like to see a smarter solution - one that actually decides which language(s) the program runs in without running the interpreters. All test cases must pass correctly - that includes the Silver and Gold tiers.

| |
\$\endgroup\$
1
\$\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\$
  • \$\begingroup\$ I upped the challenge :) \$\endgroup\$ – Anush 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
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\$
  • \$\begingroup\$ Man, I've never tried to use the electronics in Factorio. I will give this a try though \$\endgroup\$ – Jo King 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\$

100 or 200 rep for significantly outgolfing me in BitCycle

I am offering the following bounties for outgolfing any of my answers in BitCycle:

  • Outgolfed by 25% or more: 100 rep
  • Outgolfed by 50% or more: 200 rep

Only one person can win the bounty for a given challenge. I may give more than the listed amount if the golf is especially clever or invents a new approach for golfing in BitCycle.

Edit: I have adjusted the percentages a bit. I also removed the 50-point bounty, since I found out you can't give 50 points on a question that you've already answered.


Previously awarded:

| |
\$\endgroup\$
  • \$\begingroup\$ The listing is old, but do trivial golfs (e.g. "unnecessary ...") count? Also, is this dead by now? \$\endgroup\$ – Erik the Outgolfer Mar 23 '19 at 15:14
  • \$\begingroup\$ Still active, and yes, trivial golfs count. That's why I did the increasing bounty amounts for different percentages. If you're just able to squeeze a few spaces and go from 50 bytes to 45, that's worthy of a small bounty, but going from 50 to 30 by changing the approach is more impressive. \$\endgroup\$ – DLosc Mar 26 '19 at 1:13
  • \$\begingroup\$ Claiming one for 200 \$\endgroup\$ – Jo King Mar 26 '19 at 9:26
  • \$\begingroup\$ 50 rep for odd/even \$\endgroup\$ – Jo King Mar 26 '19 at 12:25
  • \$\begingroup\$ (p.s. Can you post more Bitcycle solutions? The only one that is reasonably golfable is the divmod answer, which I'm going to have a go at later. p.p.s i think you missed the -1 byte for stay away from zero) \$\endgroup\$ – Jo King Mar 28 '19 at 0:26
  • \$\begingroup\$ @JoKing Yes, I'm planning to. I just don't want to be too hasty about it, or I'll end up in the poorhouse! ;) \$\endgroup\$ – DLosc Mar 28 '19 at 2:14
  • \$\begingroup\$ @JoKing Feel free to post some yourself, too. ;D \$\endgroup\$ – DLosc Mar 28 '19 at 2:26
  • \$\begingroup\$ Perhaps add some sort of delay, like "The solution has to be posted at least one week after the last edit to my answer"? As for posting them myself, I quite enjoy the language (2D languages are my jam!), but is there any way to do ASCII output? I feel like this language needs a quine. \$\endgroup\$ – Jo King Mar 28 '19 at 3:39
  • \$\begingroup\$ @JoKing Hm, the one-week wait is an idea. Let's take the language-features discussion to the Esoteric Programming Languages chat room--I've asked for it to be unfrozen. :) \$\endgroup\$ – DLosc Mar 28 '19 at 6:37
1
\$\begingroup\$

Up to 750 rep for Flattening the Cube

So far, at time of writing, the challenge has gone unanswered by anyone except me for 2 and a half years. In addition, I have recently released a new language, Levels, which is based around the idea of cubes. Therefore, I am offering 4 bounties:

  • 50 reputation for posting an answer to the challenge which is shorter than 1258 bytes, in any language except for Jelly, Add++ or Levels
  • 100 reputation for posting an answer to the challenge which is shorter than 150 bytes, written in Jelly
  • 200 reputation for posting an answer to the challenge which is shorter than 1000 bytes, written in Add++
  • 400 reputation for posting an answer to the challenge which uses a cube of size 12 or lower, written in Levels

You can claim any number of these bounties, including all 4. Notify me by posting an answer to the challenge, or by pinging me (@cairdcoinheringaahing) in The Nineteenth Byte to claim any bounty. The bounties are subject to my approval, so trying to game them won't result in you receiving the bounties (e.g. creating a new language, exploiting loopholes etc.).

Good luck!

| |
\$\endgroup\$
  • \$\begingroup\$ If any bounty is claimed "out of order" (e.g. the +400 one first), which would screw up the minimum offered, I will only offer what is stated here for other bounties, and will do so on a different question/answer if need be \$\endgroup\$ – caird coinheringaahing Dec 8 '19 at 17:23
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\$
  • 1
    \$\begingroup\$ Queues, GOTOs, definitely tryable. goes and starts solving \$\endgroup\$ – Matthew Roh Mar 22 '17 at 10:33
  • \$\begingroup\$ @SIGSEGV thanks, good luck. \$\endgroup\$ – Rohan Jhunjhunwala Mar 22 '17 at 20:14
  • \$\begingroup\$ In the GitHub page I see Keyboard Binding, and Graphics. Oh yes, this would be good. \$\endgroup\$ – Matthew Roh 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\$ – Rohan Jhunjhunwala Mar 23 '17 at 19:07
  • \$\begingroup\$ Yup. Thought of that too. \$\endgroup\$ – Matthew Roh Mar 23 '17 at 22:56
0
\$\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\$
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\$
  • \$\begingroup\$ For your C# interactive program, Write("Hello, World!") is shorter than what you have right now, at 22 bytes \$\endgroup\$ – Embodiment of Ignorance Mar 10 '19 at 4:18
  • \$\begingroup\$ oh, true, will change soon \$\endgroup\$ – ASCII-only Mar 10 '19 at 5:24
  • \$\begingroup\$ Can you add l33t? \$\endgroup\$ – MilkyWay90 Apr 26 '19 at 1:04
0
\$\begingroup\$

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

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

| |
\$\endgroup\$
0
\$\begingroup\$

100 rep for an answer to Shortest code to produce non-deterministic output in Tamsin

The Tamsin specification describes no mechanism for non-determinism. However, there is a compiler from Tamsin to C; it might be possible to use a bug in this compiler to generate C code that invokes undefined behavior (this behavior wouldn't manifest on TIO because it uses the interpreter rather than the compiler). I'm not sure whether this is possible, but if somebody demonstrates a solution, I'll award an 100-point bounty.

| |
\$\endgroup\$
0
\$\begingroup\$

400 rep for a GNU sed solution to Fizz Buzz that beats my solution (currently 129 bytes)

Intending to increase participation of golfing in sed, I have posted a sed solution at 129 bytes https://codegolf.stackexchange.com/a/197896/ and anyone who beats it will be awarded 400 rep.

The solution must be on GNU sed 4.2.2 with or without the -r flag (no additional flags are allowed except that which are needed to run), taking only a newline as input (as that is the minimum required to run a sed program). The version being 4.2.2 means that empty labels can be used. The e eval command cannot be used to qualify for the bounty. This version of sed can be tried on https://tio.run/#sed.

If I golf my answer, its latest bytecount has to be beaten to get the bounty.

sed tips Tips for golfing in sed

| |
\$\endgroup\$
  • \$\begingroup\$ What if we golf your answer to win? \$\endgroup\$ – S.S. Anne Feb 13 at 0:55
  • \$\begingroup\$ @S.S.Anne You will still win the bounty \$\endgroup\$ – user41805 Feb 13 at 16:13
0
\$\begingroup\$

1000, 750, and 250 rep for answers to my Totally Cubular Question

Four months ago I received a little reputation jump from the retroactive reputation increase for question upvotes.

Three years ago I posted my last question, and it still has no answers. That may be down to the fact that it's pretty difficult, but I'd like to give it a bump to see if anyone can get it done.

So I'm offering 2000 of the reputation I got from the recent increase in the form of three bounties for answers to this question.

  1. A 750 rep bounty for the first working answer.
  2. A 1000 rep bounty for shortest working answer on the 1st of May.
  3. A 250 rep bounty for what I consider to be the best answer. This is a bit hard to quantify, which is why gets the smallest bounty. An answer in an unlikely language, or an answer with a good explanation of the method the program uses to solve the problem might qualify for this. In the absence of an obvious best answer, I will award this to the highest voted answer.

All bounties will be awarded on the 1st of May (in case one answer qualifies for more than one bounty, so I can combine the amounts when I award them). If there are no answers by the deadline Bounties 2 and 3 will no longer be offered, but bounty 1 will continue indefinitely.

| |
\$\endgroup\$
0
\$\begingroup\$

100 reputation for a naz answer to Is this number a prime?

I've been posting answers written in my language naz since the beginning of the year, but without a working primality test, it still technically doesn't fit our definition of a programming language.

I still take a stab at this problem from time to time, but at this point I'm mostly convinced that due to naz's limitations — namely the register only being able to store integers between -127 and 127 inclusive, and the intrinsic limit of 10 functions and 10 variables that can be defined in a program — writing a working primality test is not possible. Prove me wrong, and I'll award a bounty of 100 reputation.

Edit: Since removing the default integer limits (i.e. through use of the -u flag) might have the potential to trivialize the challenge, I will alternatively award the bounty to a strong proof that the challenge is impossible to solve with them in place.

| |
\$\endgroup\$
  • \$\begingroup\$ Nice language!! \$\endgroup\$ – Λ̸̸ Apr 8 at 6:34
  • \$\begingroup\$ Challenge accepted. Although it seems like I would only be able to get it working for numbers 1 through 128. Out of curiosity, why are there limitations on register values? I'm sure JS doesn't have definitive types. \$\endgroup\$ – Lyxal Apr 8 at 11:53
  • \$\begingroup\$ In short I added that cap because I didn't see much of a use for output values beyond the Basic Latin block. The one side effect, of course, is that it restricts questions like this one; I've been able to subtract up to 127 from a 3-digit number by storing each digit in its own variable, but anything more than that proves to be a bit of a logistical nightmare. \$\endgroup\$ – sporeball Apr 8 at 20:37
  • \$\begingroup\$ Challenge accepted. My idea is to first try and write a factorial program in naz. \$\endgroup\$ – Λ̸̸ Apr 9 at 1:14
  • \$\begingroup\$ I'll need to make a python port of the Node.js interpreter to be able to properly test programs. Is that okay? (I don't have easy access to Node.js) \$\endgroup\$ – Lyxal Apr 9 at 1:21
  • \$\begingroup\$ @Lyxal You don't have to. Ther's a repl.it. \$\endgroup\$ – Λ̸̸ Apr 9 at 1:28
  • \$\begingroup\$ Turns out that I can't even write a triangular number script in naz easily! Maybe, we should make a preprocessor... \$\endgroup\$ – Λ̸̸ Apr 9 at 1:29
  • \$\begingroup\$ @petStorm sure, there's a repl.it, but what if I want to do things offline? \$\endgroup\$ – Lyxal Apr 9 at 1:47
  • \$\begingroup\$ I'm perfectly okay with ports of the original interpreter to other languages. I also made a general-purpose room for naz in chat; it might be better to continue discussion there. \$\endgroup\$ – sporeball Apr 9 at 3:26
  • \$\begingroup\$ -1, isn't this provably impossible because the finite state of naz limits it to the power of a finite-state automaton? \$\endgroup\$ – lirtosiast Apr 16 at 19:08
  • 2
    \$\begingroup\$ @lirtosiast No, it would be definitely possible (at least in the range of 2 to 127) if it's given more slots for functions. e.g. even though you can't subtract register X by register Y directly, you can write a set of functions to do that. The only problem is that you have just 10 slots, and any nontrivial arithmetic will cost you multiple slots. \$\endgroup\$ – Bubbler Apr 20 at 7:21
  • \$\begingroup\$ @Bubbler OK, this seems like a good bounty if it would also be given out upon proof of impossibility. \$\endgroup\$ – lirtosiast Apr 20 at 8:08
  • \$\begingroup\$ I updated the terms. \$\endgroup\$ – sporeball Apr 24 at 5:14
-7
\$\begingroup\$

500 reputation bounty - for cracking this whitespace cop

As computers get faster and faster or other mathematical developements arise (sorry can't entirely give away the premise), this may become crackable. At any such time I will award the mathematical genius 500 reputation points.

| |
\$\endgroup\$
  • 7
    \$\begingroup\$ The "premise" is factoring a large semiprime - this is roughly equivalent to the RSA problem. \$\endgroup\$ – Mego Feb 23 '17 at 14:39
1
2

You must log in to answer this question.

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