Vitalik: Circle STARKs will not bring too much additional complexity to developers
ChainCatcher news, Vitalik Buterin published a new article titled "Exploring circle STARKs," which points out that Starkware can prove 620,000 Poseidon2 hashes per second on an M3 chip laptop. This means that if we are willing to trust Poseidon2 as a hash function, one of the most challenging parts of creating an efficient ZK-EVM has actually been solved.It states that compared to conventional STARKs, circle STARK does not introduce too much additional complexity for developers. The mathematical principles behind the "polynomials" operated by circle FRI are quite counterintuitive and take some time to understand and grasp. However, this complexity is precisely hidden, and developers remain unaware of it. The complexity of Circle's mathematical principles is encapsulated rather than systemic.Vitalik believes that by combining Mersenne31, BabyBear, and binary field technologies like Binius, we are approaching the efficiency limits of STARKs' "base layer"; it is expected that the frontier of STARK optimization will shift towards the most efficient arithmetic of primitives such as hash functions and signatures (and optimizing these primitives themselves for this purpose), creating recursive structures for more parallelization, arithmetic for virtual machines to improve developer experience, and other higher-level tasks.