Babysitter consensus-mechanisms
Multi-protocol consensus for agent swarms supporting Raft leader election, Byzantine fault tolerance, Gossip state propagation, and CRDT conflict-free merging.
install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/methodologies/ruflo/skills/consensus-mechanisms" ~/.claude/skills/a5c-ai-babysitter-consensus-mechanisms && rm -rf "$T"
manifest:
library/methodologies/ruflo/skills/consensus-mechanisms/SKILL.mdtags
source content
Consensus Mechanisms
Overview
Implement distributed consensus among agent swarms. Select the appropriate protocol based on fault tolerance requirements, swarm size, and communication topology.
When to Use
- Multiple agents have produced independent solutions needing reconciliation
- Byzantine fault tolerance is required (untrusted or unreliable agents)
- State synchronization across distributed agent swarms
- Conflict-free data merging in concurrent operations
Protocols
| Protocol | Use Case | Fault Tolerance | Complexity |
|---|---|---|---|
| Raft | Leader-based consensus, ordered log | Crash faults (f < n/2) | Medium |
| Byzantine | Untrusted agents, adversarial conditions | Byzantine faults (f < n/3) | High |
| Gossip | Eventual consistency, state propagation | Partition tolerant | Low |
| CRDT | Conflict-free replicated data types | Always convergent | Low |
Weighted Voting
- Queen agents: 3x weight multiplier
- Worker agents: 1x weight
- Configurable consensus threshold (majority, supermajority, unanimous)
Agents Used
- Protocol orchestrationagents/swarm-coordinator/
- Weighted voting leadershipagents/strategic-queen/
Tool Use
Invoke via babysitter process:
methodologies/ruflo/ruflo-swarm-coordination