proof
f-x

rebuilding the number from its parts

o[d] = counts[d] / n        d = sum over d of (o[d] - p[d])^2 / p[d]

adjusted = max(0, d - 8/n)        bps = min(adjusted, 0.401688) / 0.401688 * 300

raw reads

1

2

3

4

5

6

7

8

9

n

window 8192

recomputed here

1 / 0.30103 /

2 / 0.17609 /

3 / 0.12494 /

4 / 0.09691 /

5 / 0.07918 /

6 / 0.06695 /

7 / 0.05799 /

8 / 0.05115 /

9 / 0.04576 /

sum d

less 8/n

adjusted

bps

the hook says

distance

surcharge

every number on this site can be rebuilt from the left column. if the middle and right columns disagree the site is wrong, not the chain.