The main contribution of BitVMX is the simplification and enhancement of the dispute resolution process. Unlike BitVM1, BitVMX does not require the creation of Merkle trees for CPU instructions or memory words, nor does it rely on signature equivocations. These design choices significantly reduce the complexity associated with BitVM1 and make BitVMX a compelling alternative, particularly in scenarios where minimizing transaction costs and round complexity is crucial. The system is highly flexible, allowing for a balance between transaction cost, round complexity, prover cost, verifier cost, and precomputations, tailored to the specific needs of the application.
The latest improvements have halved the number of rounds required for verification, reducing the worst-case scenario to approximately 19 rounds (38 transactions) and consuming around 400K weight units (WU) in total.
The most important part of the article.
reply