puzzle: 70 349b84b6 Possibility : 17
Seed : 1806955914 KHex : 349b84b6
Seed : 2415342823 KHex : 349b84b6
Seed : 4197018240 KHex : 349b84b6
Seed : 4347224256 KHex : 349b84b6
Seed : 5346252972 KHex : 349b84b6
Seed : 5352843046 KHex : 349b84b6
Seed : 5508295646 KHex : 349b84b6
Seed : 5894986884 KHex : 349b84b6
Seed : 6295082112 KHex : 349b84b6
Seed : 6439889966 KHex : 349b84b6
Seed : 7631063478 KHex : 349b84b6
Seed : 7701692142 KHex : 349b84b6
Seed : 8187722094 KHex : 349b84b6
Seed : 8403615774 KHex : 349b84b6
Seed : 9409843844 KHex : 349b84b6
Seed : 9835928266 KHex : 349b84b6
Seed : 9937976764 KHex : 349b84b6
you can check here with copy paste any integer from above
NGL, I do not get the same values when I copy and paste them in your python script.
BUT, your post got me tinkering with seeds. I'm running a test on a 24 bit key (DC2A04). Just letting it run to see how many matches I can get. From 0 up until I get bored lol. A few hundred so far. Highest one is 1477709519, so far.
import random
exp=30
while True:
x = input('seed integer : ')
seed_value = int(x)
random.seed(seed_value)
seed = str(seed_value)
a = random.randrange(2**(exp-1), 2**exp)
random_start = "%00x" % a
print('Seed : ' + str(x) + ' KHex : ' + str(random_start) + '\n')
I put "exp" as a variable. If it is 30 for his 70-bit list, then it matches.
Seed integer: 1806955914
Seed: 1806955914 KHex: 349b84b6
I did not use decimal numbers as seeds. I had faster results with a sequence of bytes represented in Python's byte literal format using the function os.urandom(length).
Let's start from the the fact that all puzzles are created from 32 zeros in bytes
b'\x00' * 23 (twenty-three zeroes) + 9 bytes (for Puzzle 66)
or
b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00'
Puzzle 1 have 1 bytes on end that is not zero
Puzzle 10 have 2 bytes on end that is not zero
Puzzle 20 have 3 bytes on end that is not zero
Puzzle 40 have 5 bytes on end that is not zero
Puzzle 50 have 7 bytes on end that is not zero
Puzzle 65 b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\xa88\xb15\x05\xb2hg'
Puzzle 64 b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\x05\x1f'\xb0\x91\x12\xd4'
Puzzle 63 b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00|\xce^\xfd\xac\xcfh\x08'
Puzzle 66 have 9 bytes on end that is not zero. *(66 bits is equal to 8.25 bytes.)
So, seed for puzzle 66 need to be 9 or 10 lenght in bytes
seed = os.urandom(10)