tg-me.com/librecryptography/303
Last Update:
Hash Chains
I was wrong about my initial impression but also possibly on to something as it pertains to the hash tree that could be created with Blake.
Hash / Merkle Tree Concept
Rather than just creating an appended list (sort of like blockchain) and then adding an additional operation that merely hashes the last input, it feels like it would be prudent to have all of the values hashed together in some capacity.
So that means:
1) H = x
2) H(x)
3) H(H(X))
4) H(H(H(X)))
There's something that's missing in this construction.
Only way that this could work is if the generator of the hash chain kept at least a few values secret.
But it is impossible for this to be done in a way where all of those values are kept secret and this be seen as externally valid.
The only other way is to ensure that all of the values are public. But if you must do that then you need to devise another method that will require people to remain honest bc you've trapped off their avenues for "cheating".
This is why the write-up on the way that time is calculated on the blockchain is extremely fucking important - it is an objective source of randomness that keeps everyone honest if it can be adhered to.
The idea that I had about the UNIX time tracking was interesting, but ultimately one critical underpinning here (hmm...)
BY LibreCryptography
Warning: Undefined variable $i in /var/www/tg-me/post.php on line 283
Share with your friend now:
tg-me.com/librecryptography/303