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