== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[noecp]

So for interested groups/individuals - I have these progress files and I will sell them for 2ETH (upfront payment). If you are interested, please contact me via private message. To be fair - I sell files only once.

Hello!
I want to clarify, do you track PM? check it pls...

[1714614672]

1714614672

[1714614672]

1714614672

[1714614672]

1714614672

[1714614672]

1714614672

[WanderingPhilospher]

Concerning #66.

I think I finally have a setup/plan in place for #66.

I am completing 2^25.5 * 2^20 ranges about every 40 minutes. There is never a stop in the program to receive new ranges...it'll just keep churning.

The ranges are not sequential, they are random.

TTD's pool has 66 bit space broken down into 2^25 * 2^40 chunks. The ranges are selected randomly however, if a user selects to run 16 ranges in their settings file, then those 16 ranges are sequential.
TTD's pool averages anywhere from 50 to 91 * 2^40 ranges ran in an hour.

It will be interesting:
a) if the pool and myself actually keep plugging along at #66
b) if a = true, which method will find the key first
c) if I don't change up my plan in the next hour, LOL
d) someone else gets lucky (which is all part of it), finds it first

TBC...

[racminer]

Concerning #66.

I think I finally have a setup/plan in place for #66.

I am completing 2^25.5 * 2^20 ranges about every 40 minutes. There is never a stop in the program to receive new ranges...it'll just keep churning.

The ranges are not sequential, they are random.

TTD's pool has 66 bit space broken down into 2^25 * 2^40 chunks. The ranges are selected randomly however, if a user selects to run 16 ranges in their settings file, then those 16 ranges are sequential.
TTD's pool averages anywhere from 50 to 91 * 2^40 ranges ran in an hour.

It will be interesting:
a) if the pool and myself actually keep plugging along at #66
b) if a = true, which method will find the key first
c) if I don't change up my plan in the next hour, LOL
d) someone else gets lucky (which is all part of it), finds it first

TBC...

looks just like this: https://bitcointalk.org/index.php?topic=5166284.msg52304416#msg52304416

[WanderingPhilospher]

Concerning #66.

I think I finally have a setup/plan in place for #66.

I am completing 2^25.5 * 2^20 ranges about every 40 minutes. There is never a stop in the program to receive new ranges...it'll just keep churning.

The ranges are not sequential, they are random.

TTD's pool has 66 bit space broken down into 2^25 * 2^40 chunks. The ranges are selected randomly however, if a user selects to run 16 ranges in their settings file, then those 16 ranges are sequential.
TTD's pool averages anywhere from 50 to 91 * 2^40 ranges ran in an hour.

It will be interesting:
a) if the pool and myself actually keep plugging along at #66
b) if a = true, which method will find the key first
c) if I don't change up my plan in the next hour, LOL
d) someone else gets lucky (which is all part of it), finds it first

TBC...

looks just like this: https://bitcointalk.org/index.php?topic=5166284.msg52304416#msg52304416

Nah, not really...you said "I distribute the scan over the 20-3F keyspace, pick 3 random bytes" whereas my program just randomly generates roughly 800,000 new random key starting points every minute and then sequentially checks 2^20 keys from each random key starting point.

I have kept track of random keys and it looks like it is spreading the wealth well; example:

Code:

