kayabaNerve / full-chain-membership-proofs

18 stars 1 forks source link

Investigate in-circuit challenges not reliant on additional vector commitments #49

Open kayabaNerve opened 1 year ago

kayabaNerve commented 1 year ago

If this is feasible, it'd save a couple hundred bytes (unless we look at a single VC for all VCs, which would convert a O(n) communication cost to O(1), yet that'd break flows reliant on successive challenges...).