Form Atlas · live · STAGE 0 · descriptive pilot

The forms a goal-directed conversation takes

ATLAS is a structural readout of goal-directed conversations. It does not read text; it reads motion form.

Each bar is an observed conversation shape. Each node in the tree is a shape the grammar allows: a filled node is a shape we have seen, a dashed node is one the grammar allows but we have not seen yet. A paired block is two agents in one exchange; ? means their coupling limit is not measured yet.

386 measured conversations (clean half-chiasm) → 228 exact shapes

C converging S holding M drifting  ·  length = turns · thickness = conversations sharing the shape.
Across these shapes, motion returns to holding 400 times — a move back into S from C or M, where a conversation re-stabilises after converging or drifting.

PROVEN

The grammar, as a tree

Two negations generate every shape: no shape starts with M, no M→C inside. What survives is counted by Fibonacci. A node is a valid shape — filled if we have seen it, dashed if the grammar allows it but we have not seen it yet. The colour of a branch is the move it just made: one of the five allowed transitions.

CS C→SCM C→MSC S→CSM S→MMS M→S

CMSCMCMSCSCMSCCMSMSCMSMCMSCMCSCMSCSCMCSCSCCSCSMCSCSCSCCSMSCCSMSMCSMSCSMCSCSCMSCSCMSMSCMSSCMSCSCMSCSCSSCSCSCSMSSCSMSCSSCSMSCMSMSCSSMSCSMSMSSMSMSMSSMS
OBSERVED

The shapes run out while the grammar keeps allowing more

At each length: the grey bar is how many distinct shapes actually appear; the small number above it is how many the grammar allows. They diverge — the real shapes saturate and die out, the allowed set keeps exploding.

2
2
len 1
4
4
len 2
6
5
len 3
10
8
len 4
16
7
len 5
26
8
len 6
42
7
len 7
68
5
len 8
110
6
len 9
178
4
len 10
288
2
len 11
466
0
len 12

seen (bar, lower number) saturates at 6 for length 4–7, falls from length 8, hits 0 at length 12. allowed (upper number) keeps growing 2, 4, 6, 10, 16, 26, 42… The base shapes are few; long chromosomes are rare tails.

OBSERVED

Chiasm loci · paired rails

Two agents in one exchange, drawn as two rails by turn count (they dialogue, so their lengths match). The lock is 1 when the two shapes fuse, Ø when the border is impossible, ? when it cannot yet be decided. S is never auto-declared: it needs the coupling limit, which the product does not measure per turn.

1
1
1
1
1
1

+ 31 more pairings — the full grid is the matrix view (coming).

What is proven, observed, or open

PROVEN the shape grammar (tree)   OBSERVED saturation · holding re-entry · chiasm pairings   RESEARCH full compat matrix over shapes   PARKED coupling limit per turn

A live aggregate of the Ω-API-owned corpus under the current measurement version, cleaned of agent-to-agent and Hive-test material so the one-sided grammar reads true; paired couplings are shown separately as loci. The measurement derives the shape without reading conversation text. No text, account, project, session identifiers or outcomes are shown. Colour is direction of motion. The finding is not how many shapes appear; it is which shapes cannot appear without a change of regime.