← All concepts
53 · Collective Intelligence

Zero-text signal plane
in GenOS.

Persisted signals and deliveries, inbox/ACK, leased handler retries and bounded cognitive escalation.

IMPLEMENTATIONPartial
RUNTIME INTEGRATIONWired
EVIDENCEIntegration tested
LAST REVIEWED SOURCEGenOS 5091f70 ↗

SQLite deliveries, subscriber pull, ACK states, leased retries and cognitive escalation are connected; receiver registration at server startup is not wired.

Documentation markers describe linked material, not verified GenOS behavior. Simulation and benchmark flags remain partial until a concept-specific artifact is linked.

DOCUMENTATION
  • Science
  • Mathematics
  • Interactive model
  • Mechanism steps
  • Benchmark
  • FR explanation
EXPLAINER

How does zero unnecessary prompting work?

The aim is to reserve model reasoning for cases that need it. A routine signal can be validated, routed and handled by a deterministic rule without a conversation between models.

1. Typed event2. Validate + coalesce3. Matching receptor?4. Direct action or escalation review

Example: no LLM call to handle the signal

A component publishes a typed DEPLOY_READY signal. A configured receptor recognizes it and triggers an authorized action. Reading, routing and triggering it need no model prompt.

When a model may be used

If no receptor can act, a value gate may assess whether to create a cognitive task. A wake_worker action can also start a mission that later uses a model. Zero prompts for signal handling does not mean zero model use throughout the mission.

A signal carries an indication, not final proof: delivery, understanding, action and verification are separate steps.

DEFINITION AND SCIENCE

What it means
in GenOS.

IN ONE SENTENCE

Persisted signals and deliveries, inbox/ACK, leased handler retries and bounded cognitive escalation.

BIOLOGICAL / SCIENTIFIC BASIS

Reliable messaging separates durable enqueueing from processing and acknowledgment. At-least-once delivery permits duplicates, so handlers need idempotent effects.

GENOS TRANSLATION

Persist and address → Dispatch or escalate → Recover

MATHEMATICAL / LOGICAL MODEL

State machine pending→leased→acknowledged or retry. After k failures, backoff d_k=min(d_max,d_0·2^k); terminal quarantine follows the configured retry bound.

ANIMATED DIAGRAM · INTERACTIVE MODEL

Explore the mechanism: Zero-text signal plane

A qualitative teaching model of this concept. It does not run GenOS or validate its implementation.

01 / 03
Current transition · Step 1Persist addressed signal

The modeled transition may proceed. Change the assumption and move through the stages to inspect the decision path.

PROCESS AND USE

How it works
at a glance.

01

Persist and address

Store typed signals and per-subscriber deliveries; an inbox reads scoped pending items and records seen/ACK states.

02

Dispatch or escalate

A matching receptor may return an action result. If deterministic dispatch fails, a value-of-information gate may allow a bounded advisory model response.

03

Recover

A local push is backed by SQLite pull and atomic claims. Failed handlers retry with backoff and reach terminal quarantine after eight attempts.

RUNTIME IMPLEMENTATION

What is connected,
and how far.

The EventBus push is process-local. A crash after an action but before delivery confirmation may run its handler again; external actions must deduplicate by signal ID. In-memory coalescing is lost on restart and the model response is not proof of action success.

IMPLEMENTATION DETAIL

SQLite deliveries, subscriber pull, ACK states, leased retries and cognitive escalation are connected; receiver registration at server startup is not wired.

FAILURE MODES

A persisted signal is not proof its business action completed. · Startup currently does not register all production receptors. · Polling tool leases alone do not bind a supplied agent ID to the MCP client identity.

CODE REFERENCES

No implementation file is pinned to this concept entry yet.

PRIMARY RESEARCH · MECHANISM LEVEL

The mechanism
behind the analogy.

CAUSAL ORDERING IN DISTRIBUTED SYSTEMS · 1978

Time, Clocks, and the Ordering of Events in a Distributed System

Leslie Lamport · Communications of the ACM 21(7), 558–565

Defines a partial order of events and logical clocks. A published run without event timestamps cannot be reconstructed into a causal timeline from this result alone.

Open publication ↗

Primary research describes the cited mechanism; specific technologies may instead cite their original technical documentation. These sources provide context and do not validate the GenOS implementation.

EVIDENCE AND LIMITS

At-least-once delivery requires idempotent effects

The EventBus push is process-local. A crash after an action but before delivery confirmation may run its handler again; external actions must deduplicate by signal ID. In-memory coalescing is lost on restart and the model response is not proof of action success.