Pages:
Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 50. (Read 245170 times)

member
Activity: 348
Merit: 34
Who buy me coffee for 3 months, I will reward with coffee, lunch, dinner for 7 days in Dubai  Cheesy
member
Activity: 165
Merit: 26
....a program that can't solve puzzle 130.  Embarrassed

So, think about it again. It’s not even intended for that. You can reduce the range to a smaller one. It’s written in bold: 'This program is limited to a 125-bit interval search.' Have you ever wondered why it's exactly 125? Why not 120, 128, or 135?   Grin

It's called bad coding / written in a hurry. I think 99% of everyone that used his application are not aware of all the bugs and general mess of the source code. A few here are defending it in godly ways as if JLP is some sort of a genius who discovered fire or something. In reality his code would not pass a first filter of QA.
member
Activity: 503
Merit: 38
....a program that can't solve puzzle 130.  Embarrassed

So, think about it again. It’s not even intended for that. You can reduce the range to a smaller one. It’s written in bold: 'This program is limited to a 125-bit interval search.' Have you ever wondered why it's exactly 125? Why not 120, 128, or 135?   Grin
jr. member
Activity: 42
Merit: 0
Well, that's exactly the hack I'm talking about. We think he gave us the sourcecode. And in fact, the real deal was never made public. And why would he? I also wouldn't post the code that solves puzzle 130. Only the code that gives false hope. Like a hook to catch fools.. This is sad but true. Grin


I know I'm an ass. But I didn't know I was that big. For two years I've been messing around with a program that can't solve puzzle 130.  Embarrassed

Don't get angry and don't see it as a loss of profit or worse a loss, because that's not what it is. You did NOT loose anything worth to mention


Exactly. Just time for nonsense.
member
Activity: 503
Merit: 38
Thanks to french idiot JLP for giving the sourcecode for free to all them.

Well, that's exactly the hack I'm talking about. We think he gave us the sourcecode. And in fact, the real deal was never made public. And why would he? I also wouldn't post the code that solves puzzle 130. Only the code that gives false hope. Like a hook to catch fools.. This is sad but true. Grin
hero member
Activity: 630
Merit: 731
Bitcoin g33k
In the meantime, an infinite number of theories have been put forward as to who or how the coins were withdrawn. They are all just anyone's pipe dreams, based on absolutely no facts or evidence. Pointless babble, myths, stories, blah blah blah

it was NOT J.L.-P. who solved those puzzles

How do you know it was NOT JLP ? or maybe it's you?  Tongue

It makes absolutely no difference who has emptied the contents of these addresses. The fact is that someone with knowledge of the private key started the transaction or someone else created a new transaction based on the release of the public key. Whether or not the first or second or however many others in line stole the coins, is useless to argue about, it's up to you how to interprete. I deliberately don't say “prize money”, because that's not what it is, although many of you think it is. Otherwise, everyone would be a thief who takes coins from these addresses because they don't belong to them. People are greedy and envious, led by envy and jealousy.

Don't get angry and don't see it as a loss of profit or worse a loss, because that's not what it is. You did NOT loose anything worth to mention
jr. member
Activity: 47
Merit: 12
gmaxwell creator of 1000 BTC puzzl + Pinapple fund
Current solver(s) just don't care about this thread. They have many, many GPUs and just take the BTC as a little bonus. Maybe they are criminal hackers.
Thanks to french idiot JLP for giving the sourcecode for free to all them.

Might be some chinese or north korean guys. Some place where energy costs nothing or maybe every GPU is hacked.

It is very unlikely that there is a new algorithm to solve the ECDLP. Else we might expect more frequent solves and maybe a new scientific paper.
It is game over for normal guys if you not find a real new approach to cracking the ECDLP.

Zielar had access to many GPUs but I doubt he had access to that many. But he might have solved it somehow anyway. He is a very greedy/selfish person who never gave anything back to JLP, brichard19 or others.
member
Activity: 348
Merit: 34
Maybe you all remember
When puzzle 64 and 120 found right after puzzle listed prices fill up with high amount
6.6 from 0.6
13 from 1.3

Do you all think maybe this time puzzle 66 and 130 found same old 64 and 120
And price may be goesmore up like

Example
67 from 6.7
135 from 13.5

Wait and see or ask puzzle Creator for more updates
 Grin
