quorum_machines 0.1.4-aarch64-linux

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 1fe825b986aa0ffdd02ad36e447a29e7e5c39f4ff54384db7dc82df9ff73b161
+  data.tar.gz: 044ddff50b5f8e81bf1e3cd3e5824a042383fca17267d14edc6bee73937fd54e
+SHA512:
+  metadata.gz: a685c5ffccbfbed153e2ef82851841fa4f8fc9fd9be3f05bd3394fd07b9a3c97ef394b1eb86b062aff805bd15b77d63f425cc64d6c2356e82f83c2fbab4ff58b
+  data.tar.gz: 505f05f9902192dac6e77ce6b9980d51d9e23a952d45c589f6325fe92bf4d1e332cc721dd1953d4f4926e2597b9d9894c228ded60a14e6a996c0589e15dc8f3f

data/CHANGELOG.md

@@ -0,0 +1,29 @@
+# Changelog
+
+## [0.1.4](https://github.com/seuros/quorum_machines/compare/quorum_machines/v0.1.3...quorum_machines/v0.1.4) (2026-11-06)
+
+
+### Bug Fixes
+
+* crates.io keywords and categories for the core ([e44f52f](https://github.com/seuros/quorum_machines/commit/e44f52ff6146189773c81ab45182ea3e535e600b))
+
+## [0.1.3](https://github.com/seuros/quorum_machines/compare/quorum_machines/v0.1.2...quorum_machines/v0.1.3) (2026-11-06)
+
+
+### Bug Fixes
+
+* keep test sources out of the packaged gem and crate ([0157188](https://github.com/seuros/quorum_machines/commit/0157188143615bee19c5c09578df1dc1cae368c0))
+
+## [0.1.2](https://github.com/seuros/quorum_machines/compare/quorum_machines/v0.1.1...quorum_machines/v0.1.2) (2026-11-06)
+
+
+### Bug Fixes
+
+* cross builds no longer compile for the host ([084aeb6](https://github.com/seuros/quorum_machines/commit/084aeb6fe3749ff30cc6322e2fd00514c7bb3716))
+
+## [0.1.1](https://github.com/seuros/quorum_machines/compare/quorum_machines-v0.1.0...quorum_machines/v0.1.1) (2026-11-06)
+
+
+### Features
+
+* initial extraction ([9513e8e](https://github.com/seuros/quorum_machines/commit/9513e8e339474618d9d028df80fdacc1b7d8c1f7))

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2026 Abdelkader Boudih
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,178 @@
+# QuorumMachines
+
+> Three acknowledgements from the same replica are one vote, not three. 🗳️
+
+A vote counter for Ruby that only counts heads. You tell it how many members there are and how many you need. It tracks *which* members have answered, not how many messages arrived, and tells you the moment enough distinct members are in. A second helper answers the sizing question before you deploy: do my read and write quorums overlap?
+
+## Quick Start
+
+```bash
+gem 'quorum_machines'
+```
+
+```ruby
+votes = QuorumMachines::Quorum.new(members: 3, required: 2)
+
+votes.acknowledge(0)   # => true
+votes.acknowledge(0)   # => true, but still one member
+votes.count            # => 1
+votes.reached?         # => false
+
+votes.acknowledge(2)   # => true
+votes.reached?         # => true
+```
+
+And before you pick those numbers at all:
+
+```ruby
+QuorumMachines.intersects?(members: 3, reads: 2, writes: 2)   # => true
+QuorumMachines.intersects?(members: 3, reads: 1, writes: 2)   # => false
+```
+
+## A Message to the Resistance
+
+So you replicated the writes. Three copies, commit when two say yes. You even wrote the counter yourself, because how hard can `acks += 1` be?
+
+Then replica 0 got slow. Your client retried. Replica 0 answered the first request, and the retry, and the retry after that. Three acks. Counter says three. You committed a write that exists on exactly one machine, and that machine is the flaky one.
+
+A quorum isn't a number of messages. It's a number of *members*. The counter has to remember who already spoke, ignore anyone speaking twice, and refuse anyone who isn't on the roster. That's the whole gem, and it's the part everyone gets wrong at 2 AM.
+
+## Chapter 1: Stardate 2025.186, the AMS Gifford
+
+> **AMS Gifford**, NCC-4216, *Gifford*-class quorum relay.
+> Five repeated hails from one bridge are still one bridge.
+
+The relay keeps a roster. When a ship hails, the relay marks that ship's name, not a tally. A captain who hails five times out of nerves is marked once. A ship not on the roster is politely ignored. When enough names are marked, the relay lights the board. What the fleet does with a lit board is the fleet's business.
+
+On the bridge, an ensign offers:
+
+```ruby
+def replicated_write(payload)
+  acks = 0
+  replicas.each { |r| acks += 1 if r.write(payload, retries: 3) }
+  commit! if acks >= 2
+end
+```
+
+"That," says the comms officer, "is how one ship outvotes the fleet."
+
+## The Flight Plan
+
+```mermaid
+stateDiagram-v2
+    [*] --> counting
+    counting --> counting: acknowledge(new member), count + 1
+    counting --> counting: acknowledge(seen member), no change
+    counting --> counting: acknowledge(outside roster), false
+    counting --> reached: count hits required
+    reached --> reached: more acknowledgements, still reached
+    reached --> counting: reset
+    counting --> counting: reset
+```
+
+And the night replica 0 answered three times:
+
+```mermaid
+sequenceDiagram
+    participant C as Client
+    participant Q as Quorum(members 3, required 2)
+    participant R0 as Replica 0
+    participant R1 as Replica 1
+
+    C->>R0: write
+    R0-->>C: ack (slow)
+    C->>Q: acknowledge(0)
+    Q-->>C: true, count 1
+
+    Note over C,R0: client already retried twice
+    R0-->>C: ack
+    C->>Q: acknowledge(0)
+    Q-->>C: true, count still 1
+    R0-->>C: ack
+    C->>Q: acknowledge(0)
+    Q-->>C: true, count still 1
+    Note over Q: reached? is false
+
+    C->>R1: write
+    R1-->>C: ack
+    C->>Q: acknowledge(1)
+    Q-->>C: true, count 2
+    Note over Q: reached? is true. Now commit.
+```
+
+## How the Relay Counts
+
+### Members are seats, not messages
+
+Members are numbered from zero. `acknowledge` returns `true` when the member is on the roster, whether or not it's new, and `false` when it isn't.
+
+```ruby
+votes = QuorumMachines::Quorum.new(members: 3, required: 2)
+
+votes.acknowledge(1)   # => true
+votes.acknowledge(3)   # => false, there is no seat 3
+votes.count            # => 1
+```
+
+The return value answers "was that a real member?", not "did the count go up". Check `count` or `reached?` for the latter.
+
+### Reaching the threshold
+
+`reached?` flips the moment `count` meets `required` and stays up until you reset. Extra acknowledgements after that are harmless.
+
+```ruby
+votes = QuorumMachines::Quorum.new(members: 5, required: 3)
+[4, 2, 4, 0].each { |member| votes.acknowledge(member) }
+
+votes.count      # => 3
+votes.reached?   # => true
+```
+
+For a majority, ask for `members / 2 + 1`.
+
+### Starting the next round
+
+```ruby
+votes.reset
+votes.count      # => 0
+votes.reached?   # => false
+```
+
+One tracker per decision, reset between rounds, or build a fresh one. Both are cheap.
+
+## Sizing Quorums Before You Ship
+
+If a write is confirmed by `writes` members and a read consults `reads` members, a read is only guaranteed to see the latest write when the two sets must overlap. `intersects?` is that check.
+
+```ruby
+QuorumMachines.intersects?(members: 5, reads: 3, writes: 3)   # => true
+QuorumMachines.intersects?(members: 5, reads: 2, writes: 3)   # => false
+QuorumMachines.intersects?(members: 3, reads: 4, writes: 2)   # => false, can't read 4 of 3
+```
+
+Run it in a test against your configuration so nobody tunes `reads` down to 1 "for performance" and quietly turns your consistent store into an eventual one.
+
+## The Rules of the Relay
+
+- **Membership is 1 to 64** seats, indexed from zero. `MAX_MEMBERS` holds the ceiling.
+- **`required` is 1 to `members`.** Zero, or more than the roster, raises `ArgumentError`.
+- **Integers only.** A Float member or threshold raises `TypeError`. A negative member raises `RangeError`.
+- **Off-roster is not an error.** Acknowledging a seat past the end returns `false` and changes nothing.
+- **Frozen means frozen.** `freeze` the tracker and `acknowledge` or `reset` raise `FrozenError`.
+
+## What You Think You're Doing vs Reality
+
+### You Think: "Two out of three acks means two replicas have it."
+### Reality: It means two messages arrived.
+
+Retries, duplicate deliveries, and a proxy that replays on timeout all produce acks that look identical to the first one. Unless something remembers *who* answered, your quorum is counting network behavior, not durability.
+
+## What's Yours
+
+The relay counts. It does not know who is allowed to vote, whether a vote was forged, or what to do when the board lights up. Authenticate the sender before you call `acknowledge`, decide what a round means, and persist the outcome yourself. Counting votes is the easy part of consensus. It's just the part nobody should get wrong.
+
+## License
+
+MIT License. See [LICENSE.txt](LICENSE.txt) for details.
+
+**Remember: Replica 0 will answer as many times as you ask. It still only gets one seat.**

data/ext/quorum_machines_native/core/CHANGELOG.md

@@ -0,0 +1,22 @@
+# Changelog
+
+## [0.2.2](https://github.com/seuros/quorum_machines/compare/quorum-machines-v0.2.1...quorum-machines-v0.2.2) (2026-11-06)
+
+
+### Bug Fixes
+
+* crates.io keywords and categories for the core ([e44f52f](https://github.com/seuros/quorum_machines/commit/e44f52ff6146189773c81ab45182ea3e535e600b))
+
+## [0.2.1](https://github.com/seuros/quorum_machines/compare/quorum-machines-v0.2.0...quorum-machines-v0.2.1) (2026-11-06)
+
+
+### Bug Fixes
+
+* keep test sources out of the packaged gem and crate ([0157188](https://github.com/seuros/quorum_machines/commit/0157188143615bee19c5c09578df1dc1cae368c0))
+
+## [0.2.0](https://github.com/seuros/quorum_machines/compare/quorum-machines-v0.1.0...quorum-machines-v0.2.0) (2026-11-06)
+
+
+### Features
+
+* initial extraction ([9513e8e](https://github.com/seuros/quorum_machines/commit/9513e8e339474618d9d028df80fdacc1b7d8c1f7))

data/ext/quorum_machines_native/core/README.md

@@ -0,0 +1,29 @@
+# quorum-machines
+
+> **AMS Gifford**, NCC-4216, *Gifford*-class quorum relay.
+
+Engine-room flight manual: count distinct bridge acknowledgements toward a threshold.
+
+Allocation-free, `no_std` quorum tracking over fixed membership indices.
+Duplicate acknowledgements never increase the count. Invalid indices are rejected.
+Create a fresh tracker for each operation, term, or membership epoch.
+
+`Quorum::majority()` uses strictly more than half of the fixed membership.
+`Quorum::new(required)` supports other positive thresholds up to the membership
+size. `intersects` checks threshold arithmetic only: read/write intersection
+does not by itself prove consistency, freshness, or consensus safety. Membership
+identity, authentication, epoch matching, and durable acknowledgements are the
+consumer's responsibility. Joint-consensus membership changes are not implemented.
+
+```rust
+use quorum_machines::Quorum;
+# fn example() -> Option<()> {
+let mut votes = Quorum::<3>::majority()?;
+assert!(votes.acknowledge(0));
+assert!(!votes.reached());
+assert!(votes.acknowledge(1));
+assert!(votes.reached());
+# Some(())
+# }
+# assert_eq!(example(), Some(()));
+```

data/ext/quorum_machines_native/extconf.rb

@@ -0,0 +1,2 @@
+# frozen_string_literal: true
+require_relative 'ffi/extconf'

data/lib/quorum_machines/version.rb

@@ -0,0 +1,4 @@
+# frozen_string_literal: true
+module QuorumMachines
+  VERSION = '0.1.4'
+end

data/lib/quorum_machines.rb

@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+require_relative 'quorum_machines/version'
+require 'quorum_machines_native/quorum_machines_native'
+
+module QuorumMachines
+  def self.intersects?(members:, reads:, writes:) = _intersects(members, reads, writes)
+  private_class_method :_intersects
+
+  class Quorum
+    def self.new(members:, required:) = _new(members, required)
+    private_class_method :_new
+  end
+end

data/sig/quorum_machines.rbs

@@ -0,0 +1,12 @@
+module QuorumMachines
+  VERSION: String
+  MAX_MEMBERS: Integer
+  def self.intersects?: (members: Integer, reads: Integer, writes: Integer) -> bool
+  class Quorum
+    def self.new: (members: Integer, required: Integer) -> instance
+    def acknowledge: (Integer) -> bool
+    def count: () -> Integer
+    def reached?: () -> bool
+    def reset: () -> nil
+  end
+end

metadata

@@ -0,0 +1,61 @@
+--- !ruby/object:Gem::Specification
+name: quorum_machines
+version: !ruby/object:Gem::Version
+  version: 0.1.4
+platform: aarch64-linux
+authors:
+- Abdelkader Boudih
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2026-11-06 00:00:00.000000000 Z
+dependencies: []
+description: Thin Ruby bindings to the standalone quorum-machines core; membership
+  epochs and acknowledgement authentication belong to the caller.
+email:
+- oss@seuros.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- LICENSE.txt
+- README.md
+- ext/quorum_machines_native/core/CHANGELOG.md
+- ext/quorum_machines_native/core/README.md
+- ext/quorum_machines_native/extconf.rb
+- lib/quorum_machines.rb
+- lib/quorum_machines/version.rb
+- lib/quorum_machines_native/quorum_machines_native.so
+- sig/quorum_machines.rbs
+homepage: https://github.com/seuros/quorum_machines
+licenses:
+- MIT
+metadata:
+  source_code_uri: https://github.com/seuros/quorum_machines
+  rubygems_mfa_required: 'true'
+  cargo_crate_name: quorum_machines_native
+  cargo_manifest_path: ext/quorum_machines_native/ffi/Cargo.toml
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '4.0'
+  - - "<"
+    - !ruby/object:Gem::Version
+      version: 4.1.dev
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.5.23
+signing_key: 
+specification_version: 4
+summary: Native distinct-member quorum decisions for Ruby
+test_files: []