-
Notifications
You must be signed in to change notification settings - Fork 446
Expand file tree
/
Copy pathBloomFilter.php
More file actions
379 lines (328 loc) · 8.88 KB
/
BloomFilter.php
File metadata and controls
379 lines (328 loc) · 8.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
<?php
declare(strict_types=1);
namespace BitWasp\Bitcoin\Bloom;
use BitWasp\Bitcoin\Crypto\Hash;
use BitWasp\Bitcoin\Math\Math;
use BitWasp\Bitcoin\Script\Classifier\OutputClassifier;
use BitWasp\Bitcoin\Serializable;
use BitWasp\Bitcoin\Serializer\Bloom\BloomFilterSerializer;
use BitWasp\Bitcoin\Transaction\OutPointInterface;
use BitWasp\Bitcoin\Transaction\TransactionInterface;
use BitWasp\Buffertools\BufferInterface;
class BloomFilter extends Serializable
{
const LN2SQUARED = '0.4804530139182014246671025263266649717305529515945455';
const LN2 = '0.6931471805599453094172321214581765680755001343602552';
const MAX_HASH_FUNCS = '50';
const MAX_FILTER_SIZE = 36000; // bytes
const TWEAK_START = 0xFBA4C795;
const UPDATE_NONE = 0;
const UPDATE_ALL = 1;
const UPDATE_P2PUBKEY_ONLY = 2;
const UPDATE_MASK = 3;
/**
* @var Math
*/
private $math;
/**
* @var bool
*/
private $empty = true;
/**
* @var bool
*/
private $full = false;
/**
* @var int
*/
private $numHashFuncs;
/**
* @var array
*/
private $vFilter = [];
/**
* @var int
*/
private $nTweak;
/**
* @var int
*/
private $flags;
/**
* @param Math $math
* @param array $vFilter
* @param int $numHashFuncs
* @param int $nTweak
* @param int $flags
*/
public function __construct(Math $math, array $vFilter, int $numHashFuncs, int $nTweak, int $flags)
{
$this->math = $math;
$this->vFilter = $vFilter;
$this->numHashFuncs = $numHashFuncs;
$this->nTweak = $nTweak;
$this->flags = $flags;
$this->updateEmptyFull();
}
/**
* @param int $size
* @return array
*/
public static function emptyFilter(int $size): array
{
return str_split(str_pad('', $size, '0'), 1);
}
/**
* Create the Bloom Filter given the number of elements, a false positive rate,
* and the flags governing how the filter should be updated.
*
* @param Math $math
* @param int $nElements
* @param float $nFpRate
* @param int $nTweak
* @param int $flags
* @return BloomFilter
*/
public static function create(Math $math, int $nElements, float $nFpRate, int $nTweak, int $flags): BloomFilter
{
$size = self::idealSize($nElements, $nFpRate);
return new self(
$math,
self::emptyFilter($size),
self::idealNumHashFuncs($size, $nElements),
$nTweak,
$flags
);
}
/**
* @return bool
*/
public function isUpdateNone(): bool
{
return (($this->flags & self::UPDATE_MASK) === self::UPDATE_NONE);
}
/**
* @return bool
*/
public function isUpdateAll(): bool
{
return (($this->flags & self::UPDATE_MASK) === self::UPDATE_ALL);
}
/**
* @return bool
*/
public function isUpdatePubKeyOnly(): bool
{
return (($this->flags & self::UPDATE_MASK) === self::UPDATE_P2PUBKEY_ONLY);
}
/**
* @return bool
*/
public function isEmpty(): bool
{
return $this->empty;
}
/**
* @return bool
*/
public function isFull(): bool
{
return $this->full;
}
/**
* @return array
*/
public function getData(): array
{
return $this->vFilter;
}
/**
* @return int
*/
public function getNumHashFuncs(): int
{
return $this->numHashFuncs;
}
/**
* @return int
*/
public function getTweak(): int
{
return $this->nTweak;
}
/**
* @return int
*/
public function getFlags(): int
{
return $this->flags;
}
/**
* @param int $nElements
* @param float $fpRate
* @return int
*/
public static function idealSize(int $nElements, float $fpRate): int
{
$a = (-1/self::LN2SQUARED)*$nElements*log($fpRate);
$b = self::MAX_FILTER_SIZE*8;
return (int) floor(min($a, $b) / 8);
}
/**
* @param int $filterSize
* @param int $nElements
* @return int
*/
public static function idealNumHashFuncs(int $filterSize, int $nElements)
{
$a = (($filterSize*8)/$nElements)*self::LN2;
$b = self::MAX_FILTER_SIZE * 8;
return (int) floor(min($a, $b));
}
/**
* @param int $nHashNum
* @param BufferInterface $data
* @return string
*/
public function hash(int $nHashNum, BufferInterface $data): string
{
$hash = Hash::murmur3($data, ($nHashNum * self::TWEAK_START + $this->nTweak) & 0xffffffff)->getInt();
$hash = gmp_init($hash, 10);
$hash = $this->math->mod($hash, gmp_init(count($this->vFilter) * 8));
return gmp_strval($hash, 10);
}
/**
* @param BufferInterface $data
* @return $this
*/
public function insertData(BufferInterface $data)
{
if ($this->isFull()) {
return $this;
}
for ($i = 0; $i < $this->numHashFuncs; $i++) {
$index = $this->hash($i, $data);
$this->vFilter[$index >> 3] |= (1 << (7 & $index));
}
$this->updateEmptyFull();
return $this;
}
/**
* @param OutPointInterface $outPoint
* @return BloomFilter
*/
public function insertOutPoint(OutPointInterface $outPoint): BloomFilter
{
return $this->insertData($outPoint->getBuffer());
}
/**
* @param BufferInterface $data
* @return bool
*/
public function containsData(BufferInterface $data): bool
{
if ($this->isFull()) {
return true;
}
if ($this->isEmpty()) {
return false;
}
for ($i = 0; $i < $this->numHashFuncs; $i++) {
$index = $this->hash($i, $data);
if (!($this->vFilter[($index >> 3)] & (1 << (7 & $index)))) {
return false;
}
}
return true;
}
/**
* @param OutPointInterface $outPoint
* @return bool
*/
public function containsOutPoint(OutPointInterface $outPoint): bool
{
return $this->containsData($outPoint->getBuffer());
}
/**
* @return bool
*/
public function hasAcceptableSize(): bool
{
return count($this->vFilter) <= self::MAX_FILTER_SIZE && $this->numHashFuncs <= self::MAX_HASH_FUNCS;
}
/**
* @param TransactionInterface $tx
* @return bool
*/
public function isRelevantAndUpdate(TransactionInterface $tx): bool
{
$this->updateEmptyFull();
$found = false;
if ($this->isFull()) {
return true;
}
if ($this->isEmpty()) {
return false;
}
// Check if the txid hash is in the filter
$txHash = $tx->getTxId();
if ($this->containsData($txHash)) {
$found = true;
}
$classifier = new OutputClassifier();
// Check for relevant output scripts. We add the outpoint to the filter if found.
foreach ($tx->getOutputs() as $vout => $output) {
$script = $output->getScript();
$parser = $script->getScriptParser();
foreach ($parser as $exec) {
if ($exec->isPush() && $this->containsData($exec->getData())) {
$found = true;
if ($this->isUpdateAll()) {
$this->insertOutPoint($tx->makeOutPoint($vout));
} else if ($this->isUpdatePubKeyOnly()) {
if ($classifier->isMultisig($script) || $classifier->isPayToPublicKey($script)) {
$this->insertOutPoint($tx->makeOutPoint($vout));
}
}
}
}
}
if ($found) {
return true;
}
foreach ($tx->getInputs() as $txIn) {
if ($this->containsOutPoint($txIn->getOutPoint())) {
return true;
}
$parser = $txIn->getScript()->getScriptParser();
foreach ($parser as $exec) {
if ($exec->isPush() > 0 && $this->containsData($exec->getData())) {
return true;
}
}
}
return false;
}
/**
*
*/
public function updateEmptyFull()
{
$full = true;
$empty = true;
for ($i = 0, $size = count($this->vFilter); $i < $size; $i++) {
$byte = (int) $this->vFilter[$i];
$full &= ($byte === 0xff);
$empty &= ($byte === 0x0);
}
$this->full = (bool)$full;
$this->empty = (bool)$empty;
}
/**
* @return BufferInterface
*/
public function getBuffer(): BufferInterface
{
return (new BloomFilterSerializer())->serialize($this);
}
}