member
Activity: 503
Merit: 38
it was NOT J.L.-P. who solved those puzzles

How do you know it was NOT JLP ? or maybe it's you?  Tongue

I know for sure who it is. Digaran. As soon as someone is gone for a long time, he is the winner.  Grin
jr. member
Activity: 42
Merit: 0
it was NOT J.L.-P. who solved those puzzles

How do you know it was NOT JLP ? or maybe it's you?  Tongue
hero member
Activity: 630
Merit: 731
Bitcoin g33k
it was NOT J.L.-P. who solved those puzzles
newbie
Activity: 27
Merit: 4
Damn!!! whoever the solver of 130 bit is. is genius..!!!

Of course, that is JLP himself, but apparently not with the GitHub version of Kangaroo 2.2.
This is version 8.0 at least.  Grin


How do you know it is JLP ?

Because when it comes to solving 130-bit, even the Kangaroo needs a turbo boost... and JLP's got the keys to the garage!  Tongue

Then why hast he shared the private key yet ? i mean he is a great contributor if he solved it im pretty sure he would have shared the found private key right ?
 
jr. member
Activity: 42
Merit: 0
Damn!!! whoever the solver of 130 bit is. is genius..!!!

Of course, that is JLP himself, but apparently not with the GitHub version of Kangaroo 2.2.
This is version 8.0 at least.  Grin


How do you know it is JLP ?

Because when it comes to solving 130-bit, even the Kangaroo needs a turbo boost... and JLP's got the keys to the garage!  Tongue
newbie
Activity: 27
Merit: 4
Damn!!! whoever the solver of 130 bit is. is genius..!!!

Of course, that is JLP himself, but apparently not with the GitHub version of Kangaroo 2.2.
This is version 8.0 at least.  Grin


How do you know it is JLP ?
member
Activity: 503
Merit: 38
Damn!!! whoever the solver of 130 bit is. is genius..!!!

Of course, that is JLP himself, but apparently not with the GitHub version of Kangaroo 2.2.
This is version 8.0 at least.  Grin
newbie
Activity: 18
Merit: 0
@Tepan

Can you explain a little bit more your formula ?


First thing first it's funny someone really spend their time to this like Mr.AKITO.

I want to explain but I'm afraid of appearing smarter than my friends who are great at spending their time creating and ensuring programs like search using the hash of public key 160 and even compressed public keys, will feel offensive to them, this is just my thoughts for 2 years paying more attention to this forum and puzzle.

but okay if you want to.


old_key = 4563 -- was from "95823/21" 21 is divided by count the 95823 into 2097151, have 2 option 22 or 21, 21 is precisely with target.
old_range = (65536, 131071)
new_range = (1048576, 2097151)

result :

[1245699, 1660932, 2076165, 1400841, 1816074, 1140750, 1555983, 1971216, 1295892, 1711125, 1451034, 1866267, 1190943, 1606176, 2021409, 1346085, 1761318, 1085994, 1501227, 1916460, 1241136, 1656369, 2071602, 1396278, 1811511, 1136187, 1551420, 1966653, 1291329, 1706562, 1446471, 1861704, 1186380, 1601613, 2016846, 1341522, 1756755, 1081431, 1496664, 1911897, 1236573, 1651806, 2067039, 1391715, 1806948, 1131624, 1546857, 1962090, 1286766, 1701999, 1441908, 1857141, 1181817, 1597050, 2012283, 1336959, 1752192, 1076868, 1492101, 1907334, 1232010, 1647243, 2062476, 1387152, 1802385, 1127061, 1542294, 1957527, 1282203, 1697436, 1437345, 1852578, 1177254, 1592487, 2007720, 1332396, 1747629, 1072305, 1487538, 1902771, 1227447, 1642680, 2057913, 1382589, 1797822, 1122498, 1537731, 1952964, 1277640, 1692873, 1432782, 1848015, 1172691, 1587924, 2003157, 1327833, 1743066, 1067742, 1482975, 1898208, 1222884, 1638117, 2053350, 1378026, 1793259, 1117935, 1533168, 1948401, 1273077, 1688310, 1428219, 1843452, 1168128, 1583361, 1998594, 1323270, 1738503, 1063179, 1478412, 1893645, 1218321, 1633554, 2048787, 1373463, 1788696, 1113372, 1528605, 1943838, 1268514, 1683747, 1423656, 1838889, 1163565, 1578798, 1994031, 1318707, 1733940, 1058616, 1473849, 1889082, 1213758, 1628991, 2044224, 1368900, 1784133, 1108809, 1524042, 1939275, 1263951, 1679184, 2094417, 1419093, 1834326, 1159002, 1574235, 1989468, 1314144, 1729377, 1054053, 1469286, 1884519, 1209195, 1624428, 2039661, 1364337, 1779570, 1104246, 1519479, 1934712, 1259388, 1674621, 2089854, 1414530, 1829763, 1154439, 1569672, 1984905, 1309581, 1724814, 1049490, 1464723, 1879956, 1204632, 1619865, 2035098, 1359774, 1775007, 1099683, 1514916, 1930149, 1254825, 1670058, 2085291, 1409967, 1825200, 1149876, 1565109, 1980342, 1305018, 1720251, 1460160, 1875393, 1200069, 1615302, 2030535, 1355211, 1770444, 1095120, 1510353, 1925586, 1250262, 1665495, 2080728, 1405404, 1820637, 1145313, 1560546, 1975779, 1300455, 1715688, 1455597, 1870830, 1195506, 1610739, 2025972, 1350648, 1765881, 2097151, 1090557, 1505790, 1921023]

