Society · Protocols

OptimisticSolver

High-velocity solver requiring parallel runtime

Definition

Mechanism

A high-velocity implementation of PolymorphicSolver designed for efficient multi-agent coordination. Requires a Parallel runtime (Actor Model with Mailboxes) to prevent serial deadlock. It explicitly couples the standard Solver lifecycle (Reason -> Solution) with the AtomicBid protocol. Unlike the base abstraction, this pattern MANDATES that the agent plan and execute in a single turn. It relies on Reflexion and Compensate for error correction rather than pre-action permission. Use ComputeBudget to bound resource consumption. Contrast with RigorousSolver which prioritizes safety over speed. A PathwayMemory accumulates across runs so the optimistic route-selection converges on strategies that historically succeeded under similar conditions.

Preconditions

  1. Runtime supports Asynchronous/Parallel message delivery (Actor Model).
  2. Message Bus is non-blocking (Mailbox pattern).

Invariants

  1. Turn Atomicity: Must output [BID] and [TOOL] in the same response.
  2. Non-Blocking: Cannot wait for Orchestrator approval on standard tasks.

Risks

Failure modes

  1. Over-Eager Execution

    Solving the wrong problem efficiently because feedback was skipped.

  2. Serial Deadlock

    If deployed on a single-threaded (Talking Stick) engine, multiple atomic outputs will be dropped, halting the swarm.

Caution

Executes without pre-action verification. Ensure irreversible actions have compensation or sandboxing, or use RigorousSolver at those boundaries.

Relationships

Builds on

Composes with

AtomicBid

Declaration and execution in a single turn

Infrastructure

Compensate

Structured rollback via logged inverses in LIFO order

Mind

PathwayMemory

Learned routing memory: problem_class → route → outcome_quality

Mind

Reflexion

Self-critique and retry after failure

References

Mind

PolymorphicSolver

Solver implementing the five-surface contract (polymorphic across substrates)

Extends

Mind

PolymorphicSolver

Solver implementing the five-surface contract (polymorphic across substrates)

Nothing in this library builds on this pattern yet.

Reference

Identity

Ref
OptimisticSolver#63aa
Sema ID
sema:OptimisticSolver#mh:SHA-256:63aaa2e083c615a967019ce3aa709f431ff624aafce8b90ed6229144c102fda8
Ring
1
Tier
2
Updated
2026-11-11
Supersedes
  • sema:OptimisticSolver#mh:SHA-256:ee29600346db4594152f7d653a9700b4682402249775f5b7f765fbf1759e592d
  • sema:OptimisticSolver#mh:SHA-256:0074aaa03aa80f73a3950535264a5512e6d6674d58bc9b3ac55a24699ac088b8
  • sema:OptimisticSolver#mh:SHA-256:18c043757659c13a56ceab6640765f6ecf4e24a9cfffc6cdf9e6ccf7f05c2e77
  • sema:OptimisticSolver#mh:SHA-256:f664c4e84cbf04e0c16b1fcac7c2662b4b35f4b474b76a2a47e129b36a3dc639
  • sema:OptimisticSolver#mh:SHA-256:0dcabc92d9b6bbac524d5e7445ecd0590872956e3e392304e6de24655dbea4f7
  • sema:OptimisticSolver#mh:SHA-256:e24845caf8d2f00f90715e2cbf5a5ed3525bfb8ee9e6d2c23731ada2427163b2