4 ms·
I’m very confused by why PoH is being presented as novel, maybe I’m misunderstanding? As I see it, PoW and PoH both appear to be solving the same problem of est
by opheliate 5y ago
I’m very confused by why PoH is being presented as novel, maybe I’m misunderstanding? As I see it, PoW and PoH both appear to be solving the same problem of establishing a sequential order of events within a distributed system, except PoH doesn’t present a mechanism for trusting the sequence.
In PoW, each event that is to be published must be accompanied by the hash of the previous event in the sequence. In PoH, the same is true. In PoW, you trust that the chain of events is correct, because work has to be put in to generate each hash, as there are conditions on the digest prefix which determine the difficulty. With PoH… Um… I’m sure I must have missed something, but there’s no inherent reason to trust any chain. It’s just a sequence of hashes, with no difficulty requirement. The actual trust in a certain chain comes from an unrelated proof of stake system, I guess. Very weird, I’d appreciate if anyone could help me get some clarity on this.
- deleted 5y ago[deleted]
- TimJRobinson 5y agoAs far as I can tell PoH is done by hashing the same value over and over (where each hash is hashing the last hash), to prove you've done some amount of work on that block. So blocks contain both the hash of the previous block and a PoH hash which is showing you've iterated SHA256 n times. This way you can't spam the network with blocks. It seems similar to how NANO works. I still don't know why it's called proof of history.