-
Notifications
You must be signed in to change notification settings - Fork 84
/
analysis.py
121 lines (93 loc) · 3.06 KB
/
analysis.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
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
import time
interval_seconds = 10
checkpoint = time.time()
d_checkpoint = None
r_checkpoint = None
count_checkpoint = None
total_checkpoint = None
iterations = 0
def get_score(row):
try:
return int(row[116:])
except ValueError:
return 0
while True:
print(f'\n\n\nruntime: {round((time.time() - checkpoint) / 60, 2)} minutes')
with open('./efficient_addresses.txt') as f:
content = f.readlines()
d = [get_score(i) for i in content]
if d_checkpoint is None:
d_checkpoint = len(d)
d_change = len(d) - d_checkpoint
if (iterations != 0):
d_iterations = round(d_change/(iterations * interval_seconds), 4)
print(
f'valuable submissions found this run: {d_change}',
f'or {d_iterations} per second'
)
r = {}
count = {}
for i in d:
if i not in r:
r[i] = i
count[i] = 1
else:
r[i] += i
count[i] += 1
total = 0
for i in range(max(d) + 1):
if i in r:
total += r[i]
longest = max(len(str(k)) for k in count.keys())
if total_checkpoint is None:
total_checkpoint = total
change = total - total_checkpoint
if (iterations != 0):
r_iterations = round(change/(iterations * interval_seconds), 4)
else:
r_iterations = 0
print('sum of rewards this run:', change, 'or', r_iterations ,'per second')
if d_change > 0:
print('reward ratio this run:', round(change / d_change, 4))
print('\ntotal valuable submissions found:', len(d))
print('total rewards:', total)
if len(d) > 0:
print('total reward ratio:', round(total / len(d), 4))
print('total submissions by amount:')
for k, v in sorted(count.items()):
print(f' * {str(k).rjust(longest)}: {v}')
print('total submission rewards by %:')
for i in range(max(d) + 1):
if i in r:
try:
ratio = r[i] / total
except ZeroDivisionError:
ratio = 0
print(f' * {str(i).rjust(longest)}: {round(ratio * 10000) / 100}%')
most_valuable_index = d.index(max(d))
print('\nmost valuable submission found:', d[most_valuable_index])
print('found at line:', most_valuable_index + 1)
print(' * salt:', content[most_valuable_index][:66])
print(' * contract address:', content[most_valuable_index][70:112])
leading_zero_bytes = 0
for i, char in enumerate(content[most_valuable_index][72:111]):
if i % 2 == 0:
if (
char == '0' and
content[most_valuable_index][72:112][i + 1] == '0'
):
leading_zero_bytes += 1
else:
break
print(' * leading zero bytes:', leading_zero_bytes)
zero_bytes = 0
for i, char in enumerate(content[most_valuable_index][72:111]):
if (
i % 2 == 0 and
char == '0' and
content[most_valuable_index][72:112][i + 1] == '0'
):
zero_bytes += 1
print(' * total zero bytes:', zero_bytes)
iterations += 1
time.sleep(interval_seconds)