Ref Node Live| VIEW RUST CORE ON GITHUB →
INTRODUCTION
CHAIN
RESOURCES
INNOVATION
CONNECT
Getting Started

Three Paths

There is no signup form. No identity verification. No permission to request. The protocol is a set of mathematical operations — you participate by running them. The three paths below are the three ways to do that. Each one begins from the same keypair.

01 · Path I

For Individuals

Hold a key. Verify a balance. Send a payment.

01Generate a keypair — 12/24 seed phrase produces your ML-DSA signing key
02Derive an address — the address is a hash of your public key
03Receive funds — share the address with whoever is sending
04Spend funds — sign a FlashTransaction with your key and broadcast it

There is no account creation, no KYC, no permission. The key is the account.

addr = H(pk), own(balance) ⟺ hold(sk)
02 · Path II

For Miners

Search a nonce. Produce a block. Earn CSM.

01Run a full node — validates every block, exposes RPC
02Point a miner at the node — searches for a nonce that beats the PoW target
03Submit the block — if valid, the node broadcasts it to the network
04Earn the reward — 0.08318123 CSM at genesis, halving every 4 years

No pool required. No GPU or ASIC required. Only a CPU and 16 MB of RAM per mining thread.

pow(n) = Poseidon2(MemLoop(BLAKE3Chain(pre_pow ‖ t ‖ n))) ≤ target
03 · Path III

For Developers

Call four primitives. Verify every response.

01Submit a signed transaction — binary result: accept or reject
02Query state at a block — returns value plus SMT proof
03Verify the proof — cryptographic check against state root
04Check finality — cumulative weight exceeds threshold

The RPC surface is the protocol surface. There is no elevated API, no privileged endpoint.

query(B, k) → (v, π), Verify(π, root) → {⊤, ⊥}
04 · Golden Rules

Three Invariants

I

The key is the account

There is no recovery service. No admin override. No court order a node will honor. If the key is lost, the balance is lost. This is not a UX flaw — it is the property that makes the system sovereign.

∀ A ≠ holder(sk) : Pr[A spends balance] = 0
II

The source is the ground truth

Any claim made in a whitepaper, a website, or a chat is subject to verification against the code. When the two disagree, the code is correct and the claim is outdated.

authoritative = source > spec > whitepaper
III

Verify, do not trust

Every RPC response includes a proof. Every proof can be checked. Every check runs in milliseconds. A user who verifies a proof is not trusting any operator — they are trusting mathematics they can run themselves.

Verify(π, root) = ⊤ ⟹ response is authentic
Getting started is not a matter of trust. It is a matter of understanding three paths and choosing one. The keys are yours. The balance is yours. The verification is yours.
— Sahyadri