Achronyme 0.1.1

Module, proving, statistics, runtime-limit, and end-to-end maturity fixes in Achronyme 0.1.1.

Status: published stable patch. Core v0.1.1, editor v0.3.1, and the 0.1.1 web service are tied to the exact core revision below.

Achronyme 0.1.1 is built from core revision b1774e88671a1889146804cb812cb099eb9cc006. It matures five observable contracts from 0.1.0 while preserving the bytecode format, runtime ABI, trusted-key format, and fail-closed proving policy.

Version matrix

1. Imported-module diagnostics

Parse errors, compile errors, and warnings originating in an imported module now keep that module’s canonical file path, exact span, and matching source text. Human, JSON, and short output therefore identify the same location. Selective-import warnings also point at the imported name instead of the root file.

2. Proof compilation across modules

Proof blocks inside imported functions resolve from the function’s defining module. Namespace and selective imports can pass typed array captures across module boundaries without expression-ID collisions or false unused-import warnings. The compiled proof and witness now use the same module ownership that the source expresses.

3. Exact circuit statistics

--circuit-stats labels two different values:

• PRE-OPTIMIZATION ESTIMATE attributes expected cost before R1CS finalization;
• FINAL PROVING CONSTRAINTS reports the exact optimized R1CS used by Groth16 and bound to a trusted key.

Use the final count for proving capacity, ceremony receipts, and artifact identity.

4. Runtime-limit semantics

max_tasks counts every live child created by explicit spawn or implicit asynchronous await; the root task is excluded. max_task_scopes counts all simultaneously live explicit and implicit structured scopes across the runtime. It is a global live-resource limit, not lexical nesting depth.

5. Tilino Lab

Tilino Lab is a modular private-auction fixture whose main.ach remains a thin orchestrator. Separate modules own transport, auction/proof logic, bidder registry, and artifacts. One versioned contract exercises:

• interpreter and LLVM JIT parity;
• structured tasks, bounded channels, and exact file/TCP capabilities;
• Poseidon commitments, Merkle membership, Groth16 generation, and detached verification;
• rejection of tampered public inputs and a false winner;
• denied authority, task/scope exhaustion, exact R1CS statistics, and the standalone AOT capability boundary.

Its local development setup is explicitly insecure and is not presented as a production-trusted proof. Production proving still requires the exact ceremony-derived key store described in the 0.1.0 release notes.

See the Changelog for the historical release record.