28D4E0277C081E5CA:28D4E0277C091E5C9
28D4E02BBA5D1332A:28D4E02BBA5E13329
28D4E041E395F2573:28D4E041E396F2572
28D4E0607F14C80B0:28D4E0607F15C80AF
28D4E075FDD34F148:28D4E075FDD44F147
28D4E07C37F011453:28D4E07C37F111452
28D4E08AAB97836F6:28D4E08AAB98836F5
28D4E0A1A9D811BEB:28D4E0A1A9D911BEA
28D4E0AEEE8E296DB:28D4E0AEEE8F296DA
28D4E0BD38C2B2F06:28D4E0BD38C3B2F05
28D4E0E469E2B6C7B:28D4E0E469E3B6C7A
28D4E0F1215792DC6:28D4E0F1215892DC5
28D4E119FC628F882:28D4E119FC638F881
28D4E12D64D60CE2B:28D4E12D64D70CE2A
28D4E132D77EF395A:28D4E132D77FF3959
28D4E15F3806B6AC3:28D4E15F3807B6AC2
28D4E16A3F06FCA73:28D4E16A3F07FCA72
28D4E176B46007A2D:28D4E176B46107A2C
28D4E18BFA184442B:28D4E18BFA194442A
28D4E18F2A76BA970:28D4E18F2A77BA96F
28D4E19B68570B41D:28D4E19B68580B41C
28D4E1A5491239D9B:28D4E1A5491339D9A
28D4E1C6681E5C504:28D4E1C6681F5C503
28D4E1DAEEF98252A:28D4E1DAEEFA82529
28D4E1DDBB3FF7FF4:28D4E1DDBB40F7FF3
28D4E1EFA8F0548D2:28D4E1EFA8F1548D1
28D4E1EFFE9511DF2:28D4E1EFFE9611DF1
28D4E207A5B75F42E:28D4E207A5B85F42D
28D4E213C6A6B8C6C:28D4E213C6A7B8C6B
28D4E217E9A7DB657:28D4E217E9A8DB656
28D4E221F49AFB6C1:28D4E221F49BFB6C0
28D4E2276EE005CE3:28D4E2276EE105CE2
28D4E2336DEB90B9B:28D4E2336DEC90B9A
28D4E238D93926FF8:28D4E238D93A26FF7
28D4E23DA2C511145:28D4E23DA2C611144
28D4E244FE0046A3B:28D4E244FE0146A3A
28D4E248677B50841:28D4E248677C50840
28D4E2744D2AB6B61:28D4E2744D2BB6B60
28D4E27849F42F1DC:28D4E27849F52F1DB
28D4E286CBA302FF2:28D4E286CBA402FF1
28D4E290FD180E629:28D4E290FD190E628
28D4E29977D66C47E:28D4E29977D76C47D
28D4E2AA497795B22:28D4E2AA497895B21
28D4E2C36C5FED9F2:28D4E2C36C60ED9F1
28D4E2CEE5BFAADED:28D4E2CEE5C0AADEC
28D4E2D47E182E994:28D4E2D47E192E993
28D4E2EA1831248A1:28D4E2EA1832248A0
28D4E2EF62CD6F9AC:28D4E2EF62CE6F9AB
28D4E31F4D219EE25:28D4E31F4D229EE24
28D4E35AE6ECF7EE3:28D4E35AE6EDF7EE2
28D4E38072603EA7B:28D4E38072613EA7A
28D4E3A6AD31CD216:28D4E3A6AD32CD215
28D4E3A73AE9690E8:28D4E3A73AEA690E7
28D4E3ABB0000E888:28D4E3ABB0010E887
28D4E3ADEFC507266:28D4E3ADEFC607265
28D4E3B5AEC9C2433:28D4E3B5AECAC2432
28D4E3C22B7C27221:28D4E3C22B7D27220
28D4E3C467B56B9EC:28D4E3C467B66B9EB
28D4E3F230FD8B925:28D4E3F230FE8B924
28D4E3FB37B6D6128:28D4E3FB37B7D6127
28D4E41E4DC7B5E36:28D4E41E4DC8B5E35
28D4E41F6E62C69B2:28D4E41F6E63C69B1
28D4E4213EF02EBC5:28D4E4213EF12EBC4
28D4E424785644C44:28D4E424785744C43
28D4E43FEB5E5DF6F:28D4E43FEB5F5DF6E
28D4E44BCD5BCCF21:28D4E44BCD5CCCF20
28D4E456F350B83A2:28D4E456F351B83A1
28D4E457A33C241FB:28D4E457A33D241FA
28D4E465FC0A32BB6:28D4E465FC0B32BB5
28D4E46FA4D8982CF:28D4E46FA4D9982CE
28D4E4708B5520B0C:28D4E4708B5620B0B
28D4E472F5E6807AD:28D4E472F5E7807AC
28D4E47874328197A:28D4E478743381979
28D4E482B2896926A:28D4E482B28A69269
28D4E4A34864872C5:28D4E4A34865872C4
28D4E4AB021B3C6C2:28D4E4AB021C3C6C1
28D4E4B0AC4AF7CBC:28D4E4B0AC4BF7CBB
28D4E4BDA9525B5A3:28D4E4BDA9535B5A2
28D4E4BF53F19A70C:28D4E4BF53F29A70B
28D4E4DEC52C00E54:28D4E4DEC52D00E53
28D4E4FFEBDD3CFA8:28D4E4FFEBDE3CFA7
28D4E5066879F3AF8:28D4E506687AF3AF7
28D4E50DA8877DAA3:28D4E50DA8887DAA2
28D4E52BE7CB27C86:28D4E52BE7CC27C85
28D4E5416CAE58CA8:28D4E5416CAF58CA7
28D4E5466D445DB15:28D4E5466D455DB14
28D4E5674780AA1B3:28D4E5674781AA1B2
28D4E574FF0D23F5E:28D4E574FF0E23F5D
28D4E579B97D165AA:28D4E579B97E165A9
28D4E57E7A6C63BCF:28D4E57E7A6D63BCE
28D4E5976A9346782:28D4E5976A9446781
28D4E5B4FE60255AE:28D4E5B4FE61255AD
28D4E5BC294DFD93F:28D4E5BC294EFD93E
28D4E5E0C24670E09:28D4E5E0C24770E08
28D4E5F3F8BF30BDE:28D4E5F3F8C030BDD
...........
28D4EF044F95DE2E4:28D4EF044F96DE2E3
28D4EF072327410DF:28D4EF072328410DE
28D4EF28280B66C25:28D4EF28280C66C24
28D4EF339D4DFF567:28D4EF339D4EFF566
28D4EF33D5EBBD5EC:28D4EF33D5ECBD5EB
28D4EF401B0090104:28D4EF401B0190103
28D4EF40E40BEE2A9:28D4EF40E40CEE2A8
28D4EF4B3D9F23C07:28D4EF4B3DA023C06
28D4EF51CB4F7756C:28D4EF51CB507756B
28D4EF60D22E95AB3:28D4EF60D22F95AB2
28D4EF6E1A72FDDCD:28D4EF6E1A73FDDCC
28D4EF7571036602C:28D4EF7571046602B
28D4EF7E8740DB4D6:28D4EF7E8741DB4D5
28D4EF7F7E8C720C1:28D4EF7F7E8D720C0
28D4EF874C2853F27:28D4EF874C2953F26
28D4EF977BC95A271:28D4EF977BCA5A270
28D4EFA165D680C68:28D4EFA165D780C67
28D4EFA3F94265B6B:28D4EFA3F94365B6A
28D4EFA464739A94E:28D4EFA464749A94D
28D4EFB5E64E620ED:28D4EFB5E64F620EC
28D4EFDF2F171E92B:28D4EFDF2F181E92A
28D4EFE0ED5A68DBA:28D4EFE0ED5B68DB9

