Skip to content
CryptoDecentral

Note

A Hidden Amount Is Still a Checked Amount: How RingCT Proves No Money Comes From Nothing

Hiding an amount does not remove the audit; it changes what the audit is made of. Monero nodes check commitments that balance, range proofs, and key images — supply integrity rests on sound cryptography and correct checking code.

2026-11-20 · privacy, monero, ringct, pedersen-commitments, range-proofs, bulletproofs, key-images, supply-auditability, protocol-literacy, civil-liberties

Listen · 10 min · AI voice

Dark CryptoDecentral hex mesh: two sealed bronze-rimmed teal hexagon clusters balance on either side of a calm luminous fulcrum line, their contents opaque; thin teal check-lines verify the balance without opening any cell. No text.

The most common objection to confidential amounts sounds reasonable: if nobody can see how much moved, how does anyone know a transaction didn't print money? On a transparent ledger the answer is arithmetic anyone can do. On Monero the arithmetic is still done — by every node, on every transaction — but it is done on sealed values.

hiding an amount does not remove the audit; it changes what the audit is made of. Instead of adding up visible numbers, nodes check commitments that balance, proofs that each hidden value is in range, and key images that stop any output being spent twice. Supply integrity then rests on two things you should name plainly: the soundness of that cryptography, and the correctness of the code that checks it.

This builds on the Monero-class privacy overview, which introduced RingCT in one paragraph. This note opens that paragraph up.

What a transparent ledger lets anyone add up

Zero to Monero 2.0 starts its amount chapter with the baseline: in most cryptocurrencies, outputs "communicate those amounts in clear text. This allows observers to easily verify the amount spent equals the amount sent." Anyone can sum the inputs, sum the outputs, subtract the fee, and see zero.

That convenience has a price. The same numbers reveal salaries, rent, donations to a cause, a clinic bill. Hiding them is a civil-liberty feature. The design problem is keeping the public check while removing the public numbers.

Mechanism one: a commitment that hides and binds

A Pedersen commitment lets you "commit to a certain value without revealing it or being able to change it." Zero to Monero defines it on the elliptic curve as C = xG + aH: a is the amount, x is a random blinding factor (the "mask"), and G and H are two generator points where nobody knows the discrete-log relationship between them.

Three properties do the work:

  • Hiding. Many combinations of x and a produce the same C; with a truly random mask, an observer "would have literally no way to figure out a." Zero to Monero calls this perfect hiding.
  • Binding. The committer cannot find a second opening without solving the discrete-log problem for H — "computational binding."
  • Homomorphism. C(a) + C(b) = C(a + b). You can add sealed values and get a seal of the sum.

That last property is what makes a public balance check possible without public amounts.

Mechanism two: the balance check

Each input in a RingCT transaction comes with a pseudo output commitment: a fresh commitment to the same amount as the real output being spent, under a new mask. (Re-committing matters because the ring hides which earlier output is real; the signature proves the pseudo commitment matches one ring member without saying which.) The sender picks masks so that they cancel across the transaction.

The fee is public, so it is committed with no mask at all: C(f) = fH. A node then checks:

sum(pseudo output commitments) − sum(output commitments) − fH = 0

If the masks cancel and the equation holds, the hidden amounts in equal the hidden amounts out plus the fee. Moneropedia puts it in plain words: the sums "can be verified as being equal," while each individual value — and even the ratio between two outputs — stays undeterminable.

Mechanism three: range proofs, because the curve wraps around

The balance check alone has a hole. Curve arithmetic works modulo the group order l, so a "negative" amount is just a very large positive one. Zero to Monero's worked example: inputs 6 and 5, outputs 21 and −10. The equation (6 + 5) − (21 − 10) = 0 balances — but −10 is really l − 10, and the transaction has "effectively created l more" coins than went in.

The fix is a range proof: a zero-knowledge proof that each output amount lies between 0 and 2^64 − 1, without revealing it. The range is so small next to l that rolling over by adding many legitimate outputs would take, in Zero to Monero's estimate, around 2^189 outputs.

