News for hackers. Stuff that matters.
Re:Gridcoin: An open-source cryptocurrency that rewards volu... by DavidHilbert on Tuesday February 23, 2021 @12:15PM (#26239864)
> The solution to a puzzle is meaningless if the same solution can be shown as the result of two different inputs.

This isn't true. There are an infinite number of inputs that result in the same solution for bitcoin (or any hash)

Re:Gridcoin: An open-source cryptocurrency that rewards volu... by Moodles on Tuesday February 23, 2021 @01:24PM (#26240749)
Right, but that's a little unfair? SHA-256 is literally a function designed to make it impossible to find such collisions. BIONIC problems aren't designed with that in mind.
Re:Gridcoin: An open-source cryptocurrency that rewards volu... by jl2718 on Tuesday February 23, 2021 @12:27PM (#26240031)
Okay let’s see an example. ;)
Re:Gridcoin: An open-source cryptocurrency that rewards volu... by powerbutton65 on Tuesday February 23, 2021 @12:40PM (#26240218)
Like it or not they are technically correct. SHA-256 is a one way compression and furthermore the PoW for bitcoin doesn't require a match for the entire hash.

There's loads of examples of this in the bitcoin network whenever there's been a fork and eventually orphaned blocks.

Re:Gridcoin: An open-source cryptocurrency that rewards volu... by jl2718 on Tuesday February 23, 2021 @12:55PM (#26240385)
Those are different solutions to the puzzle. Nobody has ever published a sha-256 hash collision. It has happened once with sha-1.
Re:Gridcoin: An open-source cryptocurrency that rewards volu... by neolefty on Tuesday February 23, 2021 @01:34PM (#26240921)
The principles are the same — it's just harder to find collisions for larger digest sizes. (Although bugs in sha-1 add an interesting wrinkle to the discussion.)

In fact one could argue that encryption without requiring infinite bandwidth or computation requires finite difficulty in math puzzles.

So our current approach to encryption is fundamentally vulnerable to (vastly) more powerful adversary computers. Only things like quantum cryptography break free of that limitation, by changing the ground rules.

Re:Gridcoin: An open-source cryptocurrency that rewards volu... by jl2718 on Tuesday February 23, 2021 @01:56PM (#26241258)
Algorithmic cryptography depends on a computation time approaching infinity for perfect security. Quantum cryptography depends on a data transmission rate approaching zero for perfect security. Either way, perfect security takes forever.