Oct 11, 2019
We present Supersonic which is the first practical SNARK with logarithmic proof size and verifier time that is transparent, i.e. does not require a trusted setup. Supersonic builds on top of the recently proposed Sonic but uses a novel polynomial commitment scheme (DARK) that is transparent. It is build using groups of unknown order and supersonic proofs are around ~10KB and take less than 100ms to verify
Next generation programming platform for decentralized applications.
Professional recording and live streaming, delivered globally.
Presentations on similar topic, category or speaker