Quote from: nomachine on Today at 04:34:00 PM

Quote from: digaran on Today at 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. 🙃

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.. Grin

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 public 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 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

Quote from: digaran on Today at 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. 🙃

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