In the previous post, we went over Fʀᴀᴄᴛᴀʟ at a very high level, describing its features and what kind of subprotocols we would need to make it work. Part II details Fʀᴀᴄᴛᴀʟ’s subprotocols, such as Univariate Sumcheck for rational functions, Holographic Lincheck, Sparse Matrix Arithmetization or the Verifier
Fractal is a new general-purpose zero-knowledge proof system (and no, it doesn’t have anything to do with the fractals you’re probably thinking of). While new advances in SNARKs are being made almost daily, a couple of things make Fractal stand out:
Previously, Part I of this blog post series introduced Supersonic, a new SNARK created by combining a new Polynomial Commitment Scheme with existing Interactive Oracle Proofs. Part II introduces the DARK Integer Commitment Scheme and describes at a high level how DARK can be used as a Homomorphic Polynomial Commitment Scheme, and how DARK may be instantiated in various groups of unknown order.