The universe is modelled as a closed informational system with a fixed total bit count n. From Paper III [meskanen2003], random bit-flip mutations drive the system from a zero-entropy initial state toward full equilibrium, and filters applied to the evolving bitstring extract hierarchical micro-structures whose abundances follow lognormal-like distributions.
At any moment, the n bits are partitioned between two roles:
Because the bit budget is fixed, matter structures do not represent new information injected from outside. Every bit locked into a composite entity is a bit withdrawn from the free fabric. Information is strictly conserved:
| (1) |
where m(t) = ∑ kwk ⋅k(t) is the total number of bits consumed by matter structures, k(t) is the count of composite entities at each level, and wk is the bit-width of a level-k structure.
An internal observer can only measure distances using the structures available within the system. The resolution of observable space is therefore the total count of independently addressable entities — both free fabric tokens and composite matter structures.
Consider n bits, all initially free fabric, giving resolution n. When one composite structure of width w bits emerges, w fabric tokens are consumed and one matter entity is created. The new resolution is:
Resolution decreases by w − 1 for every composite entity formed. Generalising, if matter structures collectively consume m(t) bits and produce k(t) composite entities, the total resolution at time t is:
The two extremes of General Relativity follow immediately from this counting argument:
These are not boundary conditions imposed by hand. They are the two extreme values of the same counting equation, separated by the continuous family of states in between.
The relational scale factor, normalised to the maximum resolution n, is:
| (2) |
This definition requires no external metric and no postulated background geometry. It is a pure counting statement: the scale factor is the fraction of the bit budget that remains independently addressable.
The equation is intrinsically 1D and linear. To map to observable 3D sphere geometry:
This converts the linear bit-depletion curve into sperical and quadric cos2-shaped Schwarzschild interior profile.