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

Also if you look at it in terms of the CAP Theorem:

Consistency (every read receives the most recent write or an error): Not True for block chains. All reads are dirty. The further back in time you go the higher the probability the read isn't dirty.

Availability (every request receives a response, without guarantee that it contains the most recent version of the information): 100% true.

Partition tolerance (the system continues to operate despite arbitrary partitioning due to network failures): Yes the system will continue to function. But you can suffer data loss when the partition is healed.



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

Search: