5#ifndef BITCOIN_COMMON_BLOOM_H
6#define BITCOIN_COMMON_BLOOM_H
47 std::vector<unsigned char>
vData;
64 CBloomFilter(
const unsigned int nElements,
const double nFPRate,
const unsigned int nTweak,
unsigned char nFlagsIn);
static constexpr unsigned int MAX_BLOOM_FILTER_SIZE
20,000 items with fp rate < 0.1% or 10,000 items and <0.0001%
static constexpr unsigned int MAX_HASH_FUNCS
bloomflags
First two bits of nFlags control how much IsRelevantAndUpdate actually updates The remaining bits are...
@ BLOOM_UPDATE_P2PUBKEY_ONLY
BloomFilter is a probabilistic filter which SPV clients provide so that we can filter the transaction...
bool IsWithinSizeConstraints() const
True if the size is <= MAX_BLOOM_FILTER_SIZE and the number of hash functions is <= MAX_HASH_FUNCS (c...
void insert(Span< const unsigned char > vKey)
bool contains(Span< const unsigned char > vKey) const
std::vector< unsigned char > vData
unsigned int Hash(unsigned int nHashNum, Span< const unsigned char > vDataToHash) const
bool IsRelevantAndUpdate(const CTransaction &tx)
Also adds any outputs which match the filter to the filter (to match their spending txes)
SERIALIZE_METHODS(CBloomFilter, obj)
An outpoint - a combination of a transaction hash and an index n into its vout.
RollingBloomFilter is a probabilistic "keep track of most recently inserted" set.
bool contains(Span< const unsigned char > vKey) const
CRollingBloomFilter(const unsigned int nElements, const double nFPRate)
void insert(Span< const unsigned char > vKey)
int nEntriesPerGeneration
int nEntriesThisGeneration
std::vector< uint64_t > data
The basic transaction that is broadcasted on the network and contained in blocks.