JC Compute is an advanced formal computational model focusing on Authority-Constrained Deterministic Causal Computation. Its core principle is that computations can be defined as replayable reductions over causally ordered event histories, with strict bounds enforced by capability authority. This repository provides comprehensive components essential for implementing the model, detailed as follows:

Formal Theorems

The model includes six machine-checked theorems that validate its foundations:

Quick Start (JavaScript Runtime)

Example commands to quickly explore the application include:

npm install

# CLI demo
node src/cli.js --help
node src/cli.js domains
node src/cli.js run --domain financial-settlement

# Application server (port 3000)
npm run app:start

# Tests
npm test

# Benchmarks
npm run bench:kcr
npm run bench:frontier

Architecture Overview

The JC Compute architecture integrates components of history, reduction, capability, and projection:

JC Compute Formal Model
  (H, C, R, π, ⊔)

        History
           │
    Reduction (R)
           │
         State ──── Projection (π) ──── View
           │
    Merge (⊔) ◄──── Capability (C)
           │
    Fixed Point

Package Details

The repository includes various packages, each serving specific functionalities:

Domains Supported

The application layer of JC Compute offers various domain capabilities:

Protocol Properties

JC Compute is designed with deterministic principles ensuring:

• No randomness — Execution is fully deterministic.
• No clocks — Time-independence enhances reliability.
• No ordering assumptions — Convergence is maintained regardless of event delivery order.
• No consensus layer — Structural convergence achieved through Pareto merge.
• No privilege escalation — Capability preservation is formally guaranteed.

JC Compute presents a robust framework for developing reliable solutions for computational challenges across multiple domains.