According to Odaily Planet Daily, Ethereum co-founder recently published an article titled "Binius: Efficient Proof of Binary Fields". The article points out that SNARK relies on "arithmeticization", a method of converting the statements of a program into equations involving polynomials (sometimes vectors and matrices). In order to keep the numbers within a reasonable size, "arithmetic" must be done on a structure called a "finite field". In actual programs, most numbers are very small, and if the field is large, the "extra" values ​​generated during the proof calculation will be much larger, which is a key source of inefficiency. Plonky2 and similar protocols have improved efficiency by reducing the field size from 256 bits to 64 or 31 bits. But it is more efficient to use binary fields directly. The binary field is a mathematical structure with many unique properties, and the tower structure is a fascinating way of production, which adds more advantages.