Ethereum Foundation logo
  • home
  • blog
  • research
  • bounties
  • team
  • events

RSA Bounties

For more explanation on the assumptions, please see RSA assumptions.

To improve the cryptanalysis of new RSA assumptions needed for Verifiable Delay Functions (VDFs), the Ethereum Foundation announced the following bounties at Real World Crypto 2020:



A bounty of $10,000 will be given for:

  • An algorithm that solves the Adaptive Root Problem in an RSA group asymptotically faster than the fastest known algorithm for factoring an RSA number.1
  • Reducing the Adaptive Root Assumption to one of these assumptions: Strong RSA Assumption, RSA Assumption, Diffie-Hellman Assumption, or proving the Adaptive Root Assumption is (non-)equivalent to Factoring in the Generic Ring Model.


For more details on the assumptions, see here: RSA Assumptions.

Bounties for lower bounds on modular squaring

The RSA VDF depends critically on the sequentiality of modular squaring. To this end the paper by Williams and Wesolowski explored lower bounds in modular squaring, and announced the following bounties for improving them (please refer to the paper for details and definitions):


  • Prove that for all n128n \geq 128, SUM on nn-bit inputs requires depth at least clog2(n)c \log_2(n) for some c>2c > 2. (That is, improve upon Krapchenko's lower bound for SUM)


  • Prove that for all n128n \geq 128, SUM on nn-bit inputs requires depth at least 4log2(n)4 \log_2(n). (That is, prove the "reasonable hypothesis" stated immediately after Theorem 2 of the paper. This $5,000\$5,000 bounty is in addition to the $5,000\$5,000 bounty above.)


  • Prove that there is a c<4c < 4 such that for all n128n \geq 128, SUM has circuits of depth at most clog2(n)c \log_2(n). (That is, refute the "reasonable hypothesis", and do so for all large enough input lengths nn.)


  • Improve the average-case depth lower bound Theorem 3 from the paper to clog2(n)c \log_2(n) for some c>1c > 1, for any algorithm computing MS-MOD2 on at least 51%51\% of the inputs.

Concrete instances

Bounties for solving the RSA adaptive root problem in concrete RSA groups have been instantiated on an Ethereum smart contract:

Modulus (bits)BountyClaimed
7684 ETH
10248 ETH
204816 ETH

For more details, see concrete instance bounties.


  1. At this point in time, the complexity of the General Number Field Sieve is Ln[13,6493]L_n\left[\frac{1}{3}, \sqrt[3]{\frac{64}{9}}\right].

© 2023 Ethereum Foundation. All rights reserved.