Range proofs have been rebuilt twice in production:

  • Originally they used ring signatures over the amount's bits (later Borromean signatures), which Moneropedia's Bulletproofs page says made transactions very large.
  • Bulletproofs (Bünz et al.) are short proofs with no trusted setup whose size grows logarithmically — 2·log₂(n) + 9 group and field elements for an n-bit range — and can be aggregated across outputs. After community-funded audits, Monero activated them in the October 2018 network upgrade; Moneropedia reports average transaction size fell by at least 80%.
  • Bulletproofs+ (Chung et al.) shrink the 64-bit range proof to 576 bytes, which the paper describes as 85.7% of the previous best. Monero's v0.18 release lists "add Bulletproofs+ to decrease transactions size and verification time," activated at the network upgrade of about 13 August 2022 (block 2,688,888). The upgrade announcement estimated typical transactions ~5–7% smaller and verification ~5–7% faster.

The job never changed: prove every hidden amount is a real, non-negative number.

Mechanism four: key images stop the same coin being spent twice

Balance and range say nothing about reuse. Every spend carries a key image, deterministically derived from the real output's private key. The network checks that a key image has never appeared before; a repeat means a double-spend attempt, even though nobody learns which ring member was real.

This check has failed before. In a May 2017 disclosure, Monero described a bug affecting all CryptoNote-based coins: a key image "can be modified in a special way, allowing double-spends," enabling "an unlimited number of coins in a way that is undetectable to an observer" who didn't know to look. The patch was simple: multiply each key image by the curve order l and reject it unless the result is the identity. Monero scanned its chain, found it had never been exploited, and shipped the fix quietly before disclosing it.

What the supply argument actually rests on

New coins enter only through miner transactions, whose amounts Zero to Monero notes are "communicated in clear text," so anyone can total the emission schedule. Everything after that is checked, not read. The claim "no hidden inflation" therefore holds only if commitments are binding, range proofs are sound, and the code enforcing all four checks is correct.

The 2017 key-image bug was an implementation gap. A soundness break looks different. CVE-2019-7167 records that Zcash's original Sprout zk-SNARK had a flaw letting a cheating prover "transform the proof of one statement into an ostensibly valid proof of a different statement." The Electric Coin Co. disclosure says it was found on 1 March 2018, fixed by the Sapling upgrade on 28 October 2018, and that "an attacker could have created fake Zcash without being detected"; the company reported no evidence it was exploited. Different system, same lesson: when amounts are sealed, a broken proof means inflation nobody can see.

That is not a reason to dismiss confidential amounts. It is a reason to describe them honestly: auditable by math, not by eyeball.

What a node checks vs what an observer learns

A validating node checksAn outside observer learns
Commitments balance with the public feeThat the transaction balances; not any amount
Every output has a valid range proofThat outputs are in range; not their values or ratios
Key images are new and in the correct subgroupThat some ring member was spent; not which
Miner rewards match the scheduleThe public emission total

What you can verify yourself

  • Work through Zero to Monero chapter 5 with small numbers. The negative-amount example takes five minutes and shows exactly why range proofs exist.
  • Look at a transaction's raw data with any tool you trust: the fee is plaintext; amounts appear as commitments plus a range proof; each input shows a key image.
  • Running your own node means your machine performs every one of these checks on every transaction it accepts, instead of trusting anyone else's summary.
  • Read the 2017 and 2019 disclosures in full. Both show what a quiet, coordinated fix looks like.

What this is not

This note does not claim Monero's supply is proven correct forever, or that confidential amounts are risk-free; its whole point is that the guarantee is conditional. It does not compare privacy coins or rank designs, and it does not claim the same bug class affects every system. It does not cover the ring signature's internals, the commitment-to-zero step in full, or how FCMP++ would change membership proofs; Zero to Monero 2.0 also predates Bulletproofs+, so treat its exact transaction layout as historical. It is not custody, trading, or wallet advice, and nothing here was tested by CryptoDecentral on any wallet or app.

Related on CryptoDecentral

Further reading (primary)

More on this topic

All notes · Get the Monday radar by email