PACT MACHINE DASHBOARD

PACT machine-001

Permanent Anchored Computation Theory on Bitcoin as the immutable machine.

This page shows a machine that lives on Bitcoin.

Not a simulation. Not a diagram.
Seven real inscriptions on Bitcoin mainnet — each one a permanent part of the machine.

The machine has memory. It has rules. It has state.
Every part of it can be checked by anyone, right now, on ordinals.com.

This is PACT — Permanent Anchored Computation Theory.
A semantic execution layer built on Ordinals and BST.

Ordinals give Bitcoin memory.
BST gives Bitcoin canonicity.
PACT gives Bitcoin computation.

The machine does not run inside Bitcoin.
Bitcoin holds the canonical record of everything the machine is.
Any reader who follows the PACT rules derives exactly the same execution.
Deterministic. Public. Immutable.

Turing proved a machine could think.
Von Neumann proved it could remember.
Nakamoto gave us the substrate.
Rodarmor gave it memory cells.
Blockamoto gave it meaning.
PACT is where they meet.

ANCHORS · BITCOIN MAINNET

Seven inscriptions define the bootstrap state.

Each object below is a permanent inscription. The machine can be inspected anchor by anchor, without trusting a middleware layer.

Genesis ✅

GENESIS

c1a9241e...i0

c1a9241e5d89d408e830a0248bdd885482c382eba449f5dd405bc40e501d8696i0

VIEW ON ORDINALS

Program ✅

PROGRAM

58b43e6a...i0

58b43e6ae1485137d27d8c113f4951c8a88f8173b7dc701413ee55de665b0a8fi0

VIEW ON ORDINALS

State ✅

STATE

7dfaeb26...i0

7dfaeb268d9c4e98708fbc7b9be296eac71378a5b419cd653e5f48c41e298774i0

VIEW ON ORDINALS

Memory ✅

MEMORY

cdb43fff...i0

cdb43ffffc381c209ccfe72f4c9107c973baa65043c414b38a5ebddbbb6175a4i0

VIEW ON ORDINALS

Transition ✅

TRANSITION r1

8270a763...i0

8270a763e38bee92d1236baec6e0e2857e9820107393078753f1058455eba1ddi0

VIEW ON ORDINALS

Transition ✅

TRANSITION r2

d623898e...i0

d623898e511f4aca6946744760612c87efb02aaf15f7a0acae62a68474b51748i0

VIEW ON ORDINALS

Transition ✅

TRANSITION r3

249e40ae...i0

249e40aebfceba345c4c8119c5daa791d38909783e8f75b46de3f7081bfd7b8di0

VIEW ON ORDINALS

TAPE · MEMORY CELLS

The machine memory is anchored as explicit cells.

cell:0 1

cell:1 0

cell:2 1

TRANSITIONS · EXECUTION RULES

The transition function is fixed and inspectable.

Each transition is a discrete rule from the bootstrap set. Read value, write value, move the head, and move to the next state.

RULE	FROM	READ	WRITE	MOVE	TO
r1	q0	1	0	RIGHT	q0
r2	q0	0	1	RIGHT	q0
r3	q0	∅	∅	STAY	HALT

STATUS · EXECUTION POINTER

Machine status

The bootstrap machine has now executed to completion. The final state, tape result, and halt condition are all anchored by trace inscriptions.

FINAL STATE

HALT

TAPE RESULT

[0, 1, 0, ∅]

STEPS EXECUTED

STATUS

COMPLETE

Execution

The machine ran. Four steps. Then HALT. Every step is a permanent inscription on Bitcoin.

Tape evolution

start 1 0 1 ∅

step 0 0 0 1 ∅

step 1 0 1 1 ∅

step 2 0 1 0 ∅

HALT 0 1 0 HALT

step 0

q0 + cell:0=1 → write 0, RIGHT, q0

head → cell:1

8e5d5966...i0 ✅

step 1

q0 + cell:1=0 → write 1, RIGHT, q0

head → cell:2

6b31baac...i0 ✅

step 2

q0 + cell:2=1 → write 0, RIGHT, q0

head → cell:3

a7c0c538...i0 ✅

step 3

q0 + cell:3=∅ → HALT

machine stopped

e9b6347f...i0 ✅

Complete registry

Eleven inscriptions. One machine. On Bitcoin. Forever.

GENESIS	c1a9241e...i0	↗
PROGRAM	58b43e6a...i0	↗
STATE	7dfaeb26...i0	↗
MEMORY	cdb43fff...i0	↗
TRANSITION r1	8270a763...i0	↗
TRANSITION r2	d623898e...i0	↗
TRANSITION r3	249e40ae...i0	↗
TRACE 0	8e5d5966...i0	↗
TRACE 1	6b31baac...i0	↗
TRACE 2	a7c0c538...i0	↗
TRACE 3 — HALT	e9b6347f...i0	↗

LAYERS · INTERPRETATION STACK

Three layers make the machine legible.

Ordinals (@rodarmor)

Memory. The bytes are permanent and addressable on Bitcoin.

BST (@blockamoto)

Canonicity. The protocol tells you how to read and prioritize state.

PACT

Computation. The anchored objects form a verifiable machine history.