Every sub 44 bit range is being searched in, in roughly every 2.6 minutes.  Which eventually, every sub 40 bit will have been searched, and then every sub 36 bit, etc. etc.
Your way wasn't wrong, mine isn't, the pool's isn't...it's just luck at this point lol.

[NotATether]

I am completing 2^25.5 * 2^20 ranges about every 40 minutes. There is never a stop in the program to receive new ranges...it'll just keep churning.

How long will it take to exhaust #66 search space assuming the same setup and one person searching it?

This has the same build dependencies as bitcrack, thanks though, guess I'll have to download 40GB of VS and CUDA.🥱

10GB is more realistic to be honest, considering I installed Visual Studio 2022 just now so I saw the actual install size.


Has anyone made a 64-bit version of Bitcrack yet? VanBitKraken perhaps? I haven't actually ran it before so I just want to confirm whether that optimization has already been tackled.

[WanderingPhilospher]

How long will it take to exhaust #66 search space assuming the same setup and one person searching it?

I think I estimated something between 89 to 100 years LOL; for a complete exhaustion however, as everyone else, I am hoping for a little bit of luck and find it way before then.

[WanderingPhilospher]

Rome nor any city was built in a day...the same is true for this challenge.

It's critical to understand that, and that you just have to come up with your own way of approaching this challenge...1 piece at a time, regardless of how large or small that piece is.

