← Instrument galleryD26-FRACTAPP-EXECUTABLE-STATE

Fractapp Fractal Memory Machine

A Base-4 integer-addressed reference machine for byte storage, direct seek, streaming reconstruction, and execution in one recursive geometry

IMPLEMENTED · EXTERNAL FRACTAL MEMORY MACHINE · INDEPENDENT REVIEW PENDING

Write bytes, seek their exact addresses, stream them back, and execute code in the same space.

Fractapp's canonical implementation and measured reports are published in its repository and deployment. Its Base-4 integer route is the authoritative byte address; distance, rotation, hierarchy, and geometric position are deterministic projections of that route.

Evidence state: IMPLEMENTED. The production gate passes byte-address, random-seek, exact reconstruction, tamper-refusal, path-as-data, RAM, control-flow, and VM tests. B19 covers independent address calculations, persistent backends, runtime comparisons, and conventional index baselines.

Purpose

Fractapp is a working reference machine for a more fundamental Address & Locality proposition:

Can bytes, streams, and executable instructions share one recursive geometry in which every iteration from the root remains encoded in an exact integer address?

The canonical rule is:

V_next = 4 × V_current + branch

The root is V = 1; each later Base-4 digit is one exact iteration. The integer route is authoritative. Distance, rotation, scale, parentage, and geometric position are derived from it rather than used as approximate identities.

Operate and inspect

The repository is linked rather than copied into Glyphd Labs. The live machine is public; source review remains subject to the repository owner's access boundary.

Implemented machine

The production reference implementation now provides:

  • a full SHA-256 object namespace encoded as 128 Base-4 levels;
  • a 64-bit logical byte offset encoded as 32 more Base-4 levels;
  • one exact 160-level integer address for every stored byte;
  • deterministic dyadic geometry with derived distance and rotation;
  • 4 KiB physical pages behind stable logical addresses;
  • browser IndexedDB and in-memory storage backends;
  • direct single-byte seek and bounded range reads;
  • ordered byte streaming, exact reconstruction, and SHA-256 verification;
  • fail-closed portable memory-pack import;
  • path-as-data mode in which four Base-4 turns represent one byte;
  • a small assembler and Fractal VM whose opcodes are fetched from the same byte-addressed space;
  • sparse mutable RAM, jumps, arithmetic, output, and execution traces.

The original application that authored a file is not required to recover its bytes. Reconstructed text, image, audio, or video bytes require only the Fractapp runtime plus an ordinary decoder for that media type.

Current project evidence

The production deployment is blocked unless its repository verification command passes. At the pinned production revision, that gate reported:

  • 11 of 11 fractal-machine correctness tests passed;
  • arbitrary byte write, page-boundary seek, range read, stream, reconstruction, and content verification passed;
  • altered page bytes and tampered portable packs were rejected;
  • every tested byte address had the declared depth of 160;
  • a 64 KiB stream round-tripped through one 262,144-turn Base-4 path integer;
  • a 74-byte program executed 26 instructions and produced the expected output from fractal memory.

These are project-local implementation and conformance results. Glyphd Labs records the machine as IMPLEMENTED, not independently reproduced.

Evidence boundary

  • A 2^64 logical byte range per object is address capacity, not physical browser storage.
  • Path-as-data retains all original information bits; it is not magical or arbitrary compression.
  • The published performance rows use an in-memory backend and do not represent disk, object-storage, network, or multi-device latency.
  • The current Fractal VM is a deterministic reference instruction set, not a replacement for a production CPU or WebAssembly runtime.
  • The browser UI currently caps one write at 128 MiB.
  • Geometry is useful because the address carries ancestry, prefix, region, and scale; superiority over flat indexes, tries, B-trees, Merkle DAGs, or conventional streaming layouts remains unproven.
  • The repository is access controlled, so independent source review requires authorization.

Review path

B19 now defines the independent machine review:

  1. pin the production commit, deployment, address profile, and test corpus;
  2. verify object namespace and 64-bit offset decoding over a broad corpus;
  3. prove exact random seek, range read, stream, reconstruction, and tamper refusal across clean environments;
  4. compare IndexedDB, file, object-storage, and conventional flat-address backends;
  5. test path-as-data round trips without describing them as compression;
  6. execute the same Fractal VM programs across pinned runtimes;
  7. measure whether recursive prefixes or geometry produce useful locality, scheduling, or cache behavior;
  8. publish failures, raw artifacts, environment details, limitations, and an independent receipt.

Until that review completes, D26 is a functioning public reference machine and durable test target—not a universal storage, database, networking, or CPU-replacement claim.