Home

CM

Church-Turing Meta-Machine

A Capability-Based Security Simulator

Kenneth J Hamer-Hodges

Kenneth J Hamer-Hodges

Author & CM Architect

Industrial Strength Computer Science

Welcome to the CM Simulator

The Church Machine (CM) is a 32-bit clean-start architecture devised by Kenneth J Hamer-Hodges, FIEE. It enforces failsafe security through Golden Tokens β€” capability keys that govern all access control.

This simulator combines Alonzo Church's Lambda Calculus with Alan Turing's computational model to demonstrate how capability-based security can eliminate entire classes of vulnerabilities, including buffer overflows, privilege escalation, and unauthorised access.

This is not computation on the dangerous, centralised von Neumann architecture where any flaw can compromise everything. Instead, Lambda Calculus abstractions, when built with CLOOMC, are anchored to the real world through capability-based hardware enforcement, creating a solid foundation as trustworthy as mathematics itself.

Malware thrives on today's vulnerable systems, enabling mass surveillance and paving the way for government dictatorship. In contrast, CLOOMC and Lambda Calculus are distributed atomically, supporting democracy and individual sovereignty for the endless future of civilisation.

πŸ”
Golden Tokens

Every access requires a valid capability token with explicit permissions

Ξ»
Lambda Calculus

Church's mathematical foundation for computation and recursion

βš™οΈ
Turing Machine

Complete instruction set for arithmetic, logic, and control flow

CLOOMC: Computing on Solid Ground

CLOOMC (Capability-Limited / Object-Oriented / Machine-Code) is a high-level machine programming language that enables media-tight computation - where both data and functions are protected by Golden Tokens at every level.

Unlike traditional systems built on the soft surface of sand - vulnerable to buffer overflows, injection attacks, ROP attacks, confused deputy attacks, and privilege escalation - CLOOMC abstractions are rooted in the hard surface of universal cyberspace.

CLOOMC is designed for the 32-bit clean-start CM β€” an architecture that replaces the legacy von Neumann model with eleven hardware-enforced Church instructions, each operating exclusively on Golden Tokens rather than raw memory addresses.

Lambda Calculus Examples

Y-Combinator (Fixed-Point Recursion)

Church Numerals

Church Booleans

HP-35 Calculator (RPN via Lambda Calculus)

GitHub
Boot Sequence:

Church Registers

Lambda Registers

CR15 (Namespace): NULL
CR8 (Thread): NULL
CR6 (C-List): NULL
CR7 (Nucleus): NULL
NIA: 0
Stack: 0 words

Turing Registers

0-7

Flags & Stack (0 words)

Turing:
N Negative
Z Zero
C Carry
V Overflow
Church:
P Perm OK
B Bounds OK
Stack is empty
Selected: None

Hardware Boot Namespace

11-slot hardware namespace (slots 0–10) β€” hardwired into the FPGA bitstream. Slot 8 is written by the bitstream at power-on. Boot the simulator to see live addresses.

Loading namespace…
Introduction to Capabilities ▾
Informational
Introduction to Capabilities
Golden Token Structure
Context & Data Registers
Security Boundaries
Performance Benefits
Remote Golden Tokens
Failsafe Security
Simulator
The Boot Sequence
Capability Operations
Lambda Combinators
Assembly Editor
Church Instructions Deep Dive
Branch Instructions
Church Indicators & TPERM
Capability Manager
Mint: The Capability Forge
Examples
Example Programs
Atomic Operations (LOADX/SAVEX)
Multiple Register Operations (LDM/STM)
LDI and TPERM Presets
Hello Mum: The Holy Grail
Step 1 of 5
Step 1 of 5

Instruction Visualizer

Watch data flow through registers as instructions execute

Source Registers

DR?
-
DR?
-
?
-

Destination

DR?
-

Condition Flags

N
Negative
Z
Zero
C
Carry
V
Overflow

Step-by-Step

Select an instruction and click Setup to begin

Context Register

C-List

Select a Golden Token

Click on any capability token to view its details

Click an abstraction with E permission in the Namespace hierarchy or Capabilities view to zoom in.
Select an abstraction to view its C-List entries
docs/instruction-set.md ↗ raw

Loading hardware reference…

Boot/Nucleus/program.asm [RX]
NIA: 0 Stack: 0 Ready
Line 1
1

Church Registers

Turing Registers

Flags

N Z C V
CM Assembly Editor Ready
Write code and click Run or Step to execute

Source Files

πŸ“ web/
πŸ“„ app.js ~430KB
πŸ“„ simulator.js ~26KB
πŸ“„ index.html ~44KB
πŸ“„ styles.css ~98KB
🐍 server.py ~2KB
πŸ“ docs/
πŸ“ figures/
Select a file to view

CM Simulator Source Code

Click on a file in the left panel to browse the source code.

~10,000 Lines in app.js
5 Source Files
~600KB Total Code
app.js - Main application: namespace objects, boot C-List, abstraction C-Lists, tutorials, examples, UI
simulator.js - Execution engine: instruction parsing, register operations, CALL/RETURN stack
index.html - Page structure: all views, modals, context menus
styles.css - Visual styling: dark theme, panels, animations
server.py - Simple HTTP server for local development
+ Add Child Object
✎ Edit Object
βœ• Remove Object
Insert Instruction
+ Arithmetic β–Ά
IADD DRd DRs DRt
IADD DRd DRs #imm
ISUB DRd DRs DRt
ISUB DRd DRs #imm
MCMP DRd DRs
MVN DRd DRs (pseudo)
β†’ Data movement β–Ά
IADD DRd DR0 #imm (load immediate)
DREAD DRd CRs #offset
DWRITE DRd CRs #offset
BFEXT DRd DRs #pos #width
BFINS DRd DRs #pos #width
WORD value
⟷ Shift β–Ά
SHL DRd DRs #amount
SHR DRd DRs #amount
SHR DRd DRs #amount ASR
β†· Branch β–Ά
BRANCH AL target
BRANCH EQ target
BRANCH NE target
BRANCH GT target
BRANCH LT target
πŸ”‘ Capability β–Ά
LOAD CRd CRs #row
SAVE CRd CRs #row
CALL CRs
RETURN
CHANGE CR12 CR12 #row
SWITCH CR15 CR6 #row
TPERM CRd preset
LAMBDA CRd
ELOADCALL CRd CRs #row
XLOADLAMBDA CRd CRs #row
β–  Control β–Ά
NOP
HALT
Ξ» Templates β–Ά
Y-Combinator (GT)
Factorial (recursive)
Church Booleans
Church Numerals
Pair (CONS/CAR/CDR)
Circle (PI constant)
Omega (non-termination)
Capability Check