We are excited to announce SHARP v6.0 upgrade! 💅
This major upgrade introduces several powerful features:
1⃣ Applicative Recursion:
This feature allows decoupling L2 block frequency from L1 costs.
Public Starknet will use this in the v0.13.2 upgrade to significantly reduce block times without additional L1 costs. This will result in a 7X reduction in confirmation times from ~15 seconds to approximately 2 seconds 🤯. To better understand what applicative recursion is and how it works, read
@VolokhIlia's excellent post👇:
community.starknet.io/t/upco…
2⃣ Rust Implementation:
As part of our efforts to Rustify 🦀 our stack, we have reimplemented the validation and processing of incoming jobs in Rust. This results in up to 9X improvement in run time, reducing validation times for a block with 2^26 cairo steps from ~45 minutes to under 5 minutes. Consequently, this will substantially shorten proving times, potentially reducing L1 settlement times. Many thanks to Moonsong-Labs for allowing the execution of the cairo-bootloader in Rust!
github.com/Moonsong-Labs/cai…
3⃣ New arithmetic circuit builtin:
This upgrade introduces new builtins that allow performing arithmetic operations with respect to any 384 bit modulus. With these arithmetic circuits we can perform cryptographic operations that were previously cost-prohibitive and are now possible thanks to up to 10X efficiency improvement. This unlock enables applications to use cryptographic schemes such as scalar multiplication on various curves and BLS pairing verification. Check out the Garaga project that leverages this new builtin to enable efficient pairing and Groth16 verification.
github.com/keep-starknet-str…
This summer is all about optimizing the Starknet stack! 🫡