Bulletproofs: Range Proof Verification at Logarithmic Scale
Bulletproofs cut Monero range proof sizes from ~13 KB to under 800 bytes. The mechanism is a recursive inner product argument, and the math holds up.
№ 002SecurityHomomorphic Encryption vs Zero-Knowledge Proofs
HE computes on encrypted data; ZK proofs verify claims about it. Understanding the mechanical difference prevents costly architectural mistakes.
№ 003SecurityConfidential Asset Protocols: Hiding Amounts on Chain
Pedersen commitments and range proofs shield transaction amounts on-chain while preserving cryptographically sound audit trails for regulators and investors.
№ 004SecurityPedersen Commitments and Confidential Transactions Explained
Pedersen commitments hide transaction amounts while letting anyone verify no coins were created from nothing. The exact mechanism, step by step.
№ 005SecurityZero-Knowledge Proofs: Proving Compliance, Not Data
Zero-knowledge proofs let crypto firms prove regulatory compliance to auditors without revealing any underlying user data. Here's the exact mechanism.
№ 006SecurityHow zk-SNARKs Stay Small Without Breaking Soundness
zk-SNARKs produce tiny proofs that verify in milliseconds. Here's the exact mechanism that makes them compact without letting cheaters through.