LAB / WMSI-EXP-074

Representation Search Before Solving.

Can explicit search over alternative representations shorten reasoning while preserving correctness?

STATUS / PROTOCOL DRAFTPRIORITY / P0 — First-wave / coreREGISTRY / 26 SEP 2026 · V1.0

01 / QUESTION

Representation Search and Specialized Intellectual Geometry

Can explicit search over alternative representations shorten reasoning while preserving correctness?

PLANNED RESEARCH

This is a protocol scaffold, not a completed experiment or a frozen execution plan. No measured effect or research conclusion is claimed here.

Hypothesis to test

The manipulation described below produces a reproducible, condition-specific change in the measured system behavior or internal state that is not explained by the ordinary controls.

Ordinary competing explanation

The observed pattern is explained by ordinary sampling variation, prompt/representation artifacts, surface lexical cues, evaluator bias, or the known product/runtime mechanics captured by the controls.

02 / PLANNED DESIGN

How we intend to test it

Require models to generate several recodings/bases/graphs/ontologies before solving and choose one by predicted tractability.

Controls

Direct solve; random representation; human-chosen representation.

What we would measure

Solution accuracy, token/path length, verification burden, representation score.

Access and instruments

Ordinary software or API access. This describes access requirements, not verified readiness on our Spark.

Agent harness; task suite; verifier.

Before a full run

Feasibility=NOW; priority=P0. Before confirmatory execution, run a small pilot to estimate variance/cost, freeze the scoring rules, and assign a run-count target.

Model revisions, final prompts, sample sizes, cost limits, and scoring rules must be settled through the pilot and protocol-freeze process.

03 / INTERPRETATION

What could fool us

Different data quality, vocabulary leakage, compute mismatch, representation chosen after seeing answer.

What would weaken the idea

If representation search only adds overhead, the method fails.

Observation, inference, speculation, unknowns, and apparatus errors will be labeled separately. One striking transcript cannot establish a general effect.

04 / RECORD

Evidence we plan to preserve

Base checkpoint, training corpus hash, recoding candidates, dependency graphs, solution traces.

Planned visual evidence

Reasoning-cost frontier; representation dependency graphs.

No research runs or raw datasets are published for this experiment. The September 26, 2026 registry and protocol compendium (version 1.0) are the sources for this planning record.

Back to all 90 experiments