"By reducing the bit width of computation fields, particularly through the use of binary fields, advances like Binius have achieved impressive speed improvements in Zero-Knowledge proofs."
"The implementation of Binius leverages Binary Fields constructed from towers of field extensions, starting with the simple ${ ext{F}}_{2}$, which uses minimal element representations."
"With a significant reduction in bit width, the Plonky2 has been shown to outperform earlier versions by hundreds of times, showcasing the efficiency gains possible through this approach."
Collection
[
|
...
]