Live bounded experiment · actual candidate Y-Engine

What does DNA look like after it moves through the engine?

A base sequence is first given an explicit complex-phase code. That moving phasor enters one declared external face of the current Mind runtime candidate. Seven depths, twelve addresses, three dimensions, and three recursively nested Mind nodes then respond through delay, residue, cross-dimension relation, changed return, and wider return. Two phase readings are projected onto the engine’s declared torus chart.

Run the observation ↓ Read the exact founder direction ↗
  1. 01

    Sequence

    Paste one sequence of A, C, G, T, and optional N symbols. One FASTA header is ignored; multiple records are rejected.

  2. 02

    Wave

    A declared code maps each base to a complex direction. This adapter is visible and changeable.

  3. 03

    Engine

    The signal touches situated-mind / D1 / I only. Every deeper and wider response must travel through the same current runtime candidate.

  4. 04

    Observe

    Compare the path with a sequence control before giving the geometry a biological meaning.

Input and declared transformation

Let the same sequence answer through more than one representation.

There is no privileged nucleotide angle in this first visual laboratory. The primary mapping puts complementary base pairs on opposite directions; two alternatives expose how much of the picture belongs to that choice.

Ready. The example is synthetic and carries no biological claim.

The representation before the engine

The sequence becomes two visible components of one phasor.

z[n] = cos ψ[n] + i sin ψ[n]. This is a chosen symbolic waveform, not the raw picoamp trace measured by a nanopore. Raw nanopore current can be added later as its own input layer without pretending it is identical to basecalled sequence.

A · +realCGTN · hold prior boundary

Inside the current runtime candidate

One contact becomes seven delayed readings.

The lines below are not seven copies of the bases. Only depth one receives the external boundary. Each later line is the current I address after the previous depth’s retained history, residue, and the runtime’s other relations have acted.

recursive nodes3
dimensions9
depths / dimension7
roles / depth12
runtime cells756

Run the experiment to inspect the current candidate ratio profile and runtime-reported gate states.

What the engine actually returned

Compare the path, not the existence of the torus.

Every valid pair of phase readings lands on this torus because that chart is already declared. Each canvas shows three paths: the contacted Mind, its parent identity, and the wider Mind. The observation is how those paths move and differ—not the mere appearance of a torus.

Run not started
Observed input

Your sequence

—
Declared comparison

Composition-matched shuffle

—
Observation will appear here

Run the sequence. The result will describe only what this configuration did—never what the picture merely resembles.

Same input · current engine parameters

An optimum needs a target. Until then, keep the measurements separate.

The table compares the unchanged current ratio profile with one-parameter ablations. It does not combine the numbers into a convenient winner. A real optimum must be declared before the held-out biological answer is opened—for example, best prediction of a fixed target subject to stability and non-collapse.

ProfileRepeatCoherenceLag-aligned inputCoverageClosureVs control
Run the main observation, then start the optional parameter-ablation scan.
The scan is separate because it executes ten additional candidate-runtime runs.

Current optimum status: not declared. The current profile already contains declared golden ratios. Its output therefore cannot be evidence that DNA independently discovered the golden ratio. The ablations ask what shared transport lag, residue feedback, changed return, and whole convergence contribute. Runtime-reported candidate gate states are not a replacement for the published fidelity audit.

The conclusion ladder

What must be earned next?

  1. Now

    Visual trajectory

    A reproducible path from declared sequence, codebook, engine profile, and initial state.

  2. Next

    Sequence fingerprint

    The path survives equivalent encodings and independent reads while matched shuffles lose it.

  3. Then

    Biological information

    It predicts one unopened native target better than GC, k-mer, spectral, and other matched baselines.

  4. Separate gate

    Mind capability

    The resulting system receives consequence, retains history, compares alternatives, corrects direction, and returns change. A static genome image cannot do this alone.