mirror of https://github.com/arnaucube/plonky2-recursion-experiment.git synced 2026-01-20 21:01:34 +01:00

Go to file

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

src

add full recursion (binary) tree

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

.gitignore

add full recursion (binary) tree

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

Cargo.toml

add full recursion (binary) tree

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

README.md

add full recursion (binary) tree

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

README.md

plonky2-recursion-experiment

WARNING: Experimental. Not safe, do not use in production.

Run

rustup override set nightly # Requires nightly Rust
cargo test --release -- --nocapture