i mark that with red color, just because as you can see, it's nearly with real decimal value to search, i test it with 10-20 puzzle, there is always a very close result, but need to search and wait for time.

for someone if ask how you can determine the first search is 1811764
in real condition with my codes is marked into hex, and groupped for search ranges, so it's from small value to larger value, and sequence ranges but random search on ranges.

searching puzzle #21 key 1BA534 > 1811764.

[...snip...]


@Tepan I still dont understand the sequence of values. Are just random values? Or are they following a pattern using the number old_key = 4563 ?
Also you select the red number based on the private key of the puzzle 21 so... what if you dont know it ?
I'm just trying to make sense to your message and trying to replicate to other puzzles
newbie
Activity: 27
Merit: 4
Damn!!! whoever the solver of 130 bit is. is genius..!!! damn i was on it for 3 years i thought i was almost there.. i know i would get a lot of hate for what im about top tell but.. i was working so hard on this so i could give my dad a better care for my father coz he's terminally ill. now the difficulty just got harder Smiley and got to redo the math from scratch.. good luck for the solver. just sad i couldn't make it.
member
Activity: 165
Merit: 26
Shouldn't we be looking at FPGAs by now?

We should. But it should be one that can compete with the 20.000+ number of cores in a high-end GPU.

If it only has a few number of parallel units they should be so freaking fast that they do more total jumps/s than what the equivalent GPU (with [tens of] thousands of cores) do. Otherwise it would overall be slower.

To get a rough idea if it's worth it I would first start with the field multiplication. I'm not sure if Bernstein's 256-bit multiplier using logic gates is the best one yet (or even if it's public) but you can take it as a reference. Then we have on average six 256-bit multiplications per jump per kangaroo. Depending on FPGA specs you can compare the raw performance against what a GPU can perform (for example a RTX 4090 can do around 90 billion 256-bit field mul/s at the very low level, before we can talk about point addition and so on)

You can find very recent (2022) HW designs of fast XGCD (for mod inv) which is the bottleneck when running Kangaroo on a GPU (around 50% of the running time is spent just by field inversion, even when doing just a single inversion for a batch of thousands of kangaroos / jump).

If the inversion is in HW than a FPGA might get overall faster than a GPU, or it might not, dependng on the other factors.
member
Activity: 503
Merit: 38
Shouldn't we be looking at FPGAs by now?

Or consider leveraging a RISC-V CPU for this.
newbie
Activity: 18
Merit: 0
Someone has to sit down and write a completely new kangaroo.

Shouldn't we be looking at FPGAs by now?

I'm actually working on a little project to get me started with Verilog.

It is a simple xpoint-only bruteforcer for now. The design works fine, but I couldn't fit it on the target chip yet.

The main goal is to get to the level where I can create a HDL Kangaroo implementation as there are none out there.



I agree with you. I think the future is the FPGA, it is the clear evolution path.
Pages:
Jump to: