We describe SVMZK, - an efficient NIZK proof toolkit.
Given commitments [a], [b], [c], the prover is able to convince the verifier of various relations, such as addition, subtraction, multiplication, division, or comparisons between them.
In order to solve the possibility of sequencers rearranging transactions within L2 blocks. we introduce SVMZK to facilitate the efficient submission of concise results to Bitcoin.
With the subtraction and comparison algorithms in SVMZK, the legitimacy of packed transactions in L2 blocks can be verified by comparing the number of transactions in the sequencer and validator mempools and utilizing the features of SVMZK can also prevent collusion between the prover and verifier.
As a crucial component of the entire framework, we are open-sourcing the algorithmic implementation details of SVMZK this time. However, the integration of SVMZK with Bitcoin Taproot is still under development, and the code for this part will be open-sourced at some point in the future.
Github below👇🏼
Last 12 hours have been chaotic on many ends which has prompted SatoshiVM team to host an AMA to address all questions at 1:00 PM UTC time today
Our aim since inception has to build regardless of all the drama that has surrounded which is only pulling us down.
It’s on us to get over everything and provide our community utmost assurance of what we’re doing. Thus, as promised, we will open source our implementation of SVMZK algorithms today as well.