Skip to content

ABI Layer 2: prove counter-node bound invariant + determinism — flagship Idris2 proof#38

Merged
hyperpolymath merged 1 commit into
mainfrom
claude/new-session-znxgm7
Jun 27, 2026
Merged

ABI Layer 2: prove counter-node bound invariant + determinism — flagship Idris2 proof#38
hyperpolymath merged 1 commit into
mainfrom
claude/new-session-znxgm7

Conversation

@hyperpolymath

Copy link
Copy Markdown
Owner

Summary

Raises lustreiser's Idris2 ABI to Layer 2 with its first flagship semantic proof. Lustreiser's headline is generating formally verified real-time embedded code via Lustre; the correctness obligation is a per-tick invariant preserved by the synchronous node. This models a saturating-counter node and proves its bound invariant is preserved across every tick (and across a run), with output determinism.

Mirrors the estate flagship-proof pattern: stream/node model, invariant-preservation lemmas, decWithinBound : Dec, certifier proven sound, negative control.

Changes

  • Adds src/interface/abi/Lustreiser/ABI/Semantics.idrCounterNode/WithinBound, stepPreservesBound/runPreservesBound, decWithinBound : Dec, certifyBoundSound, and negative control overflowNotWithinBound : Not (WithinBound (MkCounter 2 5)).
  • Registers the module in the ABI .ipkg.

RSR Quality Checklist

Required

  • Tests pass — ABI builds clean (see Testing)
  • Linter clean — zero warnings
  • No banned language patterns
  • No banned functions — genuine proof
  • SPDX headers present
  • No secrets

As Applicable

  • ABI/FFI changes validated — additive proof; FFI untouched

Testing

Verified with Idris2 0.7.0: idris2 --build lustreiser-abi.ipkg → exit 0, zero warnings. Adversarial check: a deliberately-false proof was rejected. build/ removed.

🤖 Generated with Claude Code

https://claude.ai/code/session_01A6PSzJWpRxtzGDjUCEh7Mx


Generated by Claude Code

Add Lustreiser.ABI.Semantics, raising the Idris2 ABI to Layer 2 with a
machine-checked flagship proof of the repo headline (formally verified
real-time embedded code via Lustre).

Faithful model: a synchronous saturating bounded-counter Lustre node with
Tick/Reset inputs, a static cap, and one-tick state memory; step/run give
the synchronous execution semantics.

Properties proven (no believe_me/postulate/assert):
- Invariant preservation per tick: WithinBound c -> WithinBound (step i c)
  for every input, lifted to whole runs via runPreservesBound (no overflow).
- Determinism (synchronous hypothesis): equal input streams from equal
  state yield equal output streams.
- Sound+complete Dec (decWithinBound) + sound certifier (certifyBoundSound).
- Positive controls (explicit witnesses, incl. a run that saturates) and a
  machine-checked negative control (overflowNotWithinBound) ensuring
  non-vacuity; a deliberately false witness is rejected by idris2.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01A6PSzJWpRxtzGDjUCEh7Mx
@hyperpolymath hyperpolymath marked this pull request as ready for review June 27, 2026 19:46
@hyperpolymath hyperpolymath merged commit 9af03a4 into main Jun 27, 2026
22 of 24 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants