arnaucube 55a08ad575 add full recursion (binary) tree ...

Each node of the tree is verifying:
`((verify left sig OR verify left proof) AND (verify right sig OR verify right proof))`.
and then it generates a new plonky2 proof, which can again be verified
in a node of the next level of the tree.

full binary tree of recursion works

2024-10-15 16:51:49 +02:00

19 B

Raw Blame History

View Raw