b1ef2682d6
* implement arbitrary precision modular exponentiation (prerequisite EIP-198) * [modexp] implement exponentiation modulo 2ᵏ * add inversion (mod 2ᵏ) * [modexp] High-level wrapper for powmod with odd modulus * [modexp] faster exponentiation (mod 2ᵏ) for even case and Euler's totient function odd case * [modexp] implement general fast modular exponentiation * Fix modular reduction with 64-bit modulus + fuzz powmod vs GMP * add benchmark * add EIP-198 support * fixups following self review * fix test paths |
||
---|---|---|
.. | ||
README.md | ||
fft_fr.nim | ||
fft_g1.nim | ||
fft_lut.nim | ||
kzg_single_proofs.nim | ||
polynomials.nim | ||
strided_views.nim |
README.md
KZG Polynomial Commitment research
Research for Ethereum 2.0 phase 1 to implement the Data Availability Sampling protocol
See
- https://dankradfeist.de/ethereum/2020/06/16/kate-polynomial-commitments.html
- https://github.com/protolambda/go-kate
- FK20: https://github.com/khovratovich/Kate/blob/master/Kate_amortized.pdf
- https://github.com/ethereum/research/tree/master/polynomial_reconstruction
- https://github.com/ethereum/research/tree/master/kzg_data_availability