The post Everything to know about Vitalik Buterin’s Circle STARKS appeared on BitcoinEthereumNews.com.

Ethereum creator Vitalik Buterin is back again with another creation he believes will take blockchain’s security to a whole new level. He calls it Circle STARKS, and I’m here to tell you everything you need to know about it. Small fields changed the game Circle STARKs is all about moving away from big, inefficient numbers to smaller, more manageable fields. Originally, STARKs used large 256-bit fields, but these were slow and wasted a lot of space.  Now, with smaller fields like Goldilocks, Mersenne31, and BabyBear, everything runs faster and more efficiently.  Starkware, for instance, can now handle 620,000 Poseidon2 hashes per second on an M3 laptop. Vitalik’s Circle STARKs, implemented in Starkware’s stwo and Polygon’s plonky3, offer unique solutions using the Mersenne31 field. Related: Vitalik Buterin thinks investors are too excessive One of the main tricks in making hash-based proofs, or any proof, is to prove something about a polynomial by evaluating it at a random point. For example, if a proof system needs you to commit to a polynomial P(x), you might need to show P(z) = 0 for a random point z. This is simpler than proving things directly about P(x). If you know z in advance, you could cheat by making P(x) fit that point. To stop this, z is chosen after the polynomial is provided, often by hashing the polynomial. Related: Vitalik Buterin thinks politicians are playing the crypto industry It works fine with large fields, like in elliptic curve protocols, but small fields pose a problem. With small fields, an attacker could just try all possible values for z, making it much easier to cheat. To solve this, two main methods are used: multiple random checks and extension fields. The first is simple—check the polynomial at several points instead of just one. But this can…

---

Filed under: News - @ July 23, 2024 4:14 pm