The VDF Alliance is looking for a team to design and implement a concretely-efficient post-quantum prover system for certain Sloth-like delay statements. Such a prover system would yield a concretely-efficient post-quantum VDF which may be used by L1 projects such as Cosmos, Ethereum, Filecoin, Tezos as well as L2 applications. Delay function The delay function is the following Python delay function. p = 3*2**124 + 3*2**96 + 2**64 + 1 def cube_root(n): return pow(n, (2*p - 1)//3, p)
2/8/2021[x] (page 1) "zk-SNARKs" => "zkSNARK" (the reasoning is that the long-form "zero knowledge SNARK" doe not have a dash, and that similarly prefixed terms such as "zkRollup" and "zkVM" do not usually have a dash) [x] (page 1) "both private and public" => "private or public" [x] (page 1) "a polynomial f ∈ F[x]" => "a polynomial f ∈ F[X]" [x] (page 1) "of degree d" => "of degree at most d" [x] (page 1) consider adding an index after the abstract (the paper is long with many sections) [x] (page 2) "o(d log F)" => "o(d log |F|)" [ ] (page 2) " including DARK, FRI, and Dory" => consider adding a footnote explaining the slight abuse of notation for FRI which is natively a low-degree test [x] (page 2) "or equivalently Algebraic Holographic Proofs" => "or a equivalently Algebraic Holographic Proof" [x] (page 2) "or no trusted setup [BFS20]" => may be worth adding references for Dory and FRI [x] (page 2) "where the operators of the blockchain only need to store the latest proof that attests to the entire correct history of all transactions" => This sweeps under the rug important details such as data availability and the type of "operator" involved. A more restricted (and technically correct) statement could be "where the latest proof attests to the validity of state transitions in the blockchain history".
1/4/2021