{
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Independently reading each key does not implement an atomic multi-key scan. One-shot transactions instead go through the leader, whose quorum includes itself.",
      "citationIds": [
        "nsdi25"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "slug": "pineapple",
  "term": "Pineapple",
  "aliases": [
    "Pineapple replication"
  ],
  "definition": "Pineapple is a replication protocol that combines Multi-Paxos with atomic shared registers to support linearizable reads, writes and one-shot transactions.",
  "note": "Any node can coordinate single-key reads and writes. The leader orders RMWs and multi-key operations. Pstamps combine an ABD tag with a Multi-Paxos slot; the leader first queries a quorum because an earlier register write may have bypassed it. [nsdi25]\n\nNon-blocking execution means execution can follow an ordering decision without a separate dependency wait. It does not eliminate network waits or leader-election delays. Partial synchrony is still needed for leader progress. [nsdi25]\n\nLeader changes require ballot-aware stamps and read retry rules from Appendix A.2. A read completes only with a quorum agreeing on its leader and value-pstamp pair; the stable-leader pseudocode alone omits this safeguard. [nsdi25]",
  "related": [
    "gryff",
    "linearizability",
    "compare-and-swap"
  ],
  "citations": [
    {
      "id": "nsdi25",
      "title": "Bantikyan et al. Pineapple: Unifying Multi-Paxos and Atomic Shared Registers. NSDI 2025, pp. 759-778; sections 2-3 and Appendix A.",
      "url": "https://www.usenix.org/system/files/nsdi25-bantikyan.pdf",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Protocol interpretation, not an executed cluster benchmark. Research classification does not imply that stock etcd uses this protocol."
  ]
}
