Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

What log operators should be doing, and I am surprised they are not, is verifying new additions to their log on a separate system or systems before publishing them. In the worst case scenario they might hit a hardware bug that always returns the wrong answer for a particular combination of arguments to an instruction in all processors within an architecture, so verification should happen on multiple architectures to reduce that possibility. If incorrect additions are detected they can be deleted without publishing and the correction addition can be recreated, verified, and published.

ECC RAM would help somewhat, but independent verification is orders of magnitude better because it's a cryptographic protocol and a reliable way of generating broken log entries that validated on another system would constitute a reliable way to generate SHA2 collisions.



This is a rare example of a problem that a (closed-membership, permissioned) blockchain is a good fit for. CT logs are already merkle trees. If a consensus component were added, entries would only be valid if the proposed new entry made sense to all parties involved.


Blockchains are fork-tolerant whereas append-only SCT logs are not, intentionally so.


You're likely referring to specific implementations of blockchains.

There is no requirement that the consensus mechanism used permit forking in a blockchain.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: