bounded-counter · also Bounded Counter CRDT

Bounded counter

A bounded counter is a replicated counter that distributes update rights to preserve a numeric bound.

Local rights: Decrements consume rights; transfers move them between replicas. Monotonically increasing accounting entries merge by componentwise maximum, so merging the same state twice does not duplicate rights. [1]

Execution: Operations on each local counter must be serializable. If local rights are insufficient, a request can fail although rights remain elsewhere. Transfers across a partition cannot complete until communication permits. [1]

Relations

related
Escrow transactions, Invariant confluence, Network partition, Serializability

Citations

  1. Balegas et al. Extending Eventually Consistent Cloud Databases for Enforcing Numeric Invariants (2015), sections III-IV. (accessed 2026-11-10)
Sources & caveats
  • Review of arXiv:1503.09052v1; middleware assumes sufficient redundancy within a data center to retain its state. No prototype performance result is reproduced.

JSON: /data/terms/bounded-counter.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Bounded counter. Hesela. 2026-11-10. https://hesela.dev/terms/bounded-counter/