dextronomous
|
|
October 06, 2023, 11:45:38 AM |
|
Yo Nomachine,
nice catch, where's our current puzzle 66 in there,
thanks works like a charm.
|
|
|
|
|
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
|
|
|
digaran
Copper Member
Hero Member
Offline
Activity: 1330
Merit: 899
🖤😏
|
|
October 06, 2023, 12:37:56 PM |
|
Have you tried from 2000 up to 2015? You should also try 1990 to 2000, don't leave anything to chance, because for all we know he was a random guy using time and date to produce entropy. 😉
|
🖤😏
|
|
|
nomachine
Member
Offline
Activity: 255
Merit: 12
|
|
October 06, 2023, 12:45:45 PM |
|
Have you tried from 2000 up to 2015? You should also try 1990 to 2000, don't leave anything to chance, because for all we know he was a random guy using time and date to produce entropy. 😉
Nope. Only 2014-2015 Puzzle 65 import random from datetime import datetime, timedelta
# Specify the start and end date and times start_datetime_pre = datetime(2015, 1, 1, 0, 0, 0) end_datetime_pre = datetime(2015, 1, 15, 19, 7, 14)
# Define the range of numbers min_number = 18446744073709551615 max_number = 36893488147419103231
# Specify the target number target_number = 30568377312064202855
# Specify the target pattern target_pattern = '305683'
current_datetime = start_datetime_pre time_step = timedelta(seconds=1)
while current_datetime <= end_datetime_pre: # Calculate the time range in seconds time_range_seconds = 1
# Initialize binary search boundaries low_timestamp = int(current_datetime.timestamp()) high_timestamp = int(current_datetime.timestamp()) found_datetime = None # Initialize found_datetime
while low_timestamp <= high_timestamp: # Calculate the middle timestamp mid_timestamp = (low_timestamp + high_timestamp) // 2
# Use the middle timestamp as the seed to generate a number random.seed(mid_timestamp) generated_number = random.randint(min_number, max_number)
# Check if the generated number starts with the specified pattern if str(generated_number).startswith(target_pattern): found_datetime = datetime.fromtimestamp(mid_timestamp) break # Break out of the inner loop when a match is found
if generated_number < target_number: low_timestamp = mid_timestamp + 1 else: high_timestamp = mid_timestamp - 1
if found_datetime is not None: print("Pattern Found:", generated_number, "Found Timestamp:", found_datetime.strftime('%Y-%m-%d %H:%M:%S'))
# Increment the current datetime by one second for the next timestamp current_datetime += time_step
Pattern Found: 30568335039670351430 Found Timestamp: 2015-01-01 22:52:54 Pattern Found: 30568326435315315618 Found Timestamp: 2015-01-05 02:12:12 Pattern Found: 30568385998074263793 Found Timestamp: 2015-01-12 13:05:27 Pattern Found: 30568318046551998275 Found Timestamp: 2015-01-14 07:04:04 Pattern Found: 30568367946192456402 Found Timestamp: 2015-01-14 12:26:35 2015-01-14 12:26:35 is the closest... missing many decimal places. if we use the same timestamp 2015-01-14 12:26:35 - puzzle 66 starts with 490151 or 49015112019902008018 This is just an assumption.
|
|
|
|
alek76
Member
Offline
Activity: 93
Merit: 16
|
|
October 06, 2023, 12:55:48 PM |
|
Yo Nomachine,
nice catch, where's our current puzzle 66 in there,
thanks works like a charm.
The same thing, but only after 100 years. I think this script is useless. ==================================== linuxtime: 4573737217 Puzzle 1 Private Key : 0x1 Timestamp: 2114-12-08 21:33:37 ==================================== linuxtime: 4576602332 Puzzle 2 Private Key : 0x3 Timestamp: 2115-01-11 01:25:32 ==================================== linuxtime: 4576602332 Puzzle 3 Private Key : 0x7 Timestamp: 2115-01-11 01:25:32 ==================================== linuxtime: 4571281403 Puzzle 4 Private Key : 0x8 Timestamp: 2114-11-10 11:23:23 ==================================== linuxtime: 4575384117 Puzzle 5 Private Key : 0x15 Timestamp: 2114-12-27 23:01:57 ==================================== linuxtime: 4576538378 Puzzle 6 Private Key : 0x31 Timestamp: 2115-01-10 07:39:38 ==================================== linuxtime: 4571025590 Puzzle 7 Private Key : 0x4c Timestamp: 2114-11-07 12:19:50 ==================================== linuxtime: 4570872102 Puzzle 10 Private Key : 0x202 Timestamp: 2114-11-05 17:41:42 ==================================== linuxtime: 4576802823 Puzzle 8 Private Key : 0xe0 Timestamp: 2115-01-13 09:07:03 ==================================== linuxtime: 4574581413 Puzzle 13 Private Key : 0x1460 Timestamp: 2114-12-18 16:03:33 ==================================== linuxtime: 4571991458 Puzzle 12 Private Key : 0xa7b Timestamp: 2114-11-18 16:37:38 ==================================== linuxtime: 4575374435 Puzzle 9 Private Key : 0x1d3 Timestamp: 2114-12-27 20:20:35 ==================================== linuxtime: 4570872160 Puzzle 11 Private Key : 0x483 Timestamp: 2114-11-05 17:42:40 ==================================== linuxtime: 4575758239 Puzzle 15 Private Key : 0x68f3 Timestamp: 2115-01-01 06:57:19 ==================================== linuxtime: 4572100404 Puzzle 14 Private Key : 0x2930 Timestamp: 2114-11-19 22:53:24 ==================================== linuxtime: 4573632515 Puzzle 20 Private Key : 0xd2c55 Timestamp: 2114-12-07 16:28:35 ====================================
|
|
|
|
nomachine
Member
Offline
Activity: 255
Merit: 12
|
|
October 06, 2023, 01:08:34 PM |
|
Because it's not just time involved here in seed. A parameter is missing.
|
|
|
|
|
digaran
Copper Member
Hero Member
Offline
Activity: 1330
Merit: 899
🖤😏
|
|
October 06, 2023, 04:13:12 PM |
|
Why do you use linux time? Satoshi was using windows, either vista or seven, maybe even 8, or xp. 😂 we just need to look for all the keys. Lol You know what we should do? We should use the same technic to search for rmd160 hash patterns and find collisions. 🙃
|
🖤😏
|
|
|
nomachine
Member
Offline
Activity: 255
Merit: 12
|
|
October 06, 2023, 04:34:00 PM Last edit: October 06, 2023, 04:45:16 PM by nomachine |
|
Why do you use linux time? Satoshi was using windows, either vista or seven, maybe even 8, or xp. 😂 we just need to look for all the keys. Lol You know what we should do? We should use the same technic to search for rmd160 hash patterns and find collisions. 🙃
I can assume that the Satoshi was using some script (errors = ZERO) with Lagrange interpolation, determining the formula that generates the values may require a different approach, such as symbolic regression or other mathematical techniques together with random numbers and time. I am lost in numbers and hypotheses now. I need green grass..
|
|
|
|
digaran
Copper Member
Hero Member
Offline
Activity: 1330
Merit: 899
🖤😏
|
|
October 06, 2023, 04:59:55 PM |
|
I can assume that the Satoshi was using some script (errors = ZERO) with Lagrange interpolation, determining the formula that generates the values may require a different approach, such as symbolic regression or other mathematical techniques together with random numbers and time. I am lost in numbers and hypotheses now. I need green grass.. What I understand from your post is ZERO, because I have no idea what you just said, while I could pretend that I understand, lol. Speaking of grass, yeah I haven't smoked for years.... wait are we talking about smoking them or hugging them?😂
Today I discovered something new, I just need to test a few things then I will post about it God willing. Ps, it's nothing important, just a few ideas to solve DLP, we shall see if it works or not.😉
|
🖤😏
|
|
|
bestie1549
Jr. Member
Offline
Activity: 75
Merit: 5
|
|
October 06, 2023, 05:09:20 PM |
|
Why do you use linux time? Satoshi was using windows, either vista or seven, maybe even 8, or xp. 😂 we just need to look for all the keys. Lol You know what we should do? We should use the same technic to search for rmd160 hash patterns and find collisions. 🙃
I can assume that the Satoshi was using some script (errors = ZERO) with Lagrange interpolation, determining the formula that generates the values may require a different approach, such as symbolic regression or other mathematical techniques together with random numbers and time. I am lost in numbers and hypotheses now. I need green grass.. There is nothing to worry about for now, maybe some could go back in time to see what position Satoshi was taking while throwing the dice or flipping the coins, maybe that way we can know what position we need to also take in order to be able to replicate the same method. How many minutes do you think you need to throw a dice or flip a coin to get puzzle 1 to puzzle 256? 256+254+254+253+252+251+250+249+248+247+246+245+244+243+242+241+240+239+238+237+236+235+234+233+232+231+230+229+228+227+226+225+224+223+222+221+220+219+218+217+216+215+214+213+212+211+210+209+208+207+206+205+204+203+202+201+200+199+198+197+196+195+194+193+192+191+190+189+188+187+186+185+184+183+182+181+180+179+178+177+176+175+174+173+172+171+170+169+168+167+166+165+164+163+162+161+160+159+158+157+156+155+154+153+152+151+150+149+148+147+146+145+144+143+142+141+140+139+138+137+136+135+134+133+132+131+130+129+128+127+126+125+124+123+122+121+120+119+118+117+116+115+114+113+112+111+110+109+108+107+106+105+104+103+102+101+100+99+98+97+96+95+94+93+92+91+90+89+88+87+86+85+84+83+82+81+80+79+78+77+76+75+74+73+72+71+70+69+68+67+66+65+64+63+62+61+60+59+58+57+56+55+54+53+52+51+50+49+48+47+46+45+44+43+42+41+40+39+38+37+36+35+34+33+32+31+30+29+28+27+26+25+24+23+22+21+20+19+18+17+16+15+14+13+12+11+10+9+8+7+6+5+4+3+2+1 = 32895 so you can as well agree with me that the problem here has nothing to do with a pattern or some kind of formula... we have so many ways of getting private keys without making any mistakes. ZERO FREE ERROR VERIFIED METHODS There is no assumptions here, whenever the person that solved puzzle 120 and 125 is ready he will solve puzzle 130 again. Now for puzzle 66, the highest pool scanned so far is less than 5% so don't expect any results any time soon from these pools. the key range is so vast and the computational resources is so limited We can't complain about wrong bit keys only except there's an evidence that someone successfully scan the full range for any puzzle level and the PK is not found within that range so please let's stop making assumptions and let's focus on better ways to tackle the puzzle. @Digaran mentioned something earlier and said Why do you use linux time? Satoshi was using windows, either vista or seven, maybe even 8, or xp. 😂 we just need to look for all the keys. Lol You know what we should do? We should use the same technic to search for rmd160 hash patterns and find collisions. 🙃
let us just assume that this is possible 160 bit is a whole new world and for RMD160 collision you would find so many SHA256 matching so many RMD160 you won't be limited to finding the private keys for puzzle 66 within just the 66 bit range. there would be an enormous range to cover and you would find perfectly matching private keys matching so many RMD160 hashes. but without further ado, I must say we have a great task at hand and we will stop at nothing to find an end to this puzzle
|
|
|
|
zahid888
Member
Offline
Activity: 260
Merit: 19
the right steps towerds the goal
|
|
October 06, 2023, 08:44:44 PM Last edit: October 06, 2023, 09:18:01 PM by zahid888 |
|
Important Message to the Creator: '00008657895489568954e6270000ffffffff000049924a526a523a520a52198c'Please visualize this key by visiting the following link to read the message: ( https://btckeygen.com/) Kindly fund the key if you have received my message..
|
1BGvwggxfCaHGykKrVXX7fk8GYaLQpeixA
|
|
|
nomachine
Member
Offline
Activity: 255
Merit: 12
|
|
October 06, 2023, 09:10:28 PM Last edit: October 07, 2023, 09:25:16 AM by nomachine |
|
let us just assume that this is possible
import random, sys, os, time from datetime import datetime, timedelta import secp256k1 as ice from concurrent.futures import ThreadPoolExecutor
os.system("clear") t = time.ctime() sys.stdout.write("\033[01;33m") sys.stdout.write(f"[+] {t}" + "\n") sys.stdout.flush()
# Define the check_private_key function def check_private_key(dec, add_set): while True: dec = random.randint(min_number, max_number) HASH160 = ice.privatekey_to_h160(0, True, dec).hex() sys.stdout.write("\033[01;33m") sys.stdout.write(f"\r[+] {HASH160}" + "\r") sys.stdout.flush() if HASH160 == add_set: dec_to_hex = hex(dec).split('x')[-1] HASH160_wif = ice.btc_pvk_to_wif(dec) print('\n') print(f" Key Found: |\033[32m {dec_to_hex} \033[0m") print(f" WIF |\033[32m {HASH160_wif} \033[0m") print(f" Address |\033[32m {add_set} \033[0m") with open("FOUND_66PUZZLE.txt", "a") as f: f.write("HEX: " + str(dec_to_hex) + '\n' + "Address HASH160: " + str(add_set) + '\n' + "Private Key: " + str(HASH160_wif) + '\n') f.flush() f.close() return
# Specify the start and end date and times start_datetime = datetime(2014, 1, 1, 0, 0, 0) end_datetime = datetime(2015, 1, 15, 19, 7, 14)
# Calculate the time range in seconds time_range_seconds = (end_datetime - start_datetime).total_seconds()
# Define the range of numbers and Hash 160 min_number = 36893488147419103232 max_number = 73786976294838206463 add_set = "20d45a6a762535700ce9e0b216e31994335db8a5"
# Initialize a ThreadPoolExecutor executor = ThreadPoolExecutor(max_workers=10)
current_datetime = start_datetime
while current_datetime <= end_datetime: # Format the current datetime to exclude fractional seconds timestamp = current_datetime.strftime('%Y-%m-%d %H:%M:%S')
# Convert the formatted timestamp to a Unix timestamp timestamp = int(datetime.strptime(timestamp, '%Y-%m-%d %H:%M:%S').timestamp())
# Initialize the random number generator with the timestamp random.seed(timestamp)
# Generate a random number within the specified range dec = random.randint(min_number, max_number)
# Submit the check_private_key function as a task to the ThreadPoolExecutor future = executor.submit(check_private_key, dec, add_set)
# Check if the generated private key matches the provided address if future.result(): executor.shutdown() break # Exit the loop if a match is found
# Increment the current datetime by one second for the next timestamp current_datetime += timedelta(seconds=1) why not ?
|
|
|
|
alek76
Member
Offline
Activity: 93
Merit: 16
|
|
October 06, 2023, 09:30:01 PM |
|
why not ? Without predictable SEED there will be more chances
|
|
|
|
albert0bsd
|
|
October 06, 2023, 10:05:25 PM |
|
Important Message to the Creator:
'00008657895489568954e6270000ffffffff000049924a526a523a520a52198c'
What is this? where it comes from? I checked it in some hexadecimal editor and there is no a message there: Can you add some more of context please?
|
|
|
|
zahid888
Member
Offline
Activity: 260
Merit: 19
the right steps towerds the goal
|
|
October 06, 2023, 10:39:47 PM Last edit: October 07, 2023, 04:25:40 AM by zahid888 Merited by albert0bsd (1) |
|
Important Message to the Creator:
'00008657895489568954e6270000ffffffff000049924a526a523a520a52198c'
What is this? where it comes from? I checked it in some hexadecimal editor and there is no a message there: Can you add some more of context please?
|
1BGvwggxfCaHGykKrVXX7fk8GYaLQpeixA
|
|
|
zahid888
Member
Offline
Activity: 260
Merit: 19
the right steps towerds the goal
|
|
October 06, 2023, 10:49:37 PM |
|
According to this puzzle 66 is reduce 66 times BitCrack.exe -b 128 -t 256 -p 512 -i 256.txt --keyspace f7051f0000000000:f7051fffffffffff --stride 64 [2023-09-08.05:38:07] [Info] Compression : compressed [2023-09-08.05:38:07] [Info] Seach mode : ADDRESS [2023-09-08.05:38:07] [Info] Starting at : F7051F0000000000 (64 bit) [2023-09-08.05:38:07] [Info] Ending at : F7051FFFFFFFFFFF (64 bit) [2023-09-08.05:38:07] [Info] Range : FFFFFFFFFF (40 bit) [2023-09-08.05:38:07] [Info] Stride : 64 [2023-09-08.05:38:07] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.05:38:07] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.05:38:08] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.05:38:09] [Info] Done [2023-09-08.05:38:10] [Info] Loading addresses from '256.txt' [2023-09-08.05:38:10] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.05:38:10] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: F7051F251C000000 (64 bit), C: 14.495850 %] [I: 64 (7 bit), 1] [T: 1340] [S: 879.60 MK/s] [1,593,835,520 (31 bit)] [00:00:00] [2023-09-08.05:38:11] [Info] Allocating bloom filter (0.0MB)
[2023-09-08.05:38:12] [Info] Found key for address '16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN'. Written to 'Found.txt' [2023-09-08.05:38:12] [Info] Address : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN Private key : F7051F27B09112D4 Compressed : yes Public key : 03100611C54DFEF604163B8358F7B7FAC13CE478E02CB224AE16D45526B25D9D4D
[DEV: NVIDIA GeForce R 3613/8191MB] [K: F7051FDDE0000000 (64 bit), C: 86.669922 %] [I: 64 (7 bit), 1] [T: 1339] [S: 869.86 MK/s] [9,529,458,688 (34 bit)] [00:00:09] [2023-09-08.05:38:22] [Info] Reached end of keyspace
BitCrack.exe -b 128 -t 256 -p 512 -i 256.txt --keyspace 1a838b00000000000:1a838bfffffffffff --stride 65 [2023-09-08.05:39:30] [Info] Compression : compressed [2023-09-08.05:39:30] [Info] Seach mode : ADDRESS [2023-09-08.05:39:30] [Info] Starting at : 1A838B00000000000 (65 bit) [2023-09-08.05:39:30] [Info] Ending at : 1A838BFFFFFFFFFFF (65 bit) [2023-09-08.05:39:30] [Info] Range : FFFFFFFFFFF (44 bit) [2023-09-08.05:39:30] [Info] Stride : 65 [2023-09-08.05:39:30] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.05:39:30] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.05:39:32] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.05:39:33] [Info] Done [2023-09-08.05:39:33] [Info] Loading addresses from '256.txt' [2023-09-08.05:39:33] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.05:39:33] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: 1A838B1297A000000 (65 bit), C: 7.262611 %] [I: 65 (7 bit), 1] [T: 1340] [S: 869.86 MK/s] [12,650,020,864 (34 bit)] [00:00:12] [2023-09-08.05:39:48] [Info] Allocating bloom filter (0.0MB)
[2023-09-08.05:39:48] [Info] Found key for address '18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe'. Written to 'Found.txt' [2023-09-08.05:39:48] [Info] Address : 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe Private key : 1A838B13505B26867 Compressed : yes Public key : 0230210C23B1A047BC9BDBB13448E67DEDDC108946DE6DE639BCC75D47C0216B1B
[DEV: NVIDIA GeForce R 3613/8191MB] [K: 1A838B2BE44000000 (65 bit), C: 17.145157 %] [I: 65 (7 bit), 1] [T: 1339] [S: 860.61 MK/s] [29,863,444,480 (35 bit)] [00:00:32]
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Lastt Found Address : 23d550f16301af7b0719903616e37378be5d43ab Puzzl Sarch Address : 20d45a6a762535700ce9e0b216e31994335db8a5 Prfix Match Address : ^ ^ ^ ^ ^ ^ ^ ^^^^ ^^ ^ Charr Match Totalss : 14 Bes58 Match Colorzz : 14GUCBaK3j9JGMGWZVd7curb5Y5uv2EXnJ 31fe6d97c22167688 Bes58 Match Colorzz : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 312d86d64f36e736f [2023-09-08.07:17:02] [Info] Compression : compressed [2023-09-08.07:17:02] [Info] Seach mode : ADDRESS [2023-09-08.07:17:02] [Info] Starting at : 31FE6D00000000000 (66 bit) [2023-09-08.07:17:02] [Info] Ending at : 31FE6DFFFFFFFFFFF (66 bit) [2023-09-08.07:17:02] [Info] Range : FFFFFFFFFFF (44 bit) [2023-09-08.07:17:02] [Info] Stride : 66 [2023-09-08.07:17:02] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.07:17:02] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.07:17:04] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.07:17:05] [Info] Done [2023-09-08.07:17:05] [Info] Loading addresses from '256.txt' [2023-09-08.07:17:05] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.07:17:05] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: 31FE6DFED9C000000 (66 bit), C: 99.551010 %] [I: 66 (7 bit), 1] [T: 1340] [S: 853.55 MK/s] [171,698,028,544 (38 bit)] [00:03:17] [2023-09-08.07:20:25] [Info] Reached end of keyspace
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Lastt Found Address : f0380a677a3ffac008bc403255e3e9e833770b15 Puzzl Sarch Address : 20d45a6a762535700ce9e0b216e31994335db8a5 Prfix Match Address : ^ ^^ ^ ^^ ^ ^ ^^ ^ ^^ ^ Charr Match Totalss : 14 Bes58 Match Colorzz : 1NuAJp4KKSeiGEcbfTsXk9YTFu9RTu7ytr 2e26fb283392ed368 Bes58 Match Colorzz : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 312d86d64f36e736f [2023-09-08.08:08:57] [Info] Compression : compressed [2023-09-08.08:08:57] [Info] Seach mode : ADDRESS [2023-09-08.08:08:57] [Info] Starting at : 2E26FB00000000000 (66 bit) [2023-09-08.08:08:57] [Info] Ending at : 2E26FBFFFFFFFFFFF (66 bit) [2023-09-08.08:08:57] [Info] Range : FFFFFFFFFFF (44 bit) [2023-09-08.08:08:57] [Info] Stride : 66 [2023-09-08.08:08:57] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.08:08:57] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.08:08:59] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.08:09:00] [Info] Done [2023-09-08.08:09:00] [Info] Loading addresses from '256.txt' [2023-09-08.08:09:00] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.08:09:00] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: 2E26FBFE6D6000000 (66 bit), C: 99.385643 %] [I: 66 (7 bit), 1] [T: 1340] [S: 851.82 MK/s] [171,412,815,872 (38 bit)] [00:03:18] [2023-09-08.08:12:21] [Info] Reached end of keyspace
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Lastt Found Address : 97d9536e5d2505d00ccae94c1fe3f99e6a7fdf8e Puzzl Sarch Address : 20d45a6a762535700ce9e0b216e31994335db8a5 Prfix Match Address : ^ ^ ^ ^^ ^ ^^^ ^ ^ ^^ ^^ Charr Match Totalss : 15 Bes58 Match Colorzz : 1EquP32CeUQYtxT9MKDgMCtcAFWHMDnKEg 3804efb4d8c8f7721 Bes58 Match Colorzz : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 312d86d64f36e736f [2023-09-08.08:30:44] [Info] Compression : compressed [2023-09-08.08:30:44] [Info] Seach mode : ADDRESS [2023-09-08.08:30:44] [Info] Starting at : 3804EF00000000000 (66 bit) [2023-09-08.08:30:44] [Info] Ending at : 3804EFFFFFFFFFFFF (66 bit) [2023-09-08.08:30:44] [Info] Range : FFFFFFFFFFF (44 bit) [2023-09-08.08:30:44] [Info] Stride : 66 [2023-09-08.08:30:44] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.08:30:44] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.08:30:45] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.08:30:47] [Info] Done [2023-09-08.08:30:47] [Info] Loading addresses from '256.txt' [2023-09-08.08:30:47] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.08:30:47] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: 3804EFFE274000000 (66 bit), C: 99.278641 %] [I: 66 (7 bit), 1] [T: 1340] [S: 851.82 MK/s] [171,228,266,496 (38 bit)] [00:03:17] [2023-09-08.08:34:08] [Info] Reached end of keyspace
============================= Puzzle 66 Total keys = (36,893,488,147,419,103,232) ===================================
Lastt Found Address : 24e444da7d2b980206e9e052284298c2935d5722 Puzzl Sarch Address : 20d45a6a762535700ce9e0b216e31994335db8a5 Prfix Match Address : ^ ^ ^^ ^ ^ ^^^^ ^ ^^^ Charr Match Totalss : 14 Bes58 Match Colorzz : 14N4nK3uhTFsTEHi1nrWnf5JpBjjDrSffW 38c6f1f5ff02834b0 Bes58 Match Colorzz : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 312d86d64f36e736f [2023-09-08.09:12:16] [Info] Compression : compressed [2023-09-08.09:12:16] [Info] Seach mode : ADDRESS [2023-09-08.09:12:16] [Info] Starting at : 38C6F100000000000 (66 bit) [2023-09-08.09:12:16] [Info] Ending at : 38C6F1FFFFFFFFFFF (66 bit) [2023-09-08.09:12:16] [Info] Range : FFFFFFFFFFF (44 bit) [2023-09-08.09:12:16] [Info] Stride : 66 [2023-09-08.09:12:16] [Info] Initializing NVIDIA GeForce RTX 3060 Ti [2023-09-08.09:12:16] [Info] Generating 16,777,216 starting points (640.0MB) [2023-09-08.09:12:18] [Info] 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% [2023-09-08.09:12:19] [Info] Done [2023-09-08.09:12:19] [Info] Loading addresses from '256.txt' [2023-09-08.09:12:19] [Info] 1,340 addresses loaded (0.0MB) [2023-09-08.09:12:19] [Info] Allocating bloom filter (0.0MB) [DEV: NVIDIA GeForce R 3613/8191MB] [K: 38C6F1FEA06000000 (66 bit), C: 99.463463 %] [I: 66 (7 bit), 1] [T: 1340] [S: 851.82 MK/s] [171,547,033,600 (38 bit)] [00:03:18] [2023-09-08.09:15:40] [Info] Reached end of keyspace Another long post
|
1BGvwggxfCaHGykKrVXX7fk8GYaLQpeixA
|
|
|
digaran
Copper Member
Hero Member
Offline
Activity: 1330
Merit: 899
🖤😏
|
|
October 07, 2023, 06:01:54 AM |
|
Important message to the author : since we are "buddies" Visualize them in order, 0000380023a22094e68807800000e91c8910e9108f70e0000000000000000000 0000f7808480e79c861c851c800000000820145023880000742627242524252c 104028a0451082080080789c0b946a947b940000e6608440e45a8ddae0120013
When you are done, kindly visualize these on a king size bed.🙈 0000823c4424293c113001280104010000030002e00e82f09a908a90fa900000 You deserve them.😉
@zahid888, what is base58 match colorzz? Which tool has this feature? And finally how much is enough for you to kindly pull out of base58 match finding? Lol. I love it how you do your things without explaining anything.
I just found a new hobby, using btckeygen.com as a messenger medium.😂
|
🖤😏
|
|
|
nomachine
Member
Offline
Activity: 255
Merit: 12
|
|
October 07, 2023, 09:39:50 AM |
|
I just found a new hobby, using btckeygen.com as a messenger medium.😂
I didn't move away much intellectually from this hobby either. In terms of solving the Puzzle 66. I can print the solved ones and joke here. But that won't help us. 😂
|
|
|
|
digaran
Copper Member
Hero Member
Offline
Activity: 1330
Merit: 899
🖤😏
|
|
October 07, 2023, 11:04:14 AM Last edit: October 21, 2023, 06:33:49 PM by digaran |
|
Without a joke, I might have found a definitive solution to solve DLP, I'm not sure how I can implement an algorithm fast and precise to solve a key, but the equation in my head can solve DLP.
@Satoshi/ author/ designer of this challenge, I am willing to work for 1 years exclusively on this particular subject for a salary of $200m, which I would take $20m upfront and if after 1 year we reached the final solution I will take the remaining $180m, and if we couldn't find that solution, I keep the 20m.
I'm not 100% sure, I only discovered this new equation yesterday, but since all my calculations happen in my head, when I think about it I see the solution, I just need someone who I can trust and a professional programmer.
I will buy an apartment in another city to be alone and undistracted, then I will share the address and my ID. Obviously I accept no other sponsor/offer. If you are interested send dust to my digaran address with the same address you charged these puzzles, I will then encrypt my dedicated email address with your public key and post it here.
Disclaimer, I do not guarantee any satisfactorily results, this is just my term of business. Please note, I will continue working on this regardless, and God willing when I manage to solve a puzzle key, I will not share the method.
My dig add is on profile. Fun to know : There is a lot of controversy around my reputation, at one point in time, I "suggested" to charge $50 "bucks" from each garbage poster for the cost of their wrong doings. on behalf of forum, not for myself of course, now after 5 years, I'm asking for $200m from the #1 man of Bitcoin. Who could have thought that, right? Lol.
Anyways, I will do my best to keep a decentralized system such as Bitcoin alive and safe, for a better world, even if I'm only 1 man, it still counts.😉
|
🖤😏
|
|
|
citb0in
|
|
October 07, 2023, 11:21:37 AM |
|
Without a joke, I might have found a definitive solution to solve DLP, I'm not sure how I can implement an algorithm fast and precise to solve a key, but the equation in my head can solve DLP.
@Satoshi/ author/ designer of this challenge, I am willing to work for 3 years exclusively on this particular subject for a salary of $50m, which I would take $3m upfront and if after 3 years we reached the final solution I will take the remaining $47m, and if we couldn't find that solution, I keep the 3m.
I'm not 100% sure, I only discovered this new equation yesterday, but since all my calculations happen in my head, when I think about it I see the solution, I just need someone who I can trust and a professional programmer.
I will buy an apartment in another city to be alone and undistracted, then I will share the address and my ID. Obviously I accept no other sponsor/offer. If you are interested send dust to my digaran address with the same address you charged these puzzles, I will then encrypt my dedicated email address with your public key and post it here.
Disclaimer, I do not guarantee any satisfactorily results, this is just my term of business. Please note, I will continue working on this regardless, and God willing when I manage to solve a puzzle key, I will not share the method.
My dig add is on profile. Fun to know : There is a lot of controversy around my reputation, at one point in time, I "suggested" to charge $50 "bucks" from each garbage poster for the cost of their wrong doings. on behalf of forum, not for myself of course, now after 5 years, I'm asking for $50m from the #1 man of Bitcoin. Who could have thought that, right? Lol.
Anyways, I will do my best to keep a decentralized system such as Bitcoin alive and safe, for a better world, even if I'm only 1 man, it still counts.😉
what a pathetic call, rarely laughed so, just ridiculous - you made my day
|
. .HUGE. | | | | | | █▀▀▀▀ █ █ █ █ █ █ █ █ █ █ █ █▄▄▄▄ | ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ . CASINO & SPORTSBOOK ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄ | ▀▀▀▀█ █ █ █ █ █ █ █ █ █ █ █ ▄▄▄▄█ | | |
|
|
|
|