Search content
Sort by
Showing 20 of 196 results by Evillo
[ANN] DigitalNode [XDT] - PoW/PoS, Masternodes, Untraceable encrypted messaging
DigitalNode pioneered blockchain locking rewards but never fulfilled its original promise to utilize staking to secure the network, UNTIL NOW.
We are excited to announce long-awaited Proof-of-Stake functionality via our innovative PoW + PoS hybrid system! The old blockchain lock-reward system has evolved into full Proof-of-Stake, while still allowing for Proof-of-Work mining.
DigitalNode is resistant to the 51% attacks that plague other cryptocurrencies. We have taken a proactive approach versus 51% attacks since they are no longer just hypothetical in today's environment.
The network deploys multiple layers of security to achieve this. First, the very nature of a PoW + PoS currency implies that an attacker must not only have 51% of the hash rate but they must also have 51% of the total amount of coins to be able to attempt an attack.
This alone is very unlikely, but we have gone a step further by incorporating VRX v3.0. VRX v3.0 is a difficulty retargeting algorithm and system designed to keep PoW and PoS balanced, among other things.
This system ensures that neither block type can overpower the other and both miners and stakers can benefit the blockchain equally, eliminating either as a potential 51% attack vector.
Lastly, the new wallet verifies the entire incoming block before ever storing it to your disk, checking the stake difficulty and other parameters to make sure that a 51% attack is impossible.
VRX v3.0 also deploys a velocity constraint system to ensure a narrow window around the desired block target (while still allowing for some variance) essentially eliminating timestamp attacks.
Additionally, we are welcoming user-run Masternodes to the network! Masternodes incentivize network cooperation, strengthen chain security and also upgrade the network to allow instant transactions.
The collateral required to operate a Masternode is 2,000,000 XDT (more technical information is available in the resource section).
The DigitalNode blockchain is lightweight and mobile-ready. This will allow for features like a mobile encrypted messenger and mobile wallet, among other innovations.
Adaptive block sizes also help to govern the maximum allowable block size based off of network usage. This allows for seamless adaptability of the blockchain system to handle any kind of network load and environment.
Features
*Encrypted Messaging
*Instant Transactions
*Resistance to 51% Attacks
*Masternode Network
*Proof-of-Work + Proof-of-Stake
*VRX v3.0 Difficulty Retargeting Algorithm
*Lightweight/Mobile Blockchain
*Adaptive Block Sizes
Specifications
Supply cap: 10,000,000,000 XDT less 3,070,000,018 burnt coins, leaving a maximum supply of 6,929,999,982
Consensus: Proof-of-Work + Proof-of-Stake
PoW algorithm: bmw512 (Wish) - ASIC resistant
PoS algorithm: Echo512 - ASIC resistant
Block time target: 2 minutes
Minimum enforced block spacing: 45 seconds
Maximum block spacing (soft limit): 3.17 minutes
Confirmations required to spend: 15
Masternode collateral: 2,000,000 XDT
Block reward: 300 XDT (PoW + PoS + dev allocation)
Block reward split: 250 XDT PoW + PoS see-saw, 50 XDN dev allocation
Difficulty retarget: VRX v3.0 w/ hybrid chain swing
CodeBase origins: BTC 0.11 + reference source + custom XDN features (dynamic
max-block sizes, MN/Network payout see-saw, dev allocation, velocity blockchain
constraint system) + DASH features (Darksend, InstantTX, messaging, masternodes)
Masternode swing base: 100 XDT/block
Network swing base: 150 XDT/block
Network swing peak: 50 XDT/block
Emissions swing:
Incremental step: 20% step
Interval: 30 blocks
Step per interval: 1 step
Steps per swing: 5 steps (up or down)
Epoch (see-saw finish): 15 intervals
Upswing duration: 5 intervals
Downswing duration: 5 intervals
Idle duration: 5 intervals (no adjustment)
Wallets
Windows: https://github.com/phlddsy/DigitalNote/releases/download/2.0.1/DigitalNode-qt.win64.zip
Linux: https://github.com/phlddsy/DigitalNote/releases/download/2.0.1/DigitalNote-qt.linux.arm64
Full list of current pools will be there: https://miningpoolstats.stream/digitalnode
We are excited to announce long-awaited Proof-of-Stake functionality via our innovative PoW + PoS hybrid system! The old blockchain lock-reward system has evolved into full Proof-of-Stake, while still allowing for Proof-of-Work mining.
DigitalNode is resistant to the 51% attacks that plague other cryptocurrencies. We have taken a proactive approach versus 51% attacks since they are no longer just hypothetical in today's environment.
The network deploys multiple layers of security to achieve this. First, the very nature of a PoW + PoS currency implies that an attacker must not only have 51% of the hash rate but they must also have 51% of the total amount of coins to be able to attempt an attack.
This alone is very unlikely, but we have gone a step further by incorporating VRX v3.0. VRX v3.0 is a difficulty retargeting algorithm and system designed to keep PoW and PoS balanced, among other things.
This system ensures that neither block type can overpower the other and both miners and stakers can benefit the blockchain equally, eliminating either as a potential 51% attack vector.
Lastly, the new wallet verifies the entire incoming block before ever storing it to your disk, checking the stake difficulty and other parameters to make sure that a 51% attack is impossible.
VRX v3.0 also deploys a velocity constraint system to ensure a narrow window around the desired block target (while still allowing for some variance) essentially eliminating timestamp attacks.
Additionally, we are welcoming user-run Masternodes to the network! Masternodes incentivize network cooperation, strengthen chain security and also upgrade the network to allow instant transactions.
The collateral required to operate a Masternode is 2,000,000 XDT (more technical information is available in the resource section).
The DigitalNode blockchain is lightweight and mobile-ready. This will allow for features like a mobile encrypted messenger and mobile wallet, among other innovations.
Adaptive block sizes also help to govern the maximum allowable block size based off of network usage. This allows for seamless adaptability of the blockchain system to handle any kind of network load and environment.
Features
*Encrypted Messaging
*Instant Transactions
*Resistance to 51% Attacks
*Masternode Network
*Proof-of-Work + Proof-of-Stake
*VRX v3.0 Difficulty Retargeting Algorithm
*Lightweight/Mobile Blockchain
*Adaptive Block Sizes
Specifications
Supply cap: 10,000,000,000 XDT less 3,070,000,018 burnt coins, leaving a maximum supply of 6,929,999,982
Consensus: Proof-of-Work + Proof-of-Stake
PoW algorithm: bmw512 (Wish) - ASIC resistant
PoS algorithm: Echo512 - ASIC resistant
Block time target: 2 minutes
Minimum enforced block spacing: 45 seconds
Maximum block spacing (soft limit): 3.17 minutes
Confirmations required to spend: 15
Masternode collateral: 2,000,000 XDT
Block reward: 300 XDT (PoW + PoS + dev allocation)
Block reward split: 250 XDT PoW + PoS see-saw, 50 XDN dev allocation
Difficulty retarget: VRX v3.0 w/ hybrid chain swing
CodeBase origins: BTC 0.11 + reference source + custom XDN features (dynamic
max-block sizes, MN/Network payout see-saw, dev allocation, velocity blockchain
constraint system) + DASH features (Darksend, InstantTX, messaging, masternodes)
Masternode swing base: 100 XDT/block
Network swing base: 150 XDT/block
Network swing peak: 50 XDT/block
Emissions swing:
Incremental step: 20% step
Interval: 30 blocks
Step per interval: 1 step
Steps per swing: 5 steps (up or down)
Epoch (see-saw finish): 15 intervals
Upswing duration: 5 intervals
Downswing duration: 5 intervals
Idle duration: 5 intervals (no adjustment)
Wallets
Windows: https://github.com/phlddsy/DigitalNote/releases/download/2.0.1/DigitalNode-qt.win64.zip
Linux: https://github.com/phlddsy/DigitalNote/releases/download/2.0.1/DigitalNote-qt.linux.arm64
Full list of current pools will be there: https://miningpoolstats.stream/digitalnode
Yeah .. He, most likely, generated 256 keys and manually updated the first character on the left whenever necessary.
Lol .. you have no clue ehat we're talking about do you! The reason he changes the first character on the left is NOT to make ot difficult, it's to make the ranges as per his puzzle requirements.. in fact, even if he changes nothing.. Brutefocring the seed is impossible. A person who knows cryptography would know that humans are terrible in creating secure randomness. Changing numbers.or adding zeros doesn't do shit in terms of difficulty, the opposite is ture, it can actually increase predictability
Maybe Satoshi created this "puzzle", and once all the private keys are found... maybe a hash of the string composed of all the keys within individual ranges, or maybe something related to them... could lead to the private key that "controls" the addresses that received the first mined bitcoins. Science fiction ? XD
The only thing I don't understand, are all the keys from one seed and if they are, did he use the first 256 keys and didn't generate more? If he used the first generated 256 keys, which would be impossible to generate 256 keys and all of them have the exact bit range of the intended bit range.
So my guess is that he might have used a single seed but had to generate more than 256 keys to find the perfect keys matching the intended bit ranges if masked with leading zeros.
So explain what I mean.
Imagine I generate 256 keys and see none of them has 1 in the middle so that I could mask anything behind 1 with zeros and use that key for puzzle #125, for instance.
Example
Code:
5efad5987dc4a907698547d117b98892 0 5001159481c639e043e52d4f9b832e1
I can't use the key above for puzzle #125 because it has 0 in the middle instead of 1, so I'd either have to manually replace 0 with 1 or generate another key till I see 1 in the middle.In both cases there will be no pattern, no correlation between the keys whatsoever.
Yeah .. He, most likely l, generated 256 keys and manually updated the first character on the left whenever necessary.
I was trying to figure out a good way to break the key search into ranges.
I decided to use columns, ie. 17 columns. And group them into 4.
group 1 2000 - 2fff
group 2 0000 - ffff
group 3 0000 - ffff
group 4 0000 - ffff
group 5 0123456789abcdef
output: group 1 has 4096 lines
group 2 has 65536 lines
group 3 has 65536 lines
group 4 has 65536 lines
group 5 is 16 lines.
My idea is to create 2000 0000 0000 0000 0
But I'm still not sure how to bring them together in a string.
I decided to use columns, ie. 17 columns. And group them into 4.
group 1 2000 - 2fff
group 2 0000 - ffff
group 3 0000 - ffff
group 4 0000 - ffff
group 5 0123456789abcdef
output: group 1 has 4096 lines
group 2 has 65536 lines
group 3 has 65536 lines
group 4 has 65536 lines
group 5 is 16 lines.
My idea is to create 2000 0000 0000 0000 0
But I'm still not sure how to bring them together in a string.
On linux or WSL type: paste file1.txt file2.txt > fullrange.txt
Obviously change file names in your command according to your actual file names
Quote
Here is what i exactly did:
1. Generate the entire 64 range divided as 17,666,000 sub-ranges sorted sequentially at first.
2. Randomize the sub-ranges completely
3. Search each sub-range line by line, so that each sub-range completed gets me 1 in 17.6 million chance of winning.
After someone solved 64 and the pvt key was revealed, i found out that right sub-range after randomization was in line 1 million.
i.e: i was never meant to solve it if i kept going forward with this plan.
1. Generate the entire 64 range divided as 17,666,000 sub-ranges sorted sequentially at first.
2. Randomize the sub-ranges completely
3. Search each sub-range line by line, so that each sub-range completed gets me 1 in 17.6 million chance of winning.
After someone solved 64 and the pvt key was revealed, i found out that right sub-range after randomization was in line 1 million.
i.e: i was never meant to solve it if i kept going forward with this plan.
Ahhhh, gotcha...well it's not that you wouldn't have solved it with more resources.
At least you randomized the list somewhat. Sequential is brutal and defeating lol.
Lol yeah choosing sequential is like if you're deciding to fail even before you start.
Hello,
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I did something like that with puzzle 64 using keyhunt-cuda.. it was a file of 17,666,000 ranges .. after 64 got solved, i was curious as to where the correct range lied in my file, you know where it was?
Line number 1+ million !!!!!
Doesn't work. But you could be more lucky and find the correct range in line number 10 or something in your file
What do you mean it didn’t work?! So you were going through sequentially versus random?
Here is what i exactly did:
1. Generate the entire 64 range divided as 17,666,000 sub-ranges sorted sequentially at first.
2. Randomize the sub-ranges completely
3. Search each sub-range line by line, so that each sub-range completed gets me 1 in 17.6 million chance of winning.
After someone solved 64 and the pvt key was revealed, i found out that right sub-range after randomization was in line 1 million.
i.e: i was never meant to solve it if i kept going forward with this plan.
Hello,
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I did something like that woth puzzle 64 using keyhunt-cuda.. i was a file of 17,666,000 ranges .. after 64 got solved, i was curious as to where does the correct range lied in my file, you know where it was?
Line number 1+ million !!!!!
Doesn't work. But you could be more lucky and find the correct range in line number 10 or something in your file
Anyway to answer your PM I'm 80% certain about the range. I created the wallet years ago manually and was dumb enough to use it!!
That said, I think I prefer searching for it myself. If you would like to help with the setup, where it's best to rent GPUs, what version of Kangaroo to use, etc happy to pay a fee. I hope you understand, it's too much BTC to just give away the public key on a forum!
Thanks!!
You're implying that he's lying?
Do you know what i should say to you?
Do you?
I agree with you loool
The puzzle is not fun. There are use only power of GPU not power your Brain.
If you want fun, play video games. This is a serious thing. A security testing, increasingly hard, mind boggling, enthusiastically coding, mathematically challenging and most of all: very lucrative job. If you're a puss, you'll be run down by it.
Come down friend. There are not mathematically is just Random. I try many theory mathematics and found some rule of puzzle. There are never complete.
If you like lottery of bitcoin. Try your luck.
Did I understand correctly? We are engaged in breaking elliptical curves - it's really fascinating! As soon as we do this, all cryptocurrencies will be worth - zero! People are a strange animal!))
This will never happen .. even on 160 bit range .. will never happen .. i am more likely to become the president of the US without having its nationality than we breaking the elliptic curve .. you're dealing with numbers as much as almost the number of atoms of the known universe .. but for solving puzzles, it can happen, good luck everyone.
Yeah, most people don't know that Beating Satoshi is impossible without quantum devices
The puzzle is not fun. There are use only power of GPU not power your Brain.
If you want fun, play video games. This is a serious thing. A security testing, increasingly hard, mind boggling, enthusiastically coding, mathematically challenging and most of all: very lucrative job. If you're a puss, you'll be run down by it.
Come down friend. There are not mathematically is just Random. I try many theory mathematics and found some rule of puzzle. There are never complete.
If you like lottery of bitcoin. Try your luck.
Did I understand correctly? We are engaged in breaking elliptical curves - it's really fascinating! As soon as we do this, all cryptocurrencies will be worth - zero! People are a strange animal!))
This will never happen .. even on 160 bit range .. will never happen .. i am more likely to become the president of the US without having its nationality than we breaking the elliptic curve .. you're dealing with numbers as much as almost the number of atoms of the known universe .. but for solving puzzles, it can happen, good luck everyone.
The puzzle is not fun. There are use only power of GPU not power your Brain.
If you want fun, play video games. This is a serious thing. A security testing, increasingly hard, mind boggling, enthusiastically coding, mathematically challenging and most of all: very lucrative job. If you're a puss, you'll be run down by it.
If I rely on mathematics and common sense, I come to only two conclusions! 1) Someone very rich decided to laugh!!! 2) This is such an advertising company - from manufacturer of graphics processors!!! )))
People who solved puzzles from #1 to #120 would disagree.. but your logic is very reasonable.
"Imagine for puzzle 66, for a single computer that i have, I need about 2,500 years to be able to get one of his lowest easiest puzzles which are 6.6BTC"
Well, yes, the author of Puzzle suggests searching for the key 2 ^ 158. No pub key! As I understand it, we must brute force. ))) Guys, well, you're not idiots! Why did you
2500 years? I have estimated with the help of my mentor, that I need around 40,000 years to brute force 66. So you are way ahead of me.Well, yes, the author of Puzzle suggests searching for the key 2 ^ 158. No pub key! As I understand it, we must brute force. ))) Guys, well, you're not idiots! Why did you
I guess the point of this "crap" is to show off, here some free bitcoins in the easiest bit ranges for grab, collect them if you can.
It also is an indication to warn people why using addresses more than once is not a good practice, as we all know exposed public keys can endanger the security of private key exponentially.
No, a public key exposed is not even slightly a threat to a wallet address security .. it's as hard as a hidden public key .. don't let puzzles like #120,#125 etc fool you into thinking that solving the key got any easier.. a regular wallet's public key lies in the 253 - 256 bit range .. which is impossible to run bruteforce against and find a private key .. it would take billions of years and maybe more .. even trying to use math and tools to solve a 160 bit public key is impossible in our world .. but in theory, yes, Satoshi designed public keys to be used once then thrown away, just in case.
Quote from: digaran
The only one who can give you the knowledge is your maker, you just need to ask him properly.😉
You mean mom? Unfortunately she's not that good at Maths.
He means God, our Lord
Lol .. and i mean sarcasm, look ot.up sometime.
Quote from: digaran
The only one who can give you the knowledge is your maker, you just need to ask him properly.😉
You mean mom? Unfortunately she's not that good at Maths.
zahid888 He also wrote that he used a "It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)" this means that he could use anything, but most likely a regular random 2^256 address. He could create the keys a month before filling, or a week. And one time is not enough to shove all the devilry there, the clock counters... all this nonsense has a range "Mersenne twister 2^19937 bit (624·32 (2^32 = 4294967296) — 31)".
***
test
it took to open the first 3 puzzles through seed()
a = random.seed(1,15000000)
a1 = random.randrange(512,1024)
if a1 == 514:
a2 = random.randrange(256,512)
if a2 == 467:
a3 = random.randrange(128,256)
if a3 == 224:
14429208 seed-steps, 514, 467, 224
for 4 it's been a long time to search 1,1000000000...
because when finding the first one, it is necessary to iterate over all the first ones until it suits the second one, etc.
1024×1024×1024 = 1073741824 for 3pz
2048×2048×2048×2048 = 17592186044416 for 4pz
etc...
probably needed for the whole puzzle 160-66=94, (2^160)^94 ~ 2^15040
2^15040 all pz
2^19937 twister
***
test
it took to open the first 3 puzzles through seed()
a = random.seed(1,15000000)
a1 = random.randrange(512,1024)
if a1 == 514:
a2 = random.randrange(256,512)
if a2 == 467:
a3 = random.randrange(128,256)
if a3 == 224:
14429208 seed-steps, 514, 467, 224
for 4 it's been a long time to search 1,1000000000...
because when finding the first one, it is necessary to iterate over all the first ones until it suits the second one, etc.
1024×1024×1024 = 1073741824 for 3pz
2048×2048×2048×2048 = 17592186044416 for 4pz
etc...
probably needed for the whole puzzle 160-66=94, (2^160)^94 ~ 2^15040
2^15040 all pz
2^19937 twister
Holy shhhit .. that's even waaaay harder than cracking a full 256 bits key.
Hi there guys,
Considering your experience, how many keys a pc can scan in 1 second?
No kangaroo, no BSGS, but only random combination.
Considering your experience, how many keys a pc can scan in 1 second?
No kangaroo, no BSGS, but only random combination.
Code:
import time
def calculate_pi(n):
start_time = time.time()
s = 0
for i in range(n):
s += 4.0 * (-1) ** i / (2 * i + 1)
end_time = time.time()
return s, end_time - start_time
n = 1000000
pi, elapsed_time = calculate_pi(n)
print("Pi: %f" % pi)
print("Elapsed time: %f seconds" % elapsed_time)
print("Digit production speed: %f rakam/saniye" % (n / elapsed_time))
def calculate_pi(n):
start_time = time.time()
s = 0
for i in range(n):
s += 4.0 * (-1) ** i / (2 * i + 1)
end_time = time.time()
return s, end_time - start_time
n = 1000000
pi, elapsed_time = calculate_pi(n)
print("Pi: %f" % pi)
print("Elapsed time: %f seconds" % elapsed_time)
print("Digit production speed: %f rakam/saniye" % (n / elapsed_time))
My android capability is 1.1 million/sec lool
I am the creator.
You are quite right, 161-256 are silly. I honestly just did not think of this. What is especially embarrassing, is this did not occur to me once, in two years. By way of excuse, I was not really thinking much about the puzzle at all.
I will make up for two years of stupidity. I will spend from 161-256 to the unsolved parts, as you suggest. In addition, I intend to add further funds. My aim is to boost the density by a factor of 10, from 0.001*length(key) to 0.01*length(key). Probably in the next few weeks. At any rate, when I next have an extended period of quiet and calm, to construct the new transaction carefully.
A few words about the puzzle. There is no pattern. It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty). It is simply a crude measuring instrument, of the cracking strength of the community.
Finally, I wish to express appreciation of the efforts of all developers of new cracking tools and technology. The "large bitcoin collider" is especially innovative and interesting!
The 'creator' created a wallet and increasingly changed the front bits to zero's
I wonder why there are still some who don't believe this?
Lol it's like we need a banner 😁
https://towardsdatascience.com/random-seeds-and-reproducibility-933da79446e3
And how does this random.seed() work?
set some value and then Mersenne twister...
Mersenne twister 19937 bit (624·32 (2^32 = 4294967296) — 31)
for example, we take 3 random
random.seed(blablabla)
random.randrange(1,10)
random.randrange(1,10)
random.randrange(1,10)
we get for each of the 3 in order from the vortex of the first three?
1— 31
random.randrange(1,10) 1,4294967296 (624·2)
random.randrange(1,10) 1,4294967296 (624·3)
random.randrange(1,10) 1,4294967296 (624·4)
and if we take 624 random.randrange(1,10) period ends and a new one begins again
1— 31 next period
random.randrange(1,10) 1,4294967296 (625)624·2
random.randrange(1,10) 1,4294967296 (626)624·3
random.randrange(1,10) 1,4294967296 (627)624·4
and if we have a large sample of random.randrange(36893488147419103232,73786976294838206464) he spends 1 period for 1 sample or 624 and a new one (then why are they not repeated 2^32?)
or he these 19937 bit takes it all at once
in other words, to complete all puzzles with 1 seed() we need to iterate over this seed() to iterate over all variations of this 2^19937 bit ((2^32)^624)?
and seed() itself doesn’t matter (with brute force) you don’t need old computers to run it randomly in order to pick up the date and time, etc. to create the same bitcoin address.
random.seed(1, 2^19937) and all pz
random.randrange(36893488147419103232,73786976294838206464) 66
...
random.randrange(21267647932558653966460912964485513216,42535295865117307932921825928971026432) 125
...
random.randrange(730750818665451459101842416358141509827966271488,1461501637330902918203684832716283019655932542976) 160
and the puzzles themselves need to be multiplied 2^160×2^159×2^158...×2^66
and if it turns out that there may be collisions here , If 2^19937 the most options to open all the puzzles at once through 1 seed()
And how does this random.seed() work?
set some value and then Mersenne twister...
Mersenne twister 19937 bit (624·32 (2^32 = 4294967296) — 31)
for example, we take 3 random
random.seed(blablabla)
random.randrange(1,10)
random.randrange(1,10)
random.randrange(1,10)
we get for each of the 3 in order from the vortex of the first three?
1— 31
random.randrange(1,10) 1,4294967296 (624·2)
random.randrange(1,10) 1,4294967296 (624·3)
random.randrange(1,10) 1,4294967296 (624·4)
and if we take 624 random.randrange(1,10) period ends and a new one begins again
1— 31 next period
random.randrange(1,10) 1,4294967296 (625)624·2
random.randrange(1,10) 1,4294967296 (626)624·3
random.randrange(1,10) 1,4294967296 (627)624·4
and if we have a large sample of random.randrange(36893488147419103232,73786976294838206464) he spends 1 period for 1 sample or 624 and a new one (then why are they not repeated 2^32?)
or he these 19937 bit takes it all at once
in other words, to complete all puzzles with 1 seed() we need to iterate over this seed() to iterate over all variations of this 2^19937 bit ((2^32)^624)?
and seed() itself doesn’t matter (with brute force) you don’t need old computers to run it randomly in order to pick up the date and time, etc. to create the same bitcoin address.
random.seed(1, 2^19937) and all pz
random.randrange(36893488147419103232,73786976294838206464) 66
...
random.randrange(21267647932558653966460912964485513216,42535295865117307932921825928971026432) 125
...
random.randrange(730750818665451459101842416358141509827966271488,1461501637330902918203684832716283019655932542976) 160
and the puzzles themselves need to be multiplied 2^160×2^159×2^158...×2^66
and if it turns out that there may be collisions here , If 2^19937 the most options to open all the puzzles at once through 1 seed()
One of the most interesting topics I've read in a while.. but what makes you think this was the way the creator used to generate the puzzles' sequence? There could be a million ways to be used for this?