- It aims to achieve substantial performance improvements over conventional proof systems.
- Binius can handle underlying data more efficiently by working on bits directly as per Buterin.
Vitalik Buterin, co-founder of Ethereum, has discussed at a new cryptographic proof method that would make zero-knowledge proofs more efficient.
A method for fast cryptographic proofs over binary fields, “Binius,” was detailed in a blog post by Buterin on April 29. The system aspires to achieve substantial performance improvements over conventional proof systems like zk-SNARKs.
Increasing Substantial Efficiency
By reducing calculations to operations on single binary bits (the set of all possible values for a number) rather than on bigger numbers, Binius hopes to gain more efficiency. Classical cryptographic proof methods, such as SNARKs and STARKs, which deal with bigger integers (64-bit or 256-bit), inspired the approach.
Binius can handle underlying data more efficiently by working on bits directly, according to Buterin. This data generally comprises tiny values like boolean flags, indexes, and counters. Buterin claims that the new proof system has many advantages, such as the ability to efficiently perform arithmetic operations on bits and bit sequences and the ability to represent data as a multidimensional “hypercube” of bits.
While preserving the performance advantages of working in binary, it uses a sophisticated encoding and decoding technique to transform the bit-level data into a format that is suited for “polynomial” processing and Merke proofs.
An increase in the efficiency and scalability of complicated cryptographic applications is made possible by the binary system, which unlocks substantial enhancements to the fundamental mathematics of cryptographic proof systems. To illustrate how the Binius protocol encapsulates data, creates proofs, and enables verifiers to effectively examine those proofs, Buterin demonstrated complex mathematics.
Highlighted Crypto News Today:
