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

Settlement as Proof

Settlement is not a promise — it is a state transition. Once a transaction is finalized on Sahyadri, no chargeback is possible, no reversal exists, and reconciliation is a mathematical check rather than a phone call. For businesses tired of credit-card disputes and banking delays, this is the difference between probabilistic and definitive settlement.

01 · Finality is Settlement

The Block Is the Receipt

In traditional payment systems, settlement is a separate event from authorization. A card is authorized in seconds, but the money moves days later — through clearing houses, correspondent banks, and reconciliation layers. Sahyadri collapses these steps into one: the moment a block is finalized, the transaction is settled. There is no downstream step.

settled(tx) ⟺ final(Btx)   ⟺   W(Btx) ≥ Wthreshold

Finality is not probabilistic in the Ethereum sense, and it is not delayed in the Visa sense. It is a threshold condition — crossed once, deterministic thereafter. The cumulative work behind a block only grows; the probability that it can be reversed only shrinks. A business that waits for a finality threshold has the same guarantee as one that waits a week — but in seconds, not days.

The Reconciliation Check

A business does not need to trust a payment processor's dashboard. It can verify any payment independently: given a block and a Merkle path, verify that the transaction is in the block; given the block and the chain, verify that the block is finalized. Both checks run in milliseconds and require no third party. This is what "reconciliation as arithmetic" means — the business does not ask anyone if it was paid, it verifies the proof.

02 · No Chargebacks

Reversal is Mathematically Impossible

A chargeback requires a mechanism — a court order, a processor, a network rule — that can override the ledger. Sahyadri has no such mechanism. Once a transaction is finalized, the state transition has happened, and no party on the network can un-happen it. Chargeback fraud, which costs merchants billions of dollars annually, is not mitigated in Sahyadri — it is eliminated, structurally.

∀ adversary A : Pr[reverse(finalized_tx) = ⊤] = 0

The only conceivable reversal is a reorganization at a depth so deep that it would require the adversary to control more hash power than the entire honest network, sustained for long enough to produce a competing chain that outweighs the original. The cost of such an attack exceeds the value it could extract by orders of magnitude. In economic terms, the attack is irrational; in mathematical terms, it is bounded below by an attacker probability of 0.

For the merchant, this changes the calculus of fraud prevention. There is no need to dispute, no need for arbitration, no need for manual review. Either the proof verifies — and the payment is real — or the proof fails and the customer was not charged. Disputes collapse to a single verification step that any employee or automated system can run.

Why This Changes Business

Chargeback fraud — where a buyer claims they did not authorize a purchase — accounts for a significant fraction of card-network losses. Businesses absorb these losses directly, in the form of dispute fees, held funds, and reputation damage. On Sahyadri, none of these exist as a mechanism. A confirmed payment is a confirmed payment. The only rational risk mitigation is to verify finality before delivering goods or services — which is a bounded, deterministic check, not a probabilistic gamble.

03 · The Cost Curve

A Fee That Does Not Scale with Amount

Card processors charge between 1.5% and 3% of every transaction, plus fixed fees. Wire transfers between banks cost $15–$50 flat, but take days. Sahyadri charges a small fixed fee in kana, regardless of the amount transferred. The economic consequence is that Sahyadri's cost per transaction does not grow with transaction size — which changes the unit economics of high-value settlement.

cost(tx) = feebase   ∧   ∂cost / ∂amount = 0

A business settling $1 and a business settling $1 million pay the same fee. This is fundamentally different from proportional-fee systems, where the cost scales linearly with the amount. It makes Sahyadri particularly attractive for high-value settlement, where the proportional costs of traditional systems can run into thousands of dollars per transaction.

effective_rate(amount) = feebase / amount   →   0 as amount → ∞

The effective rate — the fee as a fraction of the transferred amount — decreases with amount. Large transactions become cheaper per unit, not more expensive. This is the inverse of the card network model, where the fixed costs of risk assessment and dispute handling are baked into the percentage.

04 · Auditable Flow

Every Movement, Verifiably Real

Every business transaction on Sahyadri produces a public cryptographic trail. A business does not need to ask a processor or a bank whether a payment arrived — it can independently verify the proof. The same proof a customer generates is the proof the business verifies. This collapses reconciliation into a single cryptographic check.

received(tx) ⟺ Verify(path, tx.leaf, block.state_root) = ⊤   ∧   final(block)

The state root commits to every account balance and every crest object. A Merkle path from a specific account to that root proves that the account had a particular balance at that block. If the path verifies and the block is final, the payment is real — regardless of what any third party claims. There is no distinction between what the "system says" and what is true, because the system is the proof.

For accounting, this means the audit trail is a sequence of proofs rather than a sequence of statements. A business can hand an auditor a block hash and the auditor can verify the entire flow — incoming payments, outgoing payments, and the balance at each step — without trusting any operator. The mathematics is the audit.

05 · Integration Surface

Four Operations, One Protocol

The business-facing integration surface is a subset of the protocol RPC. Four operations cover the entire lifecycle of a payment — from accepting an invoice to reconciling settlement.

01

Generate a Payment Address

Derive a fresh address from your public key. Each invoice can use a unique address, eliminating cross-invoice confusion.

02

Broadcast the Payment

The customer submits a FlashTransaction signed with their key. No account creation, no authentication beyond the signature.

03

Verify Inclusion

When the payment appears in a block, fetch the Merkle path and verify it against the block state root. Confirms the payment is real.

04

Check Finality

Once the block containing the payment has accumulated enough cumulative work, mark the invoice as settled. No further verification needed.

Each operation is available over JSON-RPC and gRPC. Client libraries for common languages wrap the four operations into idiomatic interfaces. There is no API key, no rate limit tier for businesses, no premium endpoint that returns privileged data. The protocol surface is the API surface.

Settlement is not a promise. It is a state transition. Businesses that build on this protocol do not trust a processor — they verify a proof.
— Sahyadri