Bitcoin Taproot Scriptpath Spending: What the Chain Reveals
Scriptpath spending exposes your Merkle tree depth to every node operator. The mechanics, the fingerprinting risk, and what wallet developers are missing.
№ 002BitcoinTaproot On-Chain: Keypath vs Scriptpath Spending
A Taproot output looks uniform until it's spent. The witness field reveals exactly which path was taken, and how much it exposes about your setup.
№ 003BitcoinBitcoin Taproot Key Path Spending and Script Privacy
Taproot key path spending makes complex Bitcoin contracts indistinguishable from simple payments. The mechanism, the limits, and why adoption breadth matters.
№ 004BitcoinBitcoin Erlay: Peer Selection and Mempool Privacy
Erlay cuts Bitcoin's relay bandwidth by ~84%. The peer selection logic, decided before any transaction data exists, is where the privacy argument lives.
№ 005BitcoinBitcoin's Dandelion Protocol and Transaction Origin Privacy
Dandelion splits Bitcoin propagation into stem and flood phases to defeat IP-to-transaction correlation. Mechanics, real tradeoffs, and deployment status.
№ 006BitcoinBitcoin Erlay Fanout Phase: Peer Selection Explained
Erlay's fanout phase pushes transactions to a randomized peer subset, not the whole network. A close look at the mechanism, its privacy logic, and its limits.
№ 007BitcoinBitcoin Silent Payments: Unique Addresses via BIP-352
BIP-352 lets senders derive a fresh Bitcoin address from your published keys alone, no coordination, no on-chain fingerprint. The mechanism, plainly explained.
№ 008BitcoinBitcoin Tapscript: Conditional Spending, Hidden Branches
Tapscript lets Bitcoin transactions spend one condition while keeping all others permanently hidden. The exact mechanism, with a worked example.
№ 009SecurityBulletproofs: 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.
№ 010DeFiMerkle Proofs and Selective Disclosure in Digital Identity
Merkle proofs let you prove one credential claim without exposing the rest. Here is the exact mechanism, a worked example, and the tradeoffs that matter.
№ 011SecurityHomomorphic Encryption vs Zero-Knowledge Proofs
HE computes on encrypted data; ZK proofs verify claims about it. Understanding the mechanical difference prevents costly architectural mistakes.
№ 012BitcoinBitcoin Compact Filters: Private Light Client Sync
BIP 157/158 compact filters let Bitcoin light clients verify transactions locally without exposing addresses to any full node. The mechanism, plainly explained.