{"document_id":"BLC-STUDY-0216","slug":"bip-37","title":"Connection Bloom filtering","authors":"Mike Hearn","year":2012,"date_label":"2012","publisher":"Mike Hearn","paper_type":"Design paper","category":"Scaling","topics":["Scaling"],"source_url":"https://bips.dev/37","source_label":"BIP 37","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2012 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"BIP 37, Connection Bloom filtering. New support to the peer-to-peer protocol that allows peers to reduce the amount of transaction data they are sent.","canonical_url":"https://blockchainlab.com/whitepaper/bip-37","record_url":"https://blockchainlab.com/research/corpus/papers/bip-37","study_url":"https://blockchainlab.com/whitepaper/bip-37","last_reviewed":"2026-10-01","last_checked":"2026-10-01","relationships":[{"rel":"Canonical reading","label":"BIP 37 study","href":"/whitepaper/bip-37"},{"rel":"Related paper","label":"EIP-4844","href":"/whitepaper/eip-4844"},{"rel":"Related paper","label":"Plasma","href":"/whitepaper/plasma"},{"rel":"Related paper","label":"Arbitrum","href":"/whitepaper/arbitrum"}]}