Recursive STARKs: in addition to proving the correctness of transaction execution, we also can prove (off-chain), the correct execution of a STARK verifier that verified the proof. The on-chain verifier running time is now shorter by orders of magnitude. h/t @OhadBarta Tweet added by Liron Hayman ✨ @HaymanLiron

Liron Hayman ✨

2 years

Recursive STARKs: in addition to proving the correctness of transaction execution, we also can prove (off-chain), the correct execution of a STARK verifier that verified the proof. The on-chain verifier running time is now shorter by orders of magnitude. h/t @OhadBarta

3

20

106

TS | Arcadia.Finance | //A

@ThmsSmts

2 years

@HaymanLiron @OhadBarta I was just catching up with how "normal" STARKs work, impossible to stay up to date 😅

0

Ben 0x0A

@apeinomics

2 years

@HaymanLiron @OhadBarta What is the theoretical limit on this recursion? If I just verify the verification of the verification of the verification of... my log(log(log...n)) becomes effectively O(1). You must be losing something there / seems to contradict uncompressability?

1

0

2

Replies