CAP Theorem and Neurochain

  • Alchemy
    Participant
    # 1 year, 7 months ago

    “In theoretical computer science, the CAP theorem, also named Brewer’s theorem after computer scientist Eric Brewer, states that it is impossible for a distributed data store to simultaneously provide more than two out of the following three guarantees:[1][2][3]

    Consistency: Every read receives the most recent write or an error

    Availability: Every request receives a (non-error) response – without guarantee that it contains the most recent write

    Partition tolerance: The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes”

    My Question is what two does Neurochain choose?

You must be logged in to reply to this topic.