Three Trade-offs, Zero Trust
The three node modes differ in how much of the chain they store and which proofs they accept. They do not differ in whether they trust peers — none of them do. A full node re-executes every transition. A pruned node verifies every block in its window. A light client verifies every proof it accepts.
Full Node
Pruned Node
Light Client
Miners are not Validators
A validator, in the PoS sense, is a party selected by stake to produce blocks. Sahyadri has no such role. The parties that produce blocks are miners — they produce blocks by finding a valid PoW nonce, not by being selected. There is no validator set, no election, no stake, no slashing.
The condition for producing a block is a mathematical inequality — nothing else. No registration, no stake, no approval, no identity. A miner is anyone whose hardware finds a nonce that satisfies the inequality. When they find it, they broadcast the block, and every node in the network independently verifies that the inequality holds.
Sahyadri uses the term "miner" throughout — never "validator." The two are different roles with different security assumptions. Confusing them is how projects end up describing PoS mechanisms in a PoW system. The protocol has mining nodes. That is all.
Two Storage Paths
Different node roles have different storage requirements. A pruned node keeps only the recent state needed to validate current blocks. A full node keeps the current state and the block history needed to re-verify. An archive node keeps everything. The protocol defines what the state is; the node implementation decides how to store it efficiently.
Current State
The current account balances and Crest objects. This is what pruned, full, and archive nodes all keep — because it is what validation requires.
Historical Blocks
The full sequence of blocks and their headers. Required to independently verify the chain from genesis or from any checkpoint.
Historical State Snapshots
The state at each historical block. Required to answer queries about past balances, DIDs, and credentials without replaying.
The specific storage engine and storage format are implementation details, not protocol constants. Different implementations may use different storage backends — the protocol defines what must be verifiable, not how it must be stored.
A Peer-to-Peer Topology
Nodes communicate directly with each other over a P2P protocol. There is no central hub, no relay, no privileged node. A new node connects to any peer it can reach, syncs up, and begins participating. The graph formed by peer connections determines how quickly information propagates and how resilient the network is to partition.
The propagation time from any node to any other is logarithmic in the network size. Doubling the network adds roughly one more hop, not one more unit of latency. This is why a decentralized network can achieve near-instant broadcast without a central authority — the topology itself provides the efficiency.
Each node maintains multiple peer connections so that no single peer is a critical bridge. When a peer disconnects, the node reconnects to another. When a partition occurs, both sides continue producing blocks — and when the partition heals, both DAGs merge and the canonical order reconverges. This is a property of the DAG, not a feature that nodes must negotiate.
Three Ways to Contribute
Running infrastructure on Sahyadri requires no permission. There is no registration form, no identity verification, no acceptance process. You download the software, run it, and the network accepts you because the software behaves correctly.
Run a Node
Download the binary, run it, and start verifying. Every additional node increases the network's partition tolerance and decreases the risk of any single node being a point of failure.
Mine
Point a miner at a running node. The miner searches for valid PoW nonces and submits blocks. No pool required, no registration required.
Build Tooling
Wallets, explorers, indexers, SDKs. Every tool that makes the protocol easier to use reduces friction for the next participant.