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

Blockchain technology introduces a large vocabulary of technical terms. This glossary defines every term used across the Sahyadri protocol, the whitepaper, and the documentation — with the specific meaning it carries in this network.

Where a term has both a general meaning and a Sahyadri-specific meaning, the Sahyadri-specific meaning is given first. Terms are grouped by category rather than alphabetized so that related concepts appear together.

Core Concepts

Blockchain
A distributed digital ledger that records transactions across many computers in a secure and verifiable manner. Sahyadri uses a DAG-based ledger rather than a linear chain.
Block
A collection of verified transactions bundled together with a reference to its parents in the DAG. In Sahyadri, a block references multiple parents rather than exactly one.
Transaction
A signed intent to transfer value or state. In Sahyadri, a transaction is a FlashTransaction — a nonce-less format carrying a sender pubkey, recipient, amount, fee, expiry, salt, and signature.
Wallet
A tool for storing, sending, and receiving CSM. A wallet manages keypairs (ML-DSA / Dilithium) and signs transactions. The private key never leaves the device.
Decentralization
A measurable property — the number of independent parties required to collude to control the network. Quantified by the Nakamoto coefficient.
Node
A computer running the Sahyadri protocol. A node validates every block against the state transition function and relays new blocks to peers.
Full Node
A node that stores the full chain state and validates every block independently. A full node trusts no peer — it re-runs the transition function on every block.
Genesis Block
The first block of the Sahyadri chain. Its state is hardcoded in the protocol; every subsequent block is reached by applying the transition function to genesis.
Mempool
A per-node queue of transactions that have passed local validation but have not yet been included in a block. The mempool is not shared across nodes — each node keeps its own view.
Miner
A participant who searches for a nonce that satisfies the PoW target, producing a candidate block. Miners are rewarded for producing valid blocks; they do not vote on anything.
Mining Pool
A group of miners who combine hash power and share rewards proportionally. Pools are not part of the protocol — they are a social coordination layer on top of it.
Parallel Block
Multiple valid blocks produced in the same time window. SahyadriDAG accepts all parallel blocks; there is no orphan race.
Private Key
A secret cryptographic key that controls a balance. In Sahyadri, a private key is an ML-DSA (Dilithium) signing key. Only the holder can authorize a transaction.
Public Key
The public half of a keypair. A user’s on-chain balance is controlled by their public key; the address is a hash of the public key.
Transparency
The property that every transaction, block, and state change is publicly verifiable. A network is transparent when no trust in an operator is required to verify its state.

Sahyadri Protocol

Sahyadri
The protocol itself — a sovereign Layer-1 with post-quantum signatures, deterministic ordering, and a fixed 21M supply. Capital "S" refers to the network; lowercase "sahyadri" refers to units of the native currency.
CSM
The native currency of Sahyadri. Supply is capped at exactly 21,000,000 by the emission function. CSM pays fees, rewards miners, and is the unit of account for value transfers.
Kana
The smallest unit of CSM. 1 CSM = 100,000,000 kana (10⁸). Named to avoid confusion with the satoshi unit of Bitcoin.
SahyadriDAG
The ledger structure. A directed acyclic graph where each block references multiple parents. Valid blocks are never discarded — parallel work is preserved as a structural property.
Ashwa Consensus
The ordering layer. Converts SahyadriDAG’s partial order into a canonical total order by ranking blocks with cumulative work and breaking ties with hash order. Every honest node computes the same result — deterministically.
SahyadriX
The Proof-of-Work hash function. A memory-hard construction: BLAKE3 fills a 16 MB buffer, a data-dependent mixing loop folds the buffer into a state, and a Poseidon2 permutation compresses that state into the difficulty-checked output.
FlashTransaction
The native transaction format. Nonce-less — replay protection is provided by a 16-byte random salt and an expiry field. Encoded with the magic prefix "FLASH_V1" followed by structured fields.
Account + Crest Model
The dual state model. The Account layer handles monetary balances (atomic debits and credits); the Crest layer handles structured objects like DIDs and credentials. Both layers commit to the same Merkle root.
Sync-Wave
The state synchronization mechanism. A new node syncs to a checkpoint using a compact proof rather than replaying every historical block, then extends the chain from that checkpoint.
State-proof
A cryptographic proof that a particular value exists in the current state. A state-proof consists of a Merkle path against the SMT root plus, optionally, a recursive proof that the root is authentic.
Light Client
A client that verifies the state of the chain using state-proofs and recursive proofs, without storing the full chain. A light client trusts no node — it re-verifies every proof it receives.
Address
A cryptographic identifier derived from a public key. The address is what users share to receive payments; the balance is controlled by the public key that the address hashes.
Bech32m
An address encoding with a strong checksum, used by Sahyadri with the "csm1q" prefix. Bech32m detects single-character typos and makes addresses human-readable.

