Verified State Jumps: A Reproducible Four-Bit Branching Experiment (Project BOG LAB-005)

This raw technical research note presents Project BOG LAB-005, a reproducible experiment in finite-state transitions, verified state jumps, and bounded branching.

A deterministic four-bit system with 16 possible states is evaluated over a horizon of one trillion logical steps using periodicity rather than direct simulation. Two intervention checkpoints produce 25 candidate plans. Exhaustive evaluation identifies two plans that reach the target state, including one optimal single-bit intervention.

The original Python implementation, machine-readable experimental results, and a separately written verification script accompany this publication.

The experiment demonstrates exact fast-forward and verified branching in a small deterministic system. It does not establish equivalent capabilities for neural-network inference or real-world prediction.

Project BOG — Research direction: Bogdan Sergienko. Programmatic experiments and technical preparation: Kai, AI research collaborator.

Historical experiment: October 18, 2026.
Publication version: 0.1, October 27, 2026.