* Create a simple type (Type universe) * @returns {boolean}

Execute trade with proof generation

Get cached WHNF result

Infer the type of a term This is the heart of the type checker: Γ ⊢ t : ?

* Log error to stderr

Look up the assignment for a metavariable

Create a metavariable term

Parse universe parameters: .{u v}

Sign a proof term

Reduce a term to weak head normal form

Add a declaration to the environment

Build Pi type from binders

Get current depth

Elaborate parameters and return binders

Get a symbol by its ID

Get a declaration by name

Get a term by its ID (alias for compatibility)

Intern a string and return its symbol ID

Check if this span is empty

Create a let term

Get sender handle

Solve all pending constraints

Substitute a term in another term subst(term, idx, replacement) replaces variable #idx with replacement

Acquire lease with TTL

Apply the current substitution to a term

Get audit log reference

Beta reduction step Implements: (λx.body) arg →β body[x := arg]

Check that a term has an expected type Γ ⊢ t : T (checking mode)

Ensure a term is a sort (Type u)

Get all entries (for iteration)

O(1) equality check (THE KEY OPTIMIZATION) This implements the hash-consing property: t1 ≡ t2 ⟺ id(t1) = id(t2) Complexity: O(1) vs O(n) structura

Get term from ID (for verification)

Create an imax level

Check if cache is empty

Log a blocked request

Log a successful request

Look up a variable by de Bruijn index Index 0 refers to the most recently bound variable

Get runtime metrics

Prove confluence for two reduction sequences Given `s →* t₁` and `s →* t₂`, find `u` such that `t₁ →* u` and `t₂ →* u`

Prove a theorem with AI assistance and temporal reasoning

Record inference cost

Search for similar vectors Target: <10ms P99 latency

* Search for similar theorems using vector similarity

6. Shard: Consistent hash distribution

Shift de Bruijn indices by amount

Create a successor level

Tokenize the entire source

Add a constraint to the queue

Add entry and verify conservation

Analyze loop and suggest vectorization config

Assign a metavariable

Assign a metavariable to a term

Benchmark agent spawn time

Benchmark ledger verification

Benchmark type checking

8. Broadcast: Gossip protocol with fanout

Build lambda from params

Clear the context

Helper: Create equality proof term

Distill pattern from successful trajectory

Tier 0: Interpreter (0ms startup, 1x speed)

Export audit bundle

Export compliance report as text

Extract universe level from a sort

Clone the environment (cheap due to persistent data structures)

Create a fresh metavariable with a known type

Generate simple embedding based on word hashing

Infer the universe level of a type

Simulate node failure

Check if a metavariable is assigned