New crypto research! Naysayer proofs can be extremely efficient, requiring proof verification to be executed onchain only when there's an error. A really simple, obvious-in-retrospect design. Brilliant work from @Istvan_A_Seres @cryptonoemi (former interns) and @josephbonneau from our research lab.
New crypto research! Naysayer proofs can be extremely efficient, requiring proof verification to be executed onchain only when there's an error. A really simple, obvious-in-retrospect design. Brilliant work from @Istvan_A_Seres @cryptonoemi (former interns) and @josephbonneau from our research lab.
@eddylazzarin @cdixon @Istvan_A_Seres @cryptonoemi @josephbonneau So kind of like optimistic roll-ups except each verifiable via zk-snarks ?