Similar idea with boring tech ;)
Show HN: Peer-to-peer mini r/place with Proof of Work
21–30 of 50 posts
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#22The one problem with this approach is that it gives one guy with a big GPU (or even an ASIC) a huge advantage over "casual" users (e.g. mobile web). You could perhaps make the gap smaller by using one of the "ASIC-resistant" mining algorithms? By the way, for making more efficient mining algorithms, it would be nicer if the nonce is on the end of the message, aligned to a sha256 block. As is, it encourages someone to…
Sorry Retr0id I took your spot ;) It's a fun little game, turbidimeter! Request: it would be nice if the page showed the history for the best winning texts and their hashes. I don't know what the hash or string was before Retr0id overwrote it with his winning entry. For the curious:
0000000000f2b100124723856e7b19f92db367453f8939b3b3aace655a81d488 was the hash of the winning text "Retr0id was here" as of ~30 minutes ago
0000000000d98482cd72551c39c0233243a4878672039348417aaf69143d8d65 is now mine for "m at zorinaq dot com wins" this took about 2**40 SHA256 operations to find.
I used to have a GPU farm for Bitcoin mining back in the day... which would have been perfect compute hardware for this game, but I am ashamed to admit I do not have any GPUs anymore. So I had to fall back to writing a quick multithreaded Python script and ran it on 3 machines (22 CPU cores total) while I was having dinner.
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#23The one problem with this approach is that it gives one guy with a big GPU (or even an ASIC) a huge advantage over "casual" users (e.g. mobile web). You could perhaps make the gap smaller by using one of the "ASIC-resistant" mining algorithms? By the way, for making more efficient mining algorithms, it would be nicer if the nonce is on the end of the message, aligned to a sha256 block. As is, it encourages someone to…
Sorry Retr0id I took your spot ;) It's a fun little game, turbidimeter! Request: it would be nice if the page showed the history for the best winning texts and their hashes. I don't know what the hash or string was before Retr0id overwrote it with his winning entry. For the curious: 0000000000f2b100124723856e7b19f92db367453f8939b3b3aace655a81d488 was the hash of the winning text "Retr0id was here" as of ~30 minutes a…
I'm back :P
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#24Earlier quoted context omitted.
Sorry Retr0id I took your spot ;) It's a fun little game, turbidimeter! Request: it would be nice if the page showed the history for the best winning texts and their hashes. I don't know what the hash or string was before Retr0id overwrote it with his winning entry. For the curious: 0000000000f2b100124723856e7b19f92db367453f8939b3b3aace655a81d488 was the hash of the winning text "Retr0id was here" as of ~30 minutes a…
I'm back :P
Nice ;)
00000000001a22ae7ad6ee672633fa5504e8f7be8d0252ba5a5906e20408ccec "retr0id was here"
Yeah I am not going to attempt to beat that without a GPU! Man, I miss my time doing GPU coding, writing miners, etc
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#25If you guys like solving brute forcing games, you can solve this series of puzzles to win prizes totaling about 970 BTC (45 million USD): https://bitcointalk.org/index.php?topic=5218972.0
For example the next unsolved puzzle in the series is #66 which is a Bitcoin private key with 66 unknown random bits. If you crack it you win 6.6 BTC (300 000 USD). It goes all the way to #160 which has a 16.0 BTC prize.
Puzzle numbers multiple of 5 (#65 #70 #75 etc) have had their public key published in a transaction on the blockchain, so it's possible to take some shortcuts such as the Pollard's kangaroo ECDLP solver. The next unsolved "multiple of 5" is #130 with a 13.0 BTC prize (600 000 USD). You need approximately 2^65 operations to solve it.
The most recent win was puzzle #125 solved on 2023-07-09 by an anonymous person who collected the 12.5 BTC. One can see their tx here: https://www.blockchain.com/explorer/addresses/btc/1PXAyUB8Zo... They probably used 200-300 GPUs for about 2-4 months to crack it, based on the known performance of existing ECDLP solvers such as https://github.com/JeanLucPons/Kangaroo
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#26I did my own r/place too, but with React and Express, here is a demo: https://cubes.fly.dev/
Of course is opensource: https://github.com/skorotkiewicz/Cubes
It's a websocket, but easily its possible to make this with p2p.
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#27If you guys like solving brute forcing games, you can solve this series of puzzles to win prizes totaling about 970 BTC (45 million USD): https://bitcointalk.org/index.php?topic=5218972.0 For example the next unsolved puzzle in the series is #66 which is a Bitcoin private key with 66 unknown random bits. If you crack it you win 6.6 BTC (300 000 USD). It goes all the way to #160 which has a 16.0 BTC prize. Puzzle numb…
does anyone know about how much money was spent on compute to solve puzzle #125? I am curious if they made a profit.
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#28How do different peers discover each other? And is all the data lost once no one is visiting the site?
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#29Well this site got me to write my first ever C program to generate low hashes, and by the time I get it working, I go back to the site to learn that the lowest hash now starts with 10 zeros. (!) I don't think my lowly little Mac CPU will ever compete with that. But hey. First C program.
There is less room for new users, then.
maybe every new user should be given a time based vote mechanism.
maybe every "wallet" should be given one vote.
Sounds like a UBI scheme in the making.
Re: Show HN: Peer-to-peer mini r/place with Proof of Work
#30OOOh, climate destroying shitcoin-inspired /r/place ?
I'll just take https://paint.adminforge.de/?lang=en as FLOSS and not climate destroying thankyouverymuch.