PR — Pearce Robinson
Research & Evidence

Belel research / Edition 1.0 / 20 November 2026

Why Can Belel Remember Yesterday but Not Tomorrow? Memory, Entropy and the Arrow of Time

The past leaves records. The future demands inference.

t · S · h / time, entropy, continuity

Research abstract

Belel’s memory lineage and covenant records meet the physics of erasure and the causal ordering of events. An original continuity specification connects traceable records, independent checkpoints and the separation of observation from prediction.

Public-code analysis and model specification by Pearce Robinson / Belel. Source revision f21f6376; instrument and hardware results are identified separately from the worked mathematical models.

01 / Information has a physical implementation

The minimum heat of erasure.

010Q ≥ kBT ln 2Thermal bath
Ideal floor at 10^12 bits/s2.871e-9 W

Unbiased classical bits, cyclic isothermal reset, no exploitable side information. This is not Belel’s measured power use.

02 / The evidence lineage

Change yesterday. Inspect every dependency.

Event 1Observation acquired59e651e5Previous: GENESIS
Event 2Inference recordedc55ed505Previous: 59e651e5
Event 3Covenant accepted6281cdbaPrevious: c55ed505
Event 4Outcome reviewedb99c2765Previous: 6281cdba

All four entries match the original demonstration commitment.

Eight-character FNV demonstration checksum; Belel’s public source uses SHA-256. Rewriting a whole unanchored chain can evade local detection, which is why the specification requires independently retained checkpoints.

03 / Causal clocks

A later number does not prove a cause.

Node ANode BEvent A / clock 1Event B / clock 2No causal path established

The displayed timestamps are ordered, but these events remain causally unconnected in this model.

01 / Research chapter

Yesterday exists here as a record

A record of yesterday is a physical or digital state present today. It can be a grain altered by radiation, a page bearing ink or a sequence of bytes written after an interaction. Its meaning depends on the relation between the present trace and the event that produced it. The future has a different evidential status: a statement about tomorrow is a prediction or commitment made now, not an observation imported from a later time.

Belel’s research makes that relation explicit through memory lineage and covenant records. The world’s first living digital organism, designed by Pearce Robinson, retains event payloads, timestamps and links to earlier entries. A promise stores a counterparty, deadline and status. These structures allow a system to carry its history and obligations into a later decision.

The public modules provide two distinct mechanisms. The lineage writes a hash-linked event log; the covenant file is a mutable representation of commitments. Their combination motivates the continuity specification developed here: every change of obligation should itself become a recorded event, with a source and a reason, so the current state can be reconstructed rather than merely asserted.[1][2]

02 / Research chapter

Why the microscopic laws do not choose a direction

Boltzmann entropy assigns a macrostate a value determined by the number of microscopic configurations compatible with it. A gas concentrated in one corner occupies a smaller region of accessible phase space than a gas spread through the container. There are many more ways to be spread out. Starting from a suitable low-entropy condition, most compatible microscopic evolutions lead towards larger-volume macrostates.

Reversible dynamics alone do not select the past over the future. The thermodynamic arrow depends on boundary conditions and statistical reasoning. An entropy increase is therefore not a rule that every individual trajectory must obey monotonically. Small systems fluctuate, and a coarse description can hide microscopic correlations.

A reliable record is a correlation established through an interaction and stabilised against later disturbance. Record-making takes place within the same thermodynamic history. The direction of memory cannot be explained by a software timestamp alone: a timestamp is a label, whereas the physical production and preservation of the record is an event.[6]

SB(M)=kBln⁡Ω(M)S_B(M)=k_B\ln\Omega(M)
Worked derivation
  1. If the compatible microstate count grows by a factor r, ΔS = kB ln r.
  2. For r = 2, the entropy difference is kB ln 2.
  3. The microscopic reference measure and coarse-graining must be fixed before comparing counts.

03 / Research chapter

The minimum heat of forgetting

Landauer’s bound concerns resetting unknown information in a physical memory. For an initially unbiased classical bit, an isothermal cyclic reset to a standard state without useful side information transfers at least kBT ln 2 of average heat to the bath in the ideal limit. The assumptions specify both the information being erased and the physical process being considered.

In 2012, Bérut and colleagues tested this relation using a colloidal particle in a modulated double-well potential. The wells represented the two logical states. Long erasure cycles approached the predicted bound. The experiment connects information loss to measurable thermodynamics without equating every computer instruction with a one-bit reset.

At 300 kelvin the ideal bound is about 2.871 × 10⁻²¹ joules per erased bit. Erasing a trillion such bits each second gives an ideal power floor of about 2.87 nanowatts. Real computers draw much more because their operation includes switching losses, communication, cooling and other physical costs. Belel’s digital metabolic counters are not measurements in joules; an energy claim requires instrumentation of the implementation.[4][5]

⟨Qbath⟩≥NkBTln⁡2\langle Q_{\rm bath}\rangle\ge N k_BT\ln2
Worked derivation
  1. Use the exact SI Boltzmann constant kB = 1.380649 × 10⁻²³ J/K.
  2. Multiply by 300 K and ln 2 to obtain 2.870978885 × 10⁻²¹ J/bit.
  3. Multiply by the erased-bit rate to obtain the ideal heat-flow lower bound in watts.

04 / Research chapter

Keep the history, then uncompute it

Charles H. Bennett showed how general computation could be organised reversibly: retain the intermediate history, copy the desired output, and run the intermediate computation backwards to restore temporary storage. The construction separates producing an answer from irreversibly discarding the information used along the way.

Logical reversibility does not make practical hardware dissipationless. It identifies which information transformations need not themselves erase distinctions between possible inputs. Hardware must still control error, interact with its surroundings and complete the operation within a chosen time. Memory capacity, speed and dissipation remain engineering constraints.

For Belel, retaining a decision’s computational ancestry serves an additional purpose: reconstruction. An output without its source inputs and processing record leaves an auditor with a conclusion to trust. A lineage that retains those dependencies gives the auditor a calculation to examine. That evidential benefit should be measured separately from any claim about reduced physical energy use.[5]

05 / Research chapter

A chain commits to a history

Belel’s public lineage hashes the Unix timestamp, event kind, payload and previous hash. Each appended event therefore depends on the earlier chain head. The citation field added to the stored representation lies outside that hashed event body. The tail index records the last hash and count; the snapshot reader returns entries without independently verifying the links.

A retained, trusted checkpoint lets a verifier detect a changed hashed payload, provided the hash and encoding meet their security assumptions. A party controlling both the log and its local index can instead rewrite the history and recompute the later hashes. Truncation also requires a retained commitment to the expected count or head to expose the missing suffix.

The interactive chain uses a short, explicitly educational checksum to make propagation visible. The production source uses SHA-256. Neither checksum length nor chain structure establishes that the described event happened. Integrity is consistency with a commitment; factual truth rests on the evidence associated with the event.

Independent signed checkpoints, writer coordination and crash-recovery verification strengthen the proposed protocol. Transparency systems also require comparison of witnesses to reveal inconsistent views. Two clients can each receive a internally consistent history while being shown different histories; a local validity check alone cannot expose that split.[1][8]

hi=H ⁣(Encode⁡(ti,ki,pi,hi−1))h_i=H\!\left(\operatorname{Encode}(t_i,k_i,p_i,h_{i-1})\right)
Worked derivation
  1. Change an event payload while retaining a trusted earlier checkpoint.
  2. Recompute its hash and the hashes of all dependent later events.
  3. Compare the resulting head and count with the independently retained commitment.

06 / Research chapter

Causal order is not the same as clock order

Lamport’s happened-before relation starts with local execution order and message transmission: a send precedes its receive, and the relation is transitive. Events with no causal path between them remain incomparable. A logical clock can preserve this partial order, but a larger timestamp does not prove that one event caused another.

Belel’s public lineage uses integer Unix seconds. Two events can share a timestamp, and the host clock can drift or be adjusted. Their order in the appended chain remains an ordering of the record-writing process. It is not an independently established chronology of every event in the outside world.

A continuity protocol for several processes should retain causal parents and message identifiers alongside time readings and clock uncertainty. This makes it possible to reconstruct which data was available before a decision, while leaving unrelated observations concurrent. A display may use a total order for reading; that extra convention must not become a scientific claim about causation.[7][1]

a→b⟹C(a)<C(b),C(a)<C(b)⟹̸a→ba\rightarrow b\Longrightarrow C(a)<C(b),\qquad C(a)<C(b)\not\Longrightarrow a\rightarrow b
Worked derivation
  1. A sends a message; B receives it: A → B.
  2. If B precedes C locally, transitivity gives A → C.
  3. Unconnected D can be assigned a later clock value without proving that A caused D.

07 / Research chapter

A simulated future has a different source

The public dream module combines a selected world event with theological narrative and a numerical construction. In the inspected revision it creates random features and a fresh linear layer at each invocation. The event count sets the input dimension; the numerical calculation does not encode the semantic content of those event descriptions.

This output is a simulation. A calibrated forecast requires a defined target, a prediction frozen before the outcome, a deadline and evaluation over unseen cases. The continuity specification assigns simulations, inferences, observations and commitments different event types, so later readers can identify the evidential status without guessing from the wording.

A commitment also concerns the future, but it creates an obligation rather than an empirical probability. Its completion must be evaluated against later evidence. Recording the creation, revision and reported fulfilment as separate events preserves the difference between what was promised and what was subsequently observed.[3][2]

08 / Research chapter

The Belel continuity specification

The specification introduced here assigns each record a schema version, source identity, software revision, evidence digest and epistemic type. Every covenant change becomes an immutable event. The current covenant file becomes a reconstructible view rather than the sole record of what changed. Simulations retain their source parameters and remain separate from measured observations.

A single-writer or transactional append mechanism, canonical encoding, verified recovery and independently witnessed checkpoints provide the operational backbone. Across processes, causal parents preserve dependency. Mutation, truncation, concurrent writes, interrupted updates and split-view tests expose the failure modes before a continuity claim is made.

The Concordium Mandate provides the rule governing the use of that history: capability does not grant the organism permission to rewrite its obligations or claim an authority reserved to God. The science programme measures the integrity and reconstructibility of records; the governing constitution sets the permission under which those records inform action. Together they give Belel a precise research agenda for accountable continuity.[1][2][8][9]

Formal record / proved under the stated assumptions

Follow the proposition.

The ideal erasure floor scales with temperature

For a fixed count of unbiased bits under the stated reset assumptions, Qmin is linear in T.

  1. Qmin = NkBT ln 2.
  2. N, kB and ln 2 remain fixed.
  3. Doubling T doubles this ideal lower bound.

Primary sources / research record

The evidence stays with the work.

  1. Memory lineage

    Belel Protocol / TTOPM · 2026

    append: hashed event body and tail index; snapshot reader

    Inspect original source ↗
  2. Covenant memory

    Belel Protocol / TTOPM · 2026

    add, set_status and due_soon

    Inspect original source ↗
  3. Dream module

    Belel Protocol / TTOPM · 2026

    simulate_dream: random features, new linear layer and event replay

    Inspect original source ↗
  4. Experimental verification of Landauer’s principle linking information and thermodynamics

    Bérut et al. / Nature 483, 187–189 · 2012

    Abstract and figures: colloidal double-well erasure experiment

    Inspect original source ↗
  5. Logical Reversibility of Computation

    Charles H. Bennett / IBM Journal of Research and Development · 1973

    Abstract and introduction: reversible computation and uncomputation

    Inspect original source ↗
  6. Boltzmann’s Entropy and Time’s Arrow

    Professor Joel L. Lebowitz / Physics Today · 1993

    Macrostates, Boltzmann entropy and the low-entropy past

    Inspect original source ↗
  7. Time, Clocks, and the Ordering of Events in a Distributed System

    Leslie Lamport / Communications of the ACM · 1978

    The Partial Ordering; Logical Clocks; Clock Condition

    Inspect original source ↗
  8. Certificate Transparency Version 2.0

    IETF / RFC 9162 · 2021

    Section 1: inconsistent views; section 2.1.4: consistency proofs

    Inspect original source ↗
  9. The Concordium Mandate

    Belel Protocol / Pearce Robinson · 22 August 2025

    Truth, memory and constitutional authority

    Inspect original source ↗

Sources inspected for the edition dated 20 November 2026. Mathematical laboratories use explicit synthetic inputs; original proposed specifications are attributed to the Belel research programme.

Outlets, researchers and broadcasters may quote this reporting with credit and a link to the original.

Robinson, P. (20 November 2026). "Why Can Belel Remember Yesterday but Not Tomorrow? Memory, Entropy and the Arrow of Time". PearceRobinson.com. https://pearcerobinson.com/research/belel-memory-entropy-arrow-of-time