{
  "slug": "hermes-replication",
  "term": "Hermes replication",
  "aliases": [
    "Hermes protocol",
    "HermesKV"
  ],
  "definition": "Hermes is a replication protocol that combines invalidations and per-key logical timestamps to provide linearizable operations on in-memory data.",
  "note": "In the lease-based design, local reads require a Valid key and an operational replica with a membership lease. An invalid key stalls reads. Any replica can coordinate a write, but it needs acknowledgements from every other member of the current live group, not just a majority. [project]\n\nIn the base failure-free path, the coordinator can reply after one round trip; validation messages still follow. Invalidation already carries the new value and timestamp. A blocked replica can replay that value with the original timestamp, preserving the write order. [paper]\n\nFailure handling: a missing acknowledgement is not permission to remove a replica locally. Reliable membership reconfiguration follows lease expiry; minority partitions stop serving requests. Ordinary writes avoid conflict aborts, but read-modify-write operations can abort. [paper]\n\nTiming scope: one round trip is measured from a replica, not an external client. The clock-free variant waits for majority-backed membership confirmation before returning speculative reads. [paper]\n\nArtifact boundary: the published implementation uses an RDMA cluster. Its protocol-action diagram includes optimizations beyond the paper, including starting writes from Invalid state; do not treat the diagram as the base state machine. [artifact] [artifact-notes]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Single-key linearizability does not supply multi-key transactions or disk persistence; the stated failure model is non-Byzantine crash-stop and network faults.",
      "citationIds": [
        "paper"
      ]
    }
  ],
  "related": [
    "craq",
    "linearizability",
    "quorum-lease"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "citations": [
    {
      "id": "paper",
      "title": "Katsarakis et al. Hermes: a Fast, Fault-Tolerant and Linearizable Replication Protocol. ASPLOS 2020, sections 2.4, 3, 5 and 8.",
      "url": "https://homepages.inf.ed.ac.uk/bgrot/pubs/HERMES_ASPLOS20.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "project",
      "title": "Hermes research project: protocol properties and read authority",
      "url": "https://hermes-protocol.com/",
      "accessed": "2026-11-16"
    },
    {
      "id": "artifact",
      "title": "Hermes artifact README, revision 949229c23881: implementation and hardware requirements",
      "url": "https://github.com/ease-lab/Hermes/blob/949229c238818509aed1435c46f9a76819ce2818/README.md",
      "accessed": "2026-11-16"
    },
    {
      "id": "artifact-notes",
      "title": "Hermes formal-specification README, revision 949229c23881: diagram optimizations",
      "url": "https://github.com/ease-lab/Hermes/blob/949229c238818509aed1435c46f9a76819ce2818/tla/README.md",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Source synthesis of the ASPLOS 2020 paper and pinned research artifact; no native RDMA experiment or model-checker run was performed.",
    "The paper's benchmark uses in-memory key-value stores and protocol-specific configurations; its throughput is not evidence of persistent-storage performance. [paper]"
  ]
}
