NumerASCII

NumerASCII / Lab 06

Agent communication
observatory.

Follow two participants in one shared symbol space. Inspect each message, compare their associations, and see what remembered feedback changes.

RULE-BASED SIMULATION

Planner proposes routes. Checker accepts or rejects them using its own capacity table. Every message crosses the NumerASCII codec.

Recorded turn playback · No connected LLMs · No model costs
128ASCII glyphs
0 / —messages revealed
0 / 8tasks completed
0observed rejections

Two-agent GlyphASCII topology

A · ASCII 65 · 1000001

SIMULATION
Waiting for both participants.
LLM 1 slot · Gemini Planner simulationLLM 2 slot · OpenAI Checker simulation
128 glyphs per sphereDrag to orbit · Click to inspect · Scroll to zoom
Geometric resemblancePlanner transitionsChecker transitionsExact ASCII matchRecorded simulation · Updates after each message

LLM 1 slot · Gemini Planner simulation

WAITING
Waiting for Planner’s first offer.

No messages revealed.

Exact glyphs and message counts

0 messages · 0 observed transitions

LLM 2 slot · OpenAI Checker simulation

WAITING
Waiting for Checker’s first reply.

No messages revealed.

Exact glyphs and message counts

0 messages · 0 observed transitions

Press Play or Step to reveal the first message.

0 / —

Preparing a verifiable simulation trace…

Settings

Display

Display preferences are saved in this browser. Captions follow each participant’s latest revealed turn.

Matching symbols

Mint bridges mean identical ASCII codes in the selected messages. They do not imply matching meanings. Select a code to highlight it in both spheres.

No matching symbols yet.

Gemini and OpenAI connections

The visualizer is running a simulation. Saving provider credentials configures the server; it does not switch this recording to live models.

Open settings to check the operator server.

Geometry compares shared bits. Associations count adjacent characters within each participant’s revealed messages; they do not measure semantic understanding. Up to the strongest 80 association overlays are drawn. All selected-character counts remain inspectable.

Symbol inspector

ASCII 0–127

glyphascii.radial7/1 · bit 6 at 12 o’clock, clockwise; outer point = 1.

Closest geometric neighbors

Observed outgoing associations

Uses the “Associations from” filter above.

Message inspector

READY

Planner ⇄ Checker

Press Play or Step to reveal the first message.

No message revealed.

GlyphASCII · one indexed glyph per code, in message order

Observable update

Only trace playback changes here. Agent state is recorded during simulation generation.

Message integrity record

SHA-256 chain detects changes to this recorded trace. It is an unkeyed audit check, not proof against a rewritten trace.

Previous digest

Event digest

Chronological trace

0 MESSAGES

Your trace begins when you press Play.

Preparing…

Task outcomes & memory

8 FIXED TASKS
TaskLoadOutcome

Planner’s observed rejection bounds

A rejection at load 3 establishes a bound of “3 or above rejected” for that route. This is a rule update from observed feedback, not neural training.

Inspect the simulation setup

Checker has a separate capacity table: NORTH 2, EAST 4, SOUTH 8. Planner starts without those capacities and prefers routes in that order. The task loads are 3, 2, 6, 4, 7, 1, 8 and 5. Turn off memory to compare repeated failures. Both agents run locally as independent rule-based objects, not separate AI services.