-
Notifications
You must be signed in to change notification settings - Fork 1
/
simu11.py
44 lines (35 loc) · 1.54 KB
/
simu11.py
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
"""
Simulation with hashed c-class
- random hash (not questioned) - sha256 of a bitstring - 32 bytes
Nyzo Score computation from hash of IP start to effectively reorder the various c-class and their gaps.
Then complete the score with latest IP byte.
That last IP byte is shuffled from a permutation map, built from cycle hash, so that start of block and end of block ip do not get more odds.
Should be similar to first picking a single random c-class from the different c-classes, then picking a single ip from that c-class
"""
from libs.utils import random_hash
from libs.utils import hashed_class_score, shuffle
from libs.nodesreader import NodesReader
if __name__ == "__main__":
readers = []
for i in range(5):
readers.append(NodesReader("NODES/nodes.{}".format(i+1)))
# save_whois()
for test in range(1000):
cycle_hash = random_hash()
shuffle(cycle_hash)
# print("Run {}".format(test))
winners = []
for i in range(5):
winner = readers[i].winner(cycle_hash, scoring=hashed_class_score)
ip_class = readers[i].verifiers[winner][1]
ip_class_count = readers[i].ip_classes[ip_class][0]
# print(winner.hex(), ip_class, ip_class_count)
winners.append(winner)
# exit()
full = True
for i in range(4):
if winners[4] != winners[i]:
full = False
if not full:
print(cycle_hash.hex(), 'DIVERGE')
print("{},{},{},{}".format(test, full, ip_class, ip_class_count))