Natural geometry
Source stays fixedThe original RGB values remain in place.
NATURE. MATHEMATICS. A NEW WAY TO READ.
One image is stored.
The lattice changes how it is read.
Follow existing pixels through a toroidal address space as a spiral shell becomes a fern. Every destination reads from the original image.
1.33 million original pixels · one sourceThe original RGB values remain in place.
Select a point to reveal its source and route.
FOLLOW THE REFERENCE, KEEP THE DATA
The filter connects each new image position to a pixel that already exists. The moving traces show those read references through the toroidal fabric. The original pixels stay stored and unchanged.
Let a selected read cover a larger area. The displayed coverage changes; the original fine pixels stay available.
Full detail preserves every pixel and the exact color counts.Live source-to-view references with a designed image map. Route motion illustrates logical reads; it is not measured FPGA traffic.
Only the 1152×1152 source JPEG and a destination-to-source address map are included. The browser decodes the source once; every output RGB value is read from that fixed decoded array. The generated fern was a target layout during preparation. Its pixel bytes are not loaded by this widget. A bijective map uses each of the 1,327,104 source references exactly once.
Intermediate full-detail states are also permutations. The transition exchanges read bindings, with reverse playback applying those exchanges in reverse order. Source fingerprint: —. Mapping validation: checking.
The toroidal and unwrapped projections use the same row/column addresses as the image read. A selected destination is resolved through the active read map; its original reference supplies the pixel color, source marker, torus path and destination marker. Both lattice axes wrap modulo the image side.
The geometry keeps the handedness and 3:2.4 major/minor radii of the existing Holoseed datafield view. The displayed native-fiber sample uses 24×24 seats at spacing 48 on the 1152 carrier. Its phase comes from the selected source address. This is a projection and sampling of address geometry, not a display of private controller values.
Fixed-store binding transport reads the destination through an inverse address map. Registered scale coordinates retain coarse position and local phase. Demonstration paths use wrapped row and column offsets, expanded into adjacent logical steps; their endpoints match the actual read references.
The image-specific map is an explicit public address program. It is not a native FPGA permutation plane or a private routing scheduler, and it does not establish that one native operation transforms arbitrary photographs. Route sampling, camera motion, and reveal timing are presentation choices. Logical step counts are not hardware hop-depth measurements.
Full detail includes every source pixel exactly once and preserves the complete RGB histogram. Larger coverage reads one retained phase per block and paints that value over the block. Displayed frequencies can change, while the source remains complete. A complete chart change alone does not duplicate stored values or recover omitted fine detail.
The explicit image map, source decoding, and display buffers occupy browser memory. This is not a compression result or a zero-memory browser implementation. Private recurrence sequences, generated controller tables, kernel tables, and FPGA route programs are not embedded.
The 144×144 campaign covered 186,624 structural outputs across nine family fields with 36 interleaved 24×24 controller fibers. Multiscale/Universal Scale Kernel evidence included 10,782 cases / 467,280 exact records, 47,880 chart round trips, and 12,672 aligned returns. Composed-control coverage included 64 ordered chart pairs across 24 planes.
These workloads overlap and must not be added into one total. The HD artwork and this logical route visualization were not on-board test fixtures.
Supplied physical benchmark: Digilent Arty A7-100T at 100 MHz, build 47B7141D, verified 25 September 2026; status through 2 October 2026. Accepted design: 10,845 logic LUTs, 7,968 flip-flops, zero DSPs, and zero structural lookup-table BRAM. The 81 KiB logical payload store used 32 RAMB36 blocks; structural recovery used one additional RAMB18.
Measured internal baseline: 20,736 identity-view words in 3,109,104 cycles (31.09104 ms at 100 MHz), excluding UART transfer and PC processing. Routing remains in development: implementation has not met 100 MHz timing, so on-board routing-depth results remain pending. Competitive speed and measured energy advantages remain unestablished.
Explore an image’s stored regions and inherited detail.
Select a parent. Follow its children. Measure the complete file.
Click a visible block in the stack.
Comparing the same image with and without ancestor selections…
Preparing an ordinary prediction + packing control…
A broad assignment supplies one color to many positions. Unchanged children reuse it.
A region can introduce a new color while selected children keep an earlier parent’s value.
The decoder resolves the stored rules and remaining detail. Every displayed view reads that decoded state.
SSX2 version 1 stores a 40-byte header, exact RGB assignments, branch masks, earlier-ancestor references, grouped child selections and reversible residual blocks. Child positions follow a declared divisibility-compatible coordinate path. A grouped selection is stored as an exact rectangle or bitmap at a supported finer target; it can remain owned by the coarse record without allocating a persistent finer image.
Rectangle groups can represent 2 × 3 footprints without defining a rectangular native Scale Kernel. The decoder excludes selected children from intervening assignments and resolves them to their specified ancestor. Selection descriptors are counted in full.
Most-frequent regional colors are a deterministic heuristic. Grouped selections and residual blocks of side at most 6 compete with branch records by their unpacked byte cost. This is an experimental codec, not a proven minimum-size encoding.
Native targets follow 2, 4, 8, 24 or 2, 6, 12, 24. Compatible child phase selectors compose within the retained Original Parent context. Structural Original Parent and payload color owner are separate concepts. The base image-wide color is a payload assignment.
This public build implements the supported selector geometry and the new payload inheritance policy. It does not ship private kernel coefficients, controller sequences, or the structural generator. Structural relationship-class masks are not being executed or credited as a measured source of savings here. The measured selectors are explicitly serialized.
References: Functional Operations Manual v1.0 Parts VII, VIII, XI and XIII; accepted scale-chart, kernel refinement, Controller-Braid and binding contracts. This prototype adds no canonical theorem or hardware result.
The expanded carrier has side 1152 and retained ordered expansion word (2, 2, 2, 2, 3). Its 2,304 complete native fibers each contain 576 seats. A selected phase pair fixes one fiber; native row and column identify samples at stride 48 across the full image.
All eight native scale charts are selectable. Green boundaries show the selected chart support; muted boundaries show a compatible nested branch. The pale trace connects a support center to the selected child as a selector illustration, not a network route. Layer colors follow the selected image tier; Final colors show the fully reconstructed payload. The inset uses the earlier demo’s toroidal coordinate projection with wrapped adjacency. It represents selected addresses, not a physical embedding or a validated low-depth routing simulation.
Clicking an image sample selects its fiber. Switching fibers retains the native seat. A contiguous image block and an interleaved fiber remain distinct selections of the same carrier.
Raw RGB is width × height × 3. Spatial-record bytes include the complete header and every color, selector, mask, tag and residual. The packed file optionally applies the browser’s standard DEFLATE implementation to that stream. The displayed file count is the actual downloadable byte length.
The ordinary control uses planar, reversible left-neighbor prediction followed by the same packing method. It helps separate general image coding from regional inheritance. Packed differences can differ from unpacked differences. Negative savings are shown as growth.
Browsers without CompressionStream retain the uncompressed stream. Memory used by source decoding, inspection indexes, textures and render buffers is not the encoded file size. No lossy color quantization is used.
Checks run when the image is encoded.
The decoder receives only the file bytes. It validates bounds, selectors, nonoverlapping masks, byte lengths and integrity checks. Every decoded source pixel is compared before the original compilation buffer is released. The HTML can reopen an exported stream without access to its source image.
FNV checks detect accidental corruption; they are not cryptographic authentication. Source JPEG decoding is browser dependent; losslessness refers to the exact RGB buffer used in this session.
A shared generative address space can give sender and receiver the same address interpretation. A future temporal format can reuse regional rules and values, transmit changed regions, and test deterministic movement descriptors against ordinary motion coding.
New payload information must still be delivered or already exist at the receiver. Cache identity, reference lifetimes, synchronization, random access and recovery need explicit protocol rules. Logical route depth does not by itself measure transmitted bytes, decoder work or network latency.
This release measures single-image spatial reconstruction. Temporal compression, image-to-image object routing, network streaming, physical copy elimination and competitive speed or energy gains are not implemented or claimed.