Arithmic Documentation
  • Introduction
  • Gen 1.0 - Gen 2.0 VMs and Staking
    • Gen 1.0 VM and its Limitations
    • Gen 2.0 VM Paradigm
    • Recursion in Gen 1.0 and Gen 2.0 VMs
    • Staking & LSTs
    • Restaking & LRTs
  • Arithmic Gen 2.0 zkVM Soma: The future of zkEVMs
    • Soma System Design
    • Hardware Acceleration
    • Performance
    • Outperforming the Competition
  • Network Architecture
    • Nodes
    • Client and Explorer
    • Data Availability
    • Decentralized Sequencing
    • Computation & Decentralized Infrastructure
  • Arithmic Network's Staking Model
    • Problem of Fractured Incentives
    • Aligning Network Incentives
  • Arithmic’s Multichain Staking Pools (MSP)
    • How does an Arithmic MSP work?
      • Stable Hyper-Staked Token (sHST)
      • Equity Hyper-Staked Token (eHST)
      • MSP Example
    • Types of Staking Pools
  • Arithmic Rewards System
    • Earning Arithmic Points
    • Participating in Arithmic MSPs
  • Arithmic Network's Roadmap
  • Our Vision
Powered by GitBook
On this page

Gen 1.0 - Gen 2.0 VMs and Staking

Blockchain rollups are scaling solutions that move expensive computation off-chain to Layer-2 (L2) chains. Validity roll-ups use succinct arguments of knowledge (SNARKs) to compute proofs and relocate expensive computations to L2. Consequently, the network participants only need to verify succinct proofs at Layer-1 (L1) attesting to the correctness of the off-chain computation. This approach allows verifying the L2 state, resulting from several batched transactions, as part of one transaction verified on the main chain. Validity roll-ups reduce the transaction fees for the end users, as the gas cost to run the verifier and batch transactions at L2 is significantly lower compared to the gas cost required to execute them naively at L1.

While validity roll-ups pose a remarkably viable solution to scale a decentralised network like Ethereum, it is severely bottlenecked by the proving overheads for non-algebraic computations such as Keccak hashes. It is estimated that, at present, the overhead to compute proofs for such non-algebraic hashes is at least 20,000 times higher. Most computations in real-world applications are non-algebraic, and converting them into algebraic operations inside a proof system brings considerable additional overheads. Consequently, the throughput rate of most current validity roll-ups is far less than what was initially expected.

PreviousIntroductionNextGen 1.0 VM and its Limitations

Last updated 1 year ago