No write in progress.
GLYPHD / FRACTAPP MACHINE V1
A computer whose memory is a fractal.
Fractapp writes real bytes into a recursively addressable space. Every byte gets one exact integer address, a geometric location, and a direct path back to the origin. The same space can store files, stream data, and execute programs.
What this is not: arbitrary data is not magically compressed. The gain is a huge sparse address space with structure built into every address.
V′ = 4V + branch
- 4
- branches per step
- 160
- levels per byte address
- 2⁶⁴
- logical byte positions per object
In ordinary English: a hard drive usually imagines memory as one long row of numbered boxes. Fractapp arranges those boxes as an endlessly subdividing map. The address tells the machine both where the byte is and how to travel there from the root.
01 / WRITE
Put actual bytes into fractal memory.
Upload any file or type text. Fractapp divides it into physical pages for efficiency, while every byte still receives one exact 160-level Base-4 address: 128 namespace levels plus 32 offset levels.
Write an object to create its fractal namespace.
——02 / ADDRESS + SEEK
Jump straight to a byte.
Choose an offset. Fractapp turns the object identity and offset into one integer path, reads only the necessary page, and derives the byte’s distance and rotation from the root.
——————03 / STREAM + RECONSTRUCT
Read the address space back as a byte stream.
Fractapp can walk a range in order, emit chunks while it reads, rebuild the original object, and compare the resulting SHA-256 with the identity recorded at write time.
Choose an object first.
The first emitted bytes will appear here.
Text, image, audio, and video objects can be previewed after Fractapp reconstructs their byte stream. Other types remain downloadable exact bytes.
The universal requirement is the Fractapp runtime plus an ordinary decoder for the media type—not the application that originally authored the file.
04 / THE PATH IS THE DATA
One byte can literally become four turns.
In Base 4, four branch choices carry eight bits. This mode places the stream itself inside one giant path integer. It proves the representation directly; it does not claim compression.
05 / EXECUTE
Store and run a program in the same space.
The assembler compiles a small instruction set into bytes. Those bytes are written into fractal memory. The VM fetches each opcode by its fractal byte address, performs the operation, and records the moving program counter.
Compile the program first.
No program has run.
| step | pc | instruction | stack | distance | rotation |
|---|---|---|---|---|---|
| Run the program to trace its travel through fractal memory. | |||||
06 / PROVE IT
Correctness is a button, not a slogan.
The browser self-test writes a deterministic corpus, seeks across page boundaries, streams it, rebuilds it, verifies the hash, round-trips a path integer, and executes a program.
- Not run yet.
- 11 unit tests cover addressing, geometry, byte round trip, paging, seek, stream, pack verification, tamper rejection, assembly, RAM, and control flow.
- FIC/5 research now includes a frozen public-split pass and a subsequently opened H2 holdout pass against the declared exact-deduplicated complete tile-pyramid baselines.
- Vercel deployment gate runs the test, benchmark, FIC/5, and publication-validation suites before production is published.