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
44 lines
989 B
JSON
44 lines
989 B
JSON
{
|
|
"name": "HammingDistance",
|
|
"summary": "How many positions of two sequences of the same length hold different letters.",
|
|
"tags": [
|
|
"sequences",
|
|
"distance"
|
|
],
|
|
"sources": [
|
|
{
|
|
"title": "Hamming, Error detecting and error correcting codes, Bell System Technical Journal 29 (1950)"
|
|
}
|
|
],
|
|
"cases": [
|
|
{
|
|
"call": "HammingDistance(\"GATTACA\", \"GACTATA\")"
|
|
},
|
|
{
|
|
"call": "HammingDistance(\"\", \"\")"
|
|
},
|
|
{
|
|
"call": "HammingDistance(\"AAAA\", \"TTTT\")"
|
|
}
|
|
],
|
|
"references": [
|
|
{
|
|
"lang": "python",
|
|
"level": "plain",
|
|
"file": "ref/python/plain.py",
|
|
"note": "The same count."
|
|
},
|
|
{
|
|
"lang": "mojo",
|
|
"level": "plain",
|
|
"file": "ref/mojo/plain.mojo",
|
|
"note": "The same count in Mojo."
|
|
}
|
|
],
|
|
"proof": {
|
|
"lang": "dafny",
|
|
"file": "proof/hamming_distance.dfy",
|
|
"note": "The loop computes the number of mismatched positions, which lies in [0, |S|]."
|
|
}
|
|
}
|