A 25cm run / walk sounds way too short.
642 karma · joined November 19, 2022
https://github.com/TecharoHQ/anubis/blob/main/data/botPolici...
f = new Float64Array(1)
dv = new DataView(f.buffer)
dv.setBigInt64(0, -123n)
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array(1)
new BigUint64Array(f.buffer)[0] = -123n
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array(1)
f[0] = new Float64Array(new BigUint64Array([-123n]).buffer)[0]
console.log([...new Uint8Array(f.buffer)])
f = new Float64Array([NaN])
console.log([...new Uint8Array(f.buffer)])
I get on Chrome: [255, 255, 255, 255, 255, 255, 255, 133]
[133, 255, 255, 255, 255, 255, 255, 255]
[133, 255, 255, 255, 255, 255, 255, 255]
[0, 0, 0, 0, 0, 0, 248, 127]
And on Firefox: [ 255, 255, 255, 255, 255, 255, 255, 133 ]
[ 133, 255, 255, 255, 255, 255, 255, 255 ]
[ 0, 0, 0, 0, 0, 0, 248, 127 ]
[ 0, 0, 0, 0, 0, 0, 248, 127 ]
It looks like both implementations are buggy, Since both the DataView and buffer versions should be normalized.It already has a similar feature called SmartKey: https://www.youtube.com/shorts/_Qj33POZCyA
for i in range(1, 10**10):
for k in range(1, 5):
s = str(pow(2, i, 10**(10**k)))
if '1' in s or '3' in s or '5' in s or '7' in s or '9' in s:
break
else:
print(2**i)
It's really easily to parallelize, I was able to run it up to 10**8 in about 15min, so you would be able to run it up to 10**10 in a few hours with parallelization. >>> {i * sys.hash_info.modulus for i in range(5000)}
0.40s
>>> {i * sys.hash_info.modulus for i in range(50000)}
29.34s
>>> {i for i in range(50000)}
0.06s