Mechanical Hashing Concepts

I was thinking, how about explaining crypto to non-tech folks using mechanical hash functions? Imagine a device where you can set the Initialization Vector for SHA-256 and input any 512-bit message to see the result. That could make understanding mining way easier. If someone builds it, I’d buy it with Bitcoin.

What if we had a device with an LED screen that does just one round of hashing? You could customize how the states combine, like using XOR or rotate operations. It’d be like a mini computer with buttons for inputting random strings and starting the hash. Way easier than a full mechanical setup.

How about using chaotic fluids for hashing? Picture stirring a muddy fluid, like a microfluidic device, to hash data. The flow dynamics would encode info similar to SHA-256. Sounds wild but interesting.

I’m not sure about a mechanical approach but if you wanna try, paper and pencil work too. I found a guide that explains how to mine using just those.

I did it by hand too, no need to convert hex to binary. Just some rotations. I know it's possible mechanically. You can create tables for addition and other operations. Took me a few hours, but I got it down.

SHA-256 can't be reversed just by cranking it backward.

Actually, it can if you have all the context. You can compute rounds in reverse if you have all the needed data. I can show how it works in another thread.

Not so sure. SHA-256 uses modular math which isn’t reversible. Plus, the operations like XOR and AND are probably irreversible too.

I don’t get it, but SHA-256 is complex. A mechanical device reversing it? Not likely. Unless, like, it could store tons of data.

Had another thought on that SHA-256 device. Why not build a web service instead? Design the rounds like state machines. People could play with hash functions without needing hardware.

Modulo is reversible with context. For instance, addition modulo 2^32 is reversible like a clock. You can subtract to get back. Same with XOR and rotation.

But that’s not real reversing. You don’t have both original inputs for hash digests.

Exactly. Just need to start from the Initialization Vector and the w-values. Rotate mechanically like an old calculator and compute rounds to get the final hash.

You’re right. If you have just one 512-bit chunk, reversing might not be necessary since the w-values hold the original message. Cranking backwards gets you the same hash values already in the algorithm.

Let’s focus on making a device that handles one chunk first, then we can expand from there. Hashing a block header is a good start.

A device like that could help generate private keys mechanically. It’s safer than using a computer after rolling dice.

If you can add and double points, you can deal with ECDSA. No need for fancy machines; even a large device could work for generating addresses.

I’m picturing something like the Turing machines from WWII. Are we talking about devices like that?

It should work without any external power. If the power goes out, it should still function. Chemical hashing is interesting, but simple mechanical hashing seems easier to operate.

Using marbles and gravity sounds cool but it has to be accurate all the time. Errors could mess up the Bitcoin address computation.