mirror of
https://github.com/bdbrown4/peltier.io.git
synced 2026-11-07 19:08:27 +00:00
Claude
328aafae77
Commit the spec and scaffold the system it describes:
- SPEC.md: the full v0.1 engineering spec
- crates/: trust-layer Rust workspace, unit-tested
- bench-runner: interleaved ABAB scheduling with discarded warm-ups,
deterministic bootstrap CIs over the ratio of medians,
CI-lower-bound accept rule, env fingerprinting, and a CLI with
compare + A/A self-test modes (A/A verified passing end-to-end)
- diff-test: gate outcome model, sha256 corpus pin verifier that
refuses on mismatch, per-target equivalence policy parser
(byte-identical default, explicit fp-tolerance opt-in)
- ledger: append-only SQLite attempt schema with UPDATE/DELETE
refused by triggers, anti-double-attempt query
- report: cores-saved and dollars/yr ROI math over speedup CIs,
pricing.toml inputs
- playbook/: classes 1-7 with preconditions, procedure, verification
notes, and known failure modes per class
- agent/: Python package skeleton — six-tool contract and prompting
spine, harness IPC deferred to Phase 1
- config/: accept.toml (2% threshold, 30 runs/side), pricing.toml
- targets/, corpora/, results/calibration/: layout and policy docs
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01EcKPWQ3MQD4NdEHwar96u2
2.2 KiB
2.2 KiB
Class 7 — Concurrency
Last in the order, highest risk. Every diff in this class routes to
needs-human-review (SPEC §8); the agent proposes, a human disposes.
Preconditions
- Profile signature: multithreaded target where wall time ≫ ideal
(cpu-time / cores); lock symbols (
futex,pthread_mutex,parking_lot) hot; run-queue latency; per-thread throughput that drops as threads are added. coz (Phase 3) is the right prioritizer here — cycle profiles mislead on blocked time.
Procedure (cheapest first)
- Shrink critical sections: move allocation, I/O, and computation out from under locks; drop guards early.
- Reduce sharing: per-thread accumulation + merge at the end beats a shared counter; sharding a hot map by key hash beats a fancier lock.
- Right-size the primitive:
RwLockfor read-mostly,OnceLockfor init-once, atomics for simple counters with explicitly justified orderings (start fromSeqCst; relax only with a written argument). - Lock-free structures: last resort, library-only (crossbeam), never hand-rolled, and only when the profile proves the lock is the bottleneck after 1–3.
Verification notes
- TSan gate is mandatory for this class, on both the upstream suite and the golden replay run (SPEC §3.2).
- Thread-count sweep: gates and bench at 1, 2, N, and 2N threads — concurrency bugs and wins are both thread-count-dependent.
- Nondeterministic output ordering (e.g. results gathered from threads) must be canonicalized at the boundary or the change rejected; replay equivalence is not negotiable to make a parallel win look clean.
Known failure modes
- Benchmarks too short to hit the contention window: a race that fires once per million ops passes 60s of fuzz. TSan + long soak, and still route to a human.
- Relaxed atomics that are correct on x86's strong model and wrong on ARM — orderings need an argument, not a test pass.
- Sharding that wins the benchmark's uniform key distribution and loses production's skewed one — holdout workloads (SPEC §11).
- Deadlocks introduced by lock-order changes that no gate exercises; the human reviewer checks lock ordering explicitly.