So I ran a smaller card, GTX 1660Ti, for 8 hours in the 66 through 69 bit range, searching for the addresses of #66 through #69 challenges.

In those 8 hours, the card generated 14,690,305 different starting keys/points and checked 2^20 keys from each starting key/point. I saved every random starting point and added FFFFF to each one to show the ranges and keys checked in those 8 hours.

That is only 15+ trillion keys checked in total, but they are all spread out over the 66-69 bit range.

If you want to look at what this single card was able to accomplish in 8 hours, you can download the text file here and look at all the different ranges searched.
The file has been sorted for easier viewing.

link:

https://easyupload.io/tyeppz

password:
BTCChallenge

Let me know if you have any issues trying to download the text file. The file is only downloadable for 7 days.

One piece at a time...

(I am running round 2 of the same setup; a single card, searching for the four addresses, 66 through 69 bit. I will upload that file when it is done running/I stop the program.)

[digaran]

Rome nor any city was built in a day...the same is true for this challenge.

Agreed, however don't forget the original purpose of this challenge, which is to persuade people work together and find unforeseen weaknesses, so we should share all of our ideas publicly so the people in charge of development could have a chance of preventing any fatal damage to the system, because you know, it's not about one man becoming rich, it's about millions of people and their lives on the line.
      ________________________________________________

I'm interested to know if there is any way to calculate how often on average a certain address pops up in the key range, for example, take the first half from #66 address and search in sequence to see if you can find any pattern, if there was any then you could follow that same pattern for any other address.

What I realize is that we can never find any easy way to solve the riddle of breaking EC.

My suggestion is not just for you, Anyone with enough hash power could do this.

[WanderingPhilospher]

New ranges.

Link:
https://easyupload.io/es3jib

Password: BTCChallenge

Total ranges checked (in the file) with single card:  19,482,624

One piece at a time...

[WanderingPhilospher]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Enjoy!

[enfarktus]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Enjoy!

Hi, v0.1 is working but I couldn't run v0.2!

[WanderingPhilospher]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Enjoy!

Hi, v0.1 is working but I couldn't run v0.2!

What error did you receive?

I didn't load the dependencies. Now, Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Try that and let me know if it works. Thanks.

[Denis_Hitov]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Enjoy!

Hi.
Good program. I started without problems.
It is a pity that the program is slow. But thanks anyway for the update.

[digaran]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Enjoy!

Hi.
Good program. I started without problems.
It is a pity that the program is slow. But thanks anyway for the update.

Use the random version with GPU, if you don't know how, I'll teach you for 2 BTC  after I teach you some tricks, you'll be rich like Elon Musk. Lol.
Just joking. using GPU versions of any puzzle searching tool is more than 10 times faster, just saying.

[Denis_Hitov]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Enjoy!

Hi.
Good program. I started without problems.
It is a pity that the program is slow. But thanks anyway for the update.

Use the random version with GPU, if you don't know how, I'll teach you for 2 BTC  after I teach you some tricks, you'll be rich like Elon Musk. Lol.
Just joking. using GPU versions of any puzzle searching tool is more than 10 times faster, just saying.

Hi.
Good joke. Of course, I use different programs to find ranges using the GPU.
I can teach you for just 1 BTC. Lol.

[digaran]

Has anyone made a tool to correctly calculate the estimated time based on GPU computing power per puzzle? I could tell without any calculations that we are just scratching the surface using our systems, meaning it's not worth the time and effort, unless there was more bitcoins. Lol.

[enfarktus]

I had a few people want me to update a program that was built by someone else.

I have forked it, updated it and posted it. It now includes up to challenge #108. I will update to #160 as time permits.

https://github.com/WanderingPhilosopher/BitcoinChallengeScanner

It is a slow program but very easy to run, especially for beginners in the hunt for Red October (challenge/puzzle); but it will be a program like this that will probably find the key versus GPU power LOL!!

Enjoy!

Hi, v0.1 is working but I couldn't run v0.2!

What error did you receive?

I didn't load the dependencies. Now, Download the BitcoinChallengeScanner.zip and extract all. Then double click on the BitcoinChallengeScanner.exe file to get started.

Try that and let me know if it works. Thanks.

Everything is fine. Thanks for sharing.

[WanderingPhilospher]

Has anyone made a tool to correctly calculate the estimated time based on GPU computing power per puzzle? I could tell without any calculations that we are just scratching the surface using our systems, meaning it's not worth the time and effort, unless there was more bitcoins. Lol.

Easy way to calculate:

Take your speed in MKey/s. Divide range total by your MKey/s.

So if you have 30 MKey/s:

#66 has 36,893,488,147,419,103,232 total keys to check

36,893,488,147,419,103,232 / 30,000,000 (your total speed) = 1,229,782,938,247 seconds = 20,496,382,304 minutes = 341,606,371 hours = 14,233,598 days = 38,996 years to check all keys in #66 range.

[digaran]

Has anyone made a tool to correctly calculate the estimated time based on GPU computing power per puzzle? I could tell without any calculations that we are just scratching the surface using our systems, meaning it's not worth the time and effort, unless there was more bitcoins. Lol.

Easy way to calculate:

Take your speed in MKey/s. Divide range total by your MKey/s.

So if you have 30 MKey/s:

#66 has 36,893,488,147,419,103,232 total keys to check

36,893,488,147,419,103,232 / 30,000,000 (your total speed) = 1,229,782,938,247 seconds = 20,496,382,304 minutes = 341,606,371 hours = 14,233,598 days = 38,996 years to check all keys in #66 range.

And this is my cue to quit, lol. One could say, hope is a powerful motivation. That one is currently myself.

[pbies]

I am adding my work:

Code:

