- Sin7Y·Created by Spartucus on Sep 25, 2024Linked with GitHub
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Read more
Circle FFT and its implementation
Abstract: This paper primarily examines the work of Ulrich Haböck et al. titled "Circle STARKs," interpreting Circle FFT and its implementation aspects. The analysis focuses on three main areas: 1) the foundation for accelerating basic operations with CFFT; 2) the implementation of CFFT calculations; and 3) the coding implementation of CFFT.
Dec 8, 2024Babylon: An Extremely Appealing Protocol Scaling Bitcoin to Secure PoS Chains
Babylon: an extremely appealing protocol scaling Bitcoin to secure PoS chains
Oct 23, 2024Onis Litepaper of Ola
引言区块链技术的迅速发展催生了一个多链世界，每个区块链网络都在追求其独特的功能和应用场景。然而，这种多样性也带来了显著的挑战，尤其是在链与链之间的互操作性方面。Ola 致力于打破区块链之间的壁垒，推动跨链技术的发展，为去中心化应用 (DApps) 和去中心化金融 (DeFi) 提供更广泛的应用场景。
Aug 29, 2024A basic of Binius: Towers of Binary Fields
In blockchain technology, reducing computational complexity has always been one of its primary goals. One effective approach to achieving this is by reducing the bit width of the computation field. For example, SNARKs based on elliptic curves perform arithmetic operations in fields with bit widths of 256 or higher, while STARKs have evolved from using the 64-bit Goldilocks field to the 31-bit Mersenne31 and BabyBear fields. Beyond the efficiency of the prime numbers themselves during modular operations, the significant reduction in bit width has led to Plonky2 being hundreds of times faster than its predecessor, Plonky. Following this trajectory, one might wonder: is it possible to set the field width to 1, specifically {\mathbb{F}}_{2} The Ulvetanna team addressed this question in their research paper titled Succinct Arguments over Towers of Binary Fields [1], and the IRREDUCIBLE team implemented it in Rust with their project, Binius: a Hardware-Optimized SNARK [2][3].
Aug 29, 2024
HackMD