mfspv
Merkle-Forest SPV: sender-held inclusion proofs for BSV/Teranode at 10⁶–10¹¹ tx/s.
- Reference implementation
- Library
P
Be the first to ask prof-faustus something.
What do you think? ...
Complete, dependency-free Go implementation of Merkle-Forest SPV (MF-SPV) for BSV/Teranode. A five-level Merkle commitment hierarchy (field → TXID → subtree root → block root → MMR accumulator) with sender-pushed inclusion proofs, zero-dependency secp256k1, a double-spend alert layer, and a publication-grade scaling evaluation. Reference implementation with security audit and Monte-Carlo/property/mutation test suites.
Supported languages
GoBRC compliance
- N/A
Token protocols
- N/A
Domains
- node
- payments
Share this block
Share mfspv
✦
Earn XP for sharing
Sign in to get a personal referral link and earn XP every time someone visits through your link.
