search

snarkify / sirius

A Plonkish folding framework for Incrementally Verifiable Computation (IVC).
MIT License
121 stars 17 forks source link

feat(nifs): parallel `tree_reduce` in `protogalxy::poly` #324

Open cyphersnake opened 3 months ago

cyphersnake commented 3 months ago

We use itertools::tree_reduce to optimize, as described in the protogalaxy paper, the counting of F & G

This algorithm can be paralleled , and we can do so in a generalized way

cyphersnake commented 3 months ago

And we can make the `try_tree_reduce' method to stop after the first error occurs