Cryptography

SHA3-256
A cryptographic hash function used for block header hashing and content hashing (transaction IDs, object identifiers). 256-bit output, collision-resistant.
BLAKE3
A fast cryptographic hash function used inside SahyadriX’s memory-hard loop. Roughly 3–5x faster than SHA3-256, with ~128-bit preimage resistance under Grover’s algorithm — matching SHA3-256’s quantum profile.
Poseidon2
A cryptographic permutation over the Goldilocks field, used for SMT hashing. Chosen because its algebraic structure makes Merkle proofs verifiable inside a recursive proof system at low constraint cost (~300 constraints per permutation).
Poseidon2b
Poseidon2 over binary fields. Used in Sahyadri’s recursive proof layer for binary-field commitments. Same design as Poseidon2 but operating over binary extension fields.
Goldilocks Field
The prime field of order 2^64 − 2^32 + 1. Used as the base field for Poseidon2 in the SMT. Chosen for efficient 64-bit arithmetic and compatibility with the recursive proof layer.
Binary Field
A field of order 2^k, used in the recursive proof layer (Poseidon2b, STARKs). Binary fields allow compact commitments and efficient FRI-based proof systems.
ML-DSA / Dilithium
The post-quantum signature scheme used on Sahyadri (NIST-standardized). Rests on the hardness of Module-Learning-With-Errors (MLWE), believed secure against classical and quantum adversaries. Every transaction is signed with this scheme from genesis.
MLWE
Module-Learning-With-Errors — the cryptographic assumption underlying Dilithium. Recovering a private key from a public key requires solving MLWE, which no known algorithm (classical or quantum) solves in polynomial time.
Sparse Merkle Tree (SMT)
A 256-level Merkle tree with a fixed structure, used to commit to the full state (accounts + crest objects). A single 32-byte root determines the entire state, and any leaf can be proven with a 256-hash path.

Proofs & Recursion

STARK
Scalable Transparent ARgument of Knowledge — a cryptographic proof primitive. Transparent (no trusted setup), post-quantum-secure, and recursively composable. Sahyadri uses STARKs to prove state transitions, signatures, and chain continuity.
Plonky3
The proof-system framework Sahyadri is built on. Provides the AIR abstraction, FRI-based commitment, and recursion primitives used to compose per-block proofs into a single chain proof.
Recursive Proof
A proof that verifies the validity of another proof. Sahyadri’s chain proofs are recursive: each proof verifies the proof of the previous block, allowing O(1) verification of an unbounded chain (proof size O(log N) in chain length).
Chain Proof
The composition of per-block proofs into a single proof of the entire chain. Each chain proof attests to the validity of every block before it, recursively.
AIR
Algebraic Intermediate Representation — the format in which computation is expressed to a STARK prover. Each Sahyadri proof circuit is defined as an AIR with transition constraints and boundary constraints.

Consensus & Security

Finality
The property that a block can no longer be reversed. In Sahyadri, finality is a threshold: once a block’s cumulative weight exceeds what any plausible adversary could produce, reversal is mathematically impossible.
Cumulative Weight
The sum of the difficulty of every block in a block’s ancestor set, defined recursively over the DAG. Higher cumulative weight = deeper finality.
Nakamoto Coefficient
A decentralization metric: the minimum number of colluding miners who together exceed 50% of the network’s hash power. A higher coefficient means a more decentralized network.
Reorg (Reorganization)
A rewrite of recent history. Probability of a reorg at depth k decays geometrically with k, so deeper blocks are economically and mathematically irreversible.
Orphan Block
A concept from linear chains: a valid block discarded because a competing block won a race. SahyadriDAG eliminates orphans by construction — parallel blocks are all preserved and ordered.
DAA (Difficulty Adjustment Algorithm)
The algorithm that adjusts the PoW target to maintain the protocol’s target block interval. Uses a moving window of observed block times to keep the network stable as hash power changes.

Economics

Halving
A scheduled reduction in the block reward, occurring every 4 years. The emission function is a geometric series whose sum converges to exactly 21,000,000 CSM.
Emission Function
The protocol-defined rule that determines the block reward at every height. Reward halves every H blocks, so cumulative supply approaches 21M asymptotically but never exceeds it.
Fee
A small fixed fee paid per transaction. Fees prevent spam and compensate miners, but are not subject to an auction — there is no priority fee market in the base protocol.