TOPCRYPTOBLOG — CRYPTO, FILED & NUMBEREDARCHIVERSSSign inWrite +
The Archive19 documents on file“Bitcoin Sighash Flags: Partial Signing Explained”“Bitcoin Silent Payments: Unique Addresses via BIP-352”“Ethereum's Keccak-256 vs SHA-3: Same Sponge, Different Hash”The Archive19 documents on file“Bitcoin Sighash Flags: Partial Signing Explained”“Bitcoin Silent Payments: Unique Addresses via BIP-352”“Ethereum's Keccak-256 vs SHA-3: Same Sponge, Different Hash”

All articles /

19 documents on file · #cryptography
Public / Free
SectionAllAnalysis 42Bitcoin 55DeFi 34Ethereum 73Markets 7Mining 19Regulation 23Security 33World Cup 3
SortNewestOldestMost read
№ 001Bitcoin

Bitcoin Sighash Flags: Partial Signing Explained

Sighash flags let Bitcoin signers commit to only part of a transaction, the mechanics, the real tradeoffs, and what each flag actually does.

Daniel Brooks5 min read / 19.07.2026
№ 002Bitcoin

Bitcoin 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.

Daniel Brooks6 min read / 18.07.2026
№ 003Ethereum

Ethereum's Keccak-256 vs SHA-3: Same Sponge, Different Hash

Ethereum uses Keccak-256, not NIST SHA-3. Same sponge construction, different padding, different output, and the gap has broken real production tooling.

Lucas Harper4 min read / 15.07.2026
№ 004Ethereum

Ethereum Verkle Trees: Witness Size for Stateless Clients

Verkle trees shrink Ethereum's cryptographic witnesses from megabytes to kilobytes, the mechanics of why that matters for stateless client verification.

Ethan Caldwell4 min read / 14.07.2026
№ 005Security

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.

Daniel Brooks5 min read / 08.07.2026
№ 006Security

Verifiable Delay Functions and Randomness Beacon Security

VDFs make on-chain randomness manipulation structurally expensive via a sequential delay no adversary can compress. The mechanics, caveats, tradeoffs.

Daniel Brooks4 min read / 07.07.2026
№ 007Security

Keccak-256 Preimage Resistance and Ethereum's State Trie

How Ethereum's Keccak-256 hash function blocks preimage attacks on the state trie, explained with concrete mechanics and a worked example.

Daniel Brooks5 min read / 04.07.2026
№ 008Security

Merkle Mountain Ranges: Proof of Inclusion Explained

MMRs let blockchains prove data inclusion against a growing history without invalidating old proofs. The mechanic, the math, and the tradeoffs.

Daniel Brooks7 min read / 03.07.2026
№ 009Security

Homomorphic Encryption vs Zero-Knowledge Proofs

HE computes on encrypted data; ZK proofs verify claims about it. Understanding the mechanical difference prevents costly architectural mistakes.

Daniel Brooks7 min read / 03.07.2026
№ 010Analysis

Recursive STARK Proofs: Flat Verification Costs Explained

Recursive STARKs aggregate thousands of proofs into one fixed-cost verification. The mechanism, the trade-offs, and a worked example.

Ethan Caldwell4 min read / 02.07.2026
№ 011Ethereum

Cryptographic Accumulators and Stateless Clients

Cryptographic accumulators let blockchain clients verify transactions without storing full state, the mechanism, real tradeoffs, and decentralization stakes.

Ethan Caldwell6 min read / 30.06.2026
№ 012Bitcoin

BIP-32 HD Wallets: How Key Derivation Actually Works

BIP-32 derives millions of Bitcoin keys from one seed without exposing the root. The exact mechanism, the hardening tradeoff, and where the real risks sit.

Sophia Bennett5 min read / 29.06.2026
The Signal — weekly

CRYPTO/IN YOUR INBOX

One filed dispatch a week. Analysis only — no hype, no shilling.