+------------+-----------------+-----------------+-------------------+
| orig hex   | orig dec        | difference      | difference in hex |
+------------+-----------------+-----------------+-------------------+
| 1          | 1               |                 |                   |
+------------+-----------------+-----------------+-------------------+
| 3          | 3               | 2               | 2                 |
+------------+-----------------+-----------------+-------------------+
| 7          | 7               | 4               | 4                 |
+------------+-----------------+-----------------+-------------------+
| 8          | 8               | 1               | 1                 |
+------------+-----------------+-----------------+-------------------+
| 15         | 21              | 13              | D                 |
+------------+-----------------+-----------------+-------------------+
| 31         | 49              | 28              | 1C                |
+------------+-----------------+-----------------+-------------------+
| 4C         | 76              | 27              | 1B                |
+------------+-----------------+-----------------+-------------------+
| E0         | 224             | 148             | 94                |
+------------+-----------------+-----------------+-------------------+
| 1D3        | 467             | 243             | F3                |
+------------+-----------------+-----------------+-------------------+
| 202        | 514             | 47              | 2F                |
+------------+-----------------+-----------------+-------------------+
| 483        | 1 155           | 641             | 281               |
+------------+-----------------+-----------------+-------------------+
| A7B        | 2 683           | 1 528           | 5F8               |
+------------+-----------------+-----------------+-------------------+
| 1460       | 5 216           | 2 533           | 9E5               |
+------------+-----------------+-----------------+-------------------+
| 2930       | 10 544          | 5 328           | 14D0              |
+------------+-----------------+-----------------+-------------------+
| 68F3       | 26 867          | 16 323          | 3FC3              |
+------------+-----------------+-----------------+-------------------+
| C936       | 51 510          | 24 643          | 6043              |
+------------+-----------------+-----------------+-------------------+
| 1764F      | 95 823          | 44 313          | AD19              |
+------------+-----------------+-----------------+-------------------+
| 3080D      | 198 669         | 102 846         | 191BE             |
+------------+-----------------+-----------------+-------------------+
| 5749F      | 357 535         | 158 866         | 26C92             |
+------------+-----------------+-----------------+-------------------+
| D2C55      | 863 317         | 505 782         | 7B7B6             |
+------------+-----------------+-----------------+-------------------+
| 1BA534     | 1 811 764       | 948 447         | E78DF             |
+------------+-----------------+-----------------+-------------------+
| 2DE40F     | 3 007 503       | 1 195 739       | 123EDB            |
+------------+-----------------+-----------------+-------------------+
| 556E52     | 5 598 802       | 2 591 299       | 278A43            |
+------------+-----------------+-----------------+-------------------+
| DC2A04     | 14 428 676      | 8 829 874       | 86BBB2            |
+------------+-----------------+-----------------+-------------------+
| 1FA5EE5    | 33 185 509      | 18 756 833      | 11E34E1           |
+------------+-----------------+-----------------+-------------------+
| 340326E    | 54 538 862      | 21 353 353      | 145D389           |
+------------+-----------------+-----------------+-------------------+
| 6AC3875    | 111 949 941     | 57 411 079      | 36C0607           |
+------------+-----------------+-----------------+-------------------+
| D916CE8    | 227 634 408     | 115 684 467     | 6E53473           |
+------------+-----------------+-----------------+-------------------+
| 17E2551E   | 400 708 894     | 173 074 486     | A50E836           |
+------------+-----------------+-----------------+-------------------+
| 3D94CD64   | 1 033 162 084   | 632 453 190     | 25B27846          |
+------------+-----------------+-----------------+-------------------+
| 7D4FE747   | 2 102 388 551   | 1 069 226 467   | 3FBB19E3          |
+------------+-----------------+-----------------+-------------------+
| B862A62E   | 3 093 472 814   | 991 084 263     | 3B12BEE7          |
+------------+-----------------+-----------------+-------------------+
| 1A96CA8D8  | 7 137 437 912   | 4 043 965 098   | F10A02AA          |
+------------+-----------------+-----------------+-------------------+
| 34A65911D  | 14 133 072 157  | 6 995 634 245   | 1A0F8E845         |
+------------+-----------------+-----------------+-------------------+
| 4AED21170  | 20 112 871 792  | 5 979 799 635   | 1646C8053         |
+------------+-----------------+-----------------+-------------------+
| 9DE820A7C  | 42 387 769 980  | 22 274 898 188  | 52FAFF90C         |
+------------+-----------------+-----------------+-------------------+
| 1757756A93 | 100 251 560 595 | 57 863 790 615  | D78F36017         |
+------------+-----------------+-----------------+-------------------+
| 22382FACD0 | 146 971 536 592 | 46 719 975 997  | AE0BA423D         |
+------------+-----------------+-----------------+-------------------+
| 4B5F8303E9 | 323 724 968 937 | 176 753 432 345 | 2927535719        |
+------------+-----------------+-----------------+-------------------+

No more because Excel does not accept larger numbers.

Maybe someone will find the above table useful.

EDIT below:

I also had division of each next number by the previous one, but see no sense to add it to this table.

I suspect that this puzzle can be solved by something related to HD wallet with proper seed (words as first as possible from the english set for seeds) or binary data (some simple, as hex 0x00...0001) as master private key.