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
  1. Network Architecture

Nodes

The Arithmic Network has multiple types of nodes:

  • Archival node: The state of the users in Arithmic is stored as a Merkle Patricia Trie. The archival node stores the state of the users from the network’s genesis. They also store all the transactions executed at L2 from the genesis.

  • Sequencer: These nodes take part in the stake-based consensus to agree upon the next set of transactions to be executed, and together, update the state of users in the network. In particular, they select and execute the next block of smart contracts/transactions.

  • Validators: They aid the consensus process by validating the updated state produced by the next block of transactions selected by the sequencer nodes.

  • Prover Nodes: The Arithmic Network has three types of provers: a) a base prover that aggregates smart contract executions executed at L2, b) a recursive prover that aggregates proofs computed by the base provers, and other recursive provers, and c) a crest prover that aggregates the proof computed by a recursive prover, and calls the verifier at L1.

PreviousNetwork ArchitectureNextClient and Explorer

Last updated 1 year ago