Start pplus-library: 16 verified routines in six modules

Routines written once in pseudo and checked at every level, so programs
can use them by name instead of rewriting and re-verifying them:

- stats: Mean, Variance (two-pass)
- numerics: KahanSum, LinearInterp, Trapezoid
- align: LinearGapPenalty, AffineGapPenalty, MatchScore,
  NeedlemanWunschScore
- md: LennardJones, LennardJonesForce, MinimumImage, PairDistance
- seq: GCContent, HammingDistance
- special: ErfApprox (Abramowitz and Stegun 7.1.26)

Each has contracts, cases, reference implementations in Python, Mojo
and (for the numerical ones) C at more than one level, and nine have a
Dafny proof over exact numbers. status.json and STATUS.md are written by
pplus-core's library-check: every check passes or is open/unverified as
listed there. The Mojo references still need the pinned compiler's
answers (library-verify-mojo, network).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
This commit is contained in:
alexmandClaude committed 2026-10-05 11:58:22 +00:00
commit df12b2a008
103 files changed
+3025

No files matched your search

@@ -0,0 +1,29 @@
method AffineGapPenalty(length: int, open: int, extend: int) returns (result: int)
requires length >= 1
ensures result == open + (length - 1) * extend
{
result := open + (length - 1) * extend;
}
// Position by position: the first position opens the gap, every later one extends it.
method AffineByPositions(length: int, open: int, extend: int) returns (score: int)
requires length >= 1
ensures score == open + (length - 1) * extend
{
score := open;
var i := 1;
while i < length
invariant 1 <= i <= length
invariant score == open + (i - 1) * extend
{
score := score + extend;
i := i + 1;
}
}
// With the same score for opening and extending, the affine model is the linear one.
lemma AffineIsLinearWhenEqual(length: int, gap: int)
requires length >= 1
ensures gap + (length - 1) * gap == length * gap
{
}