CharlesCNorton commited on
Commit ·
1e96b5b
1
Parent(s): 9847b25
Add unified eval.py consolidating iron_eval and comprehensive_eval
Browse files- Single evaluator with GPU-batched speed AND per-circuit reporting
- Exports load_model(), create_population(), BatchedFitnessEvaluator for prune_weights.py
- Reads signal_registry from safetensors metadata (no routing.json dependency)
- 5,282 tests covering all circuit categories at 100% fitness
- ~50ms evaluation time on CPU
- Update README TODO to reflect completed consolidation
README.md
CHANGED
|
@@ -484,14 +484,14 @@ The interface generalizes to **all** 65,536 8-bit additions once trained—no me
|
|
| 484 |
|
| 485 |
- [x] Deprecate `routing.json` — routing info now embedded in safetensors via `.inputs` tensors
|
| 486 |
- [x] Remove `routing/` folder (schema docs moved to `build.py` docstring)
|
| 487 |
-
- [
|
| 488 |
-
- [
|
| 489 |
-
- [
|
| 490 |
-
- [
|
| 491 |
-
- [
|
| 492 |
-
|
| 493 |
-
- [ ]
|
| 494 |
-
- [ ]
|
| 495 |
|
| 496 |
---
|
| 497 |
|
|
|
|
| 484 |
|
| 485 |
- [x] Deprecate `routing.json` — routing info now embedded in safetensors via `.inputs` tensors
|
| 486 |
- [x] Remove `routing/` folder (schema docs moved to `build.py` docstring)
|
| 487 |
+
- [x] Consolidate eval scripts into unified `eval.py`:
|
| 488 |
+
- [x] Merge `iron_eval.py` (4533 lines) — GPU-batched fitness for evolution
|
| 489 |
+
- [x] Merge `comprehensive_eval.py` (3224 lines) — per-circuit correctness testing
|
| 490 |
+
- [x] Extract shared utilities: `heaviside()`, `load_model()`, `create_population()`
|
| 491 |
+
- [x] Unified evaluation with both batched speed and per-circuit reporting
|
| 492 |
+
- [x] Read signal registry from safetensors metadata instead of routing.json
|
| 493 |
+
- [ ] Remove `eval/` folder (legacy scripts, now superseded by root `eval.py`)
|
| 494 |
+
- [ ] Integrate pruning into `eval.py` or update `prune_weights.py` to import from `eval.py`
|
| 495 |
|
| 496 |
---
|
| 497 |
|
eval.py
ADDED
|
@@ -0,0 +1,1527 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
Unified Evaluation Suite for 8-bit Threshold Computer
|
| 3 |
+
======================================================
|
| 4 |
+
GPU-batched evaluation with per-circuit reporting.
|
| 5 |
+
|
| 6 |
+
Usage:
|
| 7 |
+
python eval.py # Run evaluation
|
| 8 |
+
python eval.py --device cpu # CPU mode
|
| 9 |
+
python eval.py --pop_size 1000 # Population mode for evolution
|
| 10 |
+
|
| 11 |
+
API (for prune_weights.py):
|
| 12 |
+
from eval import load_model, create_population, BatchedFitnessEvaluator
|
| 13 |
+
"""
|
| 14 |
+
|
| 15 |
+
import argparse
|
| 16 |
+
import json
|
| 17 |
+
import os
|
| 18 |
+
import time
|
| 19 |
+
from collections import defaultdict
|
| 20 |
+
from dataclasses import dataclass, field
|
| 21 |
+
from typing import Callable, Dict, List, Optional, Tuple
|
| 22 |
+
|
| 23 |
+
import torch
|
| 24 |
+
from safetensors import safe_open
|
| 25 |
+
|
| 26 |
+
|
| 27 |
+
MODEL_PATH = os.path.join(os.path.dirname(__file__), "neural_computer.safetensors")
|
| 28 |
+
|
| 29 |
+
|
| 30 |
+
@dataclass
|
| 31 |
+
class CircuitResult:
|
| 32 |
+
"""Result for a single circuit test."""
|
| 33 |
+
name: str
|
| 34 |
+
passed: int
|
| 35 |
+
total: int
|
| 36 |
+
failures: List[Tuple] = field(default_factory=list)
|
| 37 |
+
|
| 38 |
+
@property
|
| 39 |
+
def success(self) -> bool:
|
| 40 |
+
return self.passed == self.total
|
| 41 |
+
|
| 42 |
+
@property
|
| 43 |
+
def rate(self) -> float:
|
| 44 |
+
return self.passed / self.total if self.total > 0 else 0.0
|
| 45 |
+
|
| 46 |
+
|
| 47 |
+
def heaviside(x: torch.Tensor) -> torch.Tensor:
|
| 48 |
+
"""Threshold activation: 1 if x >= 0, else 0."""
|
| 49 |
+
return (x >= 0).float()
|
| 50 |
+
|
| 51 |
+
|
| 52 |
+
def load_model(path: str = MODEL_PATH) -> Dict[str, torch.Tensor]:
|
| 53 |
+
"""Load model tensors from safetensors."""
|
| 54 |
+
with safe_open(path, framework='pt') as f:
|
| 55 |
+
return {name: f.get_tensor(name).float() for name in f.keys()}
|
| 56 |
+
|
| 57 |
+
|
| 58 |
+
def load_metadata(path: str = MODEL_PATH) -> Dict:
|
| 59 |
+
"""Load metadata from safetensors (includes signal_registry)."""
|
| 60 |
+
with safe_open(path, framework='pt') as f:
|
| 61 |
+
meta = f.metadata()
|
| 62 |
+
if meta and 'signal_registry' in meta:
|
| 63 |
+
return {'signal_registry': json.loads(meta['signal_registry'])}
|
| 64 |
+
return {'signal_registry': {}}
|
| 65 |
+
|
| 66 |
+
|
| 67 |
+
def create_population(
|
| 68 |
+
base_tensors: Dict[str, torch.Tensor],
|
| 69 |
+
pop_size: int,
|
| 70 |
+
device: str = 'cuda'
|
| 71 |
+
) -> Dict[str, torch.Tensor]:
|
| 72 |
+
"""Replicate base tensors for batched population evaluation."""
|
| 73 |
+
return {
|
| 74 |
+
name: tensor.unsqueeze(0).expand(pop_size, *tensor.shape).clone().to(device)
|
| 75 |
+
for name, tensor in base_tensors.items()
|
| 76 |
+
}
|
| 77 |
+
|
| 78 |
+
|
| 79 |
+
class BatchedFitnessEvaluator:
|
| 80 |
+
"""
|
| 81 |
+
GPU-batched fitness evaluator with per-circuit reporting.
|
| 82 |
+
Tests all circuits comprehensively.
|
| 83 |
+
"""
|
| 84 |
+
|
| 85 |
+
def __init__(self, device: str = 'cuda', model_path: str = MODEL_PATH):
|
| 86 |
+
self.device = device
|
| 87 |
+
self.model_path = model_path
|
| 88 |
+
self.metadata = load_metadata(model_path)
|
| 89 |
+
self.signal_registry = self.metadata.get('signal_registry', {})
|
| 90 |
+
self.results: List[CircuitResult] = []
|
| 91 |
+
self.category_scores: Dict[str, Tuple[float, int]] = {}
|
| 92 |
+
self.total_tests = 0
|
| 93 |
+
self._setup_tests()
|
| 94 |
+
|
| 95 |
+
def _setup_tests(self):
|
| 96 |
+
"""Pre-compute test vectors on device."""
|
| 97 |
+
d = self.device
|
| 98 |
+
|
| 99 |
+
# 2-input truth table [4, 2]
|
| 100 |
+
self.tt2 = torch.tensor(
|
| 101 |
+
[[0, 0], [0, 1], [1, 0], [1, 1]],
|
| 102 |
+
device=d, dtype=torch.float32
|
| 103 |
+
)
|
| 104 |
+
|
| 105 |
+
# 3-input truth table [8, 3]
|
| 106 |
+
self.tt3 = torch.tensor([
|
| 107 |
+
[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1],
|
| 108 |
+
[1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1]
|
| 109 |
+
], device=d, dtype=torch.float32)
|
| 110 |
+
|
| 111 |
+
# Boolean gate expected outputs
|
| 112 |
+
self.expected = {
|
| 113 |
+
'and': torch.tensor([0, 0, 0, 1], device=d, dtype=torch.float32),
|
| 114 |
+
'or': torch.tensor([0, 1, 1, 1], device=d, dtype=torch.float32),
|
| 115 |
+
'nand': torch.tensor([1, 1, 1, 0], device=d, dtype=torch.float32),
|
| 116 |
+
'nor': torch.tensor([1, 0, 0, 0], device=d, dtype=torch.float32),
|
| 117 |
+
'xor': torch.tensor([0, 1, 1, 0], device=d, dtype=torch.float32),
|
| 118 |
+
'xnor': torch.tensor([1, 0, 0, 1], device=d, dtype=torch.float32),
|
| 119 |
+
'implies': torch.tensor([1, 1, 0, 1], device=d, dtype=torch.float32),
|
| 120 |
+
'biimplies': torch.tensor([1, 0, 0, 1], device=d, dtype=torch.float32),
|
| 121 |
+
'not': torch.tensor([1, 0], device=d, dtype=torch.float32),
|
| 122 |
+
'ha_sum': torch.tensor([0, 1, 1, 0], device=d, dtype=torch.float32),
|
| 123 |
+
'ha_carry': torch.tensor([0, 0, 0, 1], device=d, dtype=torch.float32),
|
| 124 |
+
'fa_sum': torch.tensor([0, 1, 1, 0, 1, 0, 0, 1], device=d, dtype=torch.float32),
|
| 125 |
+
'fa_cout': torch.tensor([0, 0, 0, 1, 0, 1, 1, 1], device=d, dtype=torch.float32),
|
| 126 |
+
}
|
| 127 |
+
|
| 128 |
+
# NOT gate inputs
|
| 129 |
+
self.not_inputs = torch.tensor([[0], [1]], device=d, dtype=torch.float32)
|
| 130 |
+
|
| 131 |
+
# 8-bit test values
|
| 132 |
+
self.test_8bit = torch.tensor([
|
| 133 |
+
0, 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128, 255,
|
| 134 |
+
0b10101010, 0b01010101, 0b11110000, 0b00001111,
|
| 135 |
+
0b11001100, 0b00110011, 0b10000001, 0b01111110
|
| 136 |
+
], device=d, dtype=torch.long)
|
| 137 |
+
|
| 138 |
+
# Bit representations [num_vals, 8]
|
| 139 |
+
self.test_8bit_bits = torch.stack([
|
| 140 |
+
((self.test_8bit >> (7 - i)) & 1).float() for i in range(8)
|
| 141 |
+
], dim=1)
|
| 142 |
+
|
| 143 |
+
# Comparator test pairs
|
| 144 |
+
comp_tests = [
|
| 145 |
+
(0, 0), (1, 0), (0, 1), (5, 3), (3, 5), (5, 5),
|
| 146 |
+
(255, 0), (0, 255), (128, 127), (127, 128),
|
| 147 |
+
(100, 99), (99, 100), (64, 32), (32, 64),
|
| 148 |
+
(1, 1), (254, 255), (255, 254), (128, 128),
|
| 149 |
+
(0, 128), (128, 0), (64, 64), (192, 192),
|
| 150 |
+
(15, 16), (16, 15), (240, 239), (239, 240),
|
| 151 |
+
(85, 170), (170, 85), (0xAA, 0x55), (0x55, 0xAA),
|
| 152 |
+
(0x0F, 0xF0), (0xF0, 0x0F), (0x33, 0xCC), (0xCC, 0x33),
|
| 153 |
+
(2, 3), (3, 2), (126, 127), (127, 126),
|
| 154 |
+
(129, 128), (128, 129), (200, 199), (199, 200),
|
| 155 |
+
(50, 51), (51, 50), (10, 20), (20, 10),
|
| 156 |
+
(100, 100), (200, 200), (77, 77), (0, 0)
|
| 157 |
+
]
|
| 158 |
+
self.comp_a = torch.tensor([c[0] for c in comp_tests], device=d, dtype=torch.long)
|
| 159 |
+
self.comp_b = torch.tensor([c[1] for c in comp_tests], device=d, dtype=torch.long)
|
| 160 |
+
|
| 161 |
+
# Modular test range
|
| 162 |
+
self.mod_test = torch.arange(256, device=d, dtype=torch.long)
|
| 163 |
+
|
| 164 |
+
def _record(self, name: str, passed: int, total: int, failures: List[Tuple] = None):
|
| 165 |
+
"""Record a circuit test result."""
|
| 166 |
+
self.results.append(CircuitResult(
|
| 167 |
+
name=name,
|
| 168 |
+
passed=passed,
|
| 169 |
+
total=total,
|
| 170 |
+
failures=failures or []
|
| 171 |
+
))
|
| 172 |
+
|
| 173 |
+
# =========================================================================
|
| 174 |
+
# BOOLEAN GATES
|
| 175 |
+
# =========================================================================
|
| 176 |
+
|
| 177 |
+
def _test_single_gate(self, pop: Dict, prefix: str, inputs: torch.Tensor,
|
| 178 |
+
expected: torch.Tensor) -> torch.Tensor:
|
| 179 |
+
"""Test single-layer gate (AND, OR, NAND, NOR, IMPLIES)."""
|
| 180 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 181 |
+
w = pop[f'{prefix}.weight']
|
| 182 |
+
b = pop[f'{prefix}.bias']
|
| 183 |
+
|
| 184 |
+
# [num_tests, pop_size]
|
| 185 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 186 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 187 |
+
|
| 188 |
+
failures = []
|
| 189 |
+
if pop_size == 1:
|
| 190 |
+
for i, (inp, exp, got) in enumerate(zip(inputs, expected, out[:, 0])):
|
| 191 |
+
if exp.item() != got.item():
|
| 192 |
+
failures.append((inp.tolist(), exp.item(), got.item()))
|
| 193 |
+
|
| 194 |
+
self._record(prefix, int(correct[0].item()), len(expected), failures)
|
| 195 |
+
return correct
|
| 196 |
+
|
| 197 |
+
def _test_twolayer_gate(self, pop: Dict, prefix: str, inputs: torch.Tensor,
|
| 198 |
+
expected: torch.Tensor) -> torch.Tensor:
|
| 199 |
+
"""Test two-layer gate (XOR, XNOR, BIIMPLIES)."""
|
| 200 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 201 |
+
|
| 202 |
+
# Layer 1
|
| 203 |
+
w1_n1 = pop[f'{prefix}.layer1.neuron1.weight']
|
| 204 |
+
b1_n1 = pop[f'{prefix}.layer1.neuron1.bias']
|
| 205 |
+
w1_n2 = pop[f'{prefix}.layer1.neuron2.weight']
|
| 206 |
+
b1_n2 = pop[f'{prefix}.layer1.neuron2.bias']
|
| 207 |
+
|
| 208 |
+
h1 = heaviside(inputs @ w1_n1.view(pop_size, -1).T + b1_n1.view(pop_size))
|
| 209 |
+
h2 = heaviside(inputs @ w1_n2.view(pop_size, -1).T + b1_n2.view(pop_size))
|
| 210 |
+
hidden = torch.stack([h1, h2], dim=-1)
|
| 211 |
+
|
| 212 |
+
# Layer 2
|
| 213 |
+
w2 = pop[f'{prefix}.layer2.weight']
|
| 214 |
+
b2 = pop[f'{prefix}.layer2.bias']
|
| 215 |
+
out = heaviside((hidden * w2.view(pop_size, 1, 2)).sum(-1) + b2.view(pop_size))
|
| 216 |
+
|
| 217 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 218 |
+
|
| 219 |
+
failures = []
|
| 220 |
+
if pop_size == 1:
|
| 221 |
+
for i, (inp, exp, got) in enumerate(zip(inputs, expected, out[:, 0])):
|
| 222 |
+
if exp.item() != got.item():
|
| 223 |
+
failures.append((inp.tolist(), exp.item(), got.item()))
|
| 224 |
+
|
| 225 |
+
self._record(prefix, int(correct[0].item()), len(expected), failures)
|
| 226 |
+
return correct
|
| 227 |
+
|
| 228 |
+
def _test_xor_ornand(self, pop: Dict, prefix: str, inputs: torch.Tensor,
|
| 229 |
+
expected: torch.Tensor) -> torch.Tensor:
|
| 230 |
+
"""Test XOR with or/nand layer naming."""
|
| 231 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 232 |
+
|
| 233 |
+
w_or = pop[f'{prefix}.layer1.or.weight']
|
| 234 |
+
b_or = pop[f'{prefix}.layer1.or.bias']
|
| 235 |
+
w_nand = pop[f'{prefix}.layer1.nand.weight']
|
| 236 |
+
b_nand = pop[f'{prefix}.layer1.nand.bias']
|
| 237 |
+
|
| 238 |
+
h_or = heaviside(inputs @ w_or.view(pop_size, -1).T + b_or.view(pop_size))
|
| 239 |
+
h_nand = heaviside(inputs @ w_nand.view(pop_size, -1).T + b_nand.view(pop_size))
|
| 240 |
+
hidden = torch.stack([h_or, h_nand], dim=-1)
|
| 241 |
+
|
| 242 |
+
w2 = pop[f'{prefix}.layer2.weight']
|
| 243 |
+
b2 = pop[f'{prefix}.layer2.bias']
|
| 244 |
+
out = heaviside((hidden * w2.view(pop_size, 1, 2)).sum(-1) + b2.view(pop_size))
|
| 245 |
+
|
| 246 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 247 |
+
|
| 248 |
+
failures = []
|
| 249 |
+
if pop_size == 1:
|
| 250 |
+
for i, (inp, exp, got) in enumerate(zip(inputs, expected, out[:, 0])):
|
| 251 |
+
if exp.item() != got.item():
|
| 252 |
+
failures.append((inp.tolist(), exp.item(), got.item()))
|
| 253 |
+
|
| 254 |
+
self._record(prefix, int(correct[0].item()), len(expected), failures)
|
| 255 |
+
return correct
|
| 256 |
+
|
| 257 |
+
def _test_boolean_gates(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 258 |
+
"""Test all boolean gates."""
|
| 259 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 260 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 261 |
+
total = 0
|
| 262 |
+
|
| 263 |
+
if debug:
|
| 264 |
+
print("\n=== BOOLEAN GATES ===")
|
| 265 |
+
|
| 266 |
+
# Single-layer gates
|
| 267 |
+
for gate in ['and', 'or', 'nand', 'nor', 'implies']:
|
| 268 |
+
scores += self._test_single_gate(pop, f'boolean.{gate}', self.tt2, self.expected[gate])
|
| 269 |
+
total += 4
|
| 270 |
+
if debug:
|
| 271 |
+
r = self.results[-1]
|
| 272 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 273 |
+
|
| 274 |
+
# NOT gate
|
| 275 |
+
w = pop['boolean.not.weight']
|
| 276 |
+
b = pop['boolean.not.bias']
|
| 277 |
+
out = heaviside(self.not_inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 278 |
+
correct = (out == self.expected['not'].unsqueeze(1)).float().sum(0)
|
| 279 |
+
scores += correct
|
| 280 |
+
total += 2
|
| 281 |
+
|
| 282 |
+
failures = []
|
| 283 |
+
if pop_size == 1:
|
| 284 |
+
for inp, exp, got in zip(self.not_inputs, self.expected['not'], out[:, 0]):
|
| 285 |
+
if exp.item() != got.item():
|
| 286 |
+
failures.append((inp.tolist(), exp.item(), got.item()))
|
| 287 |
+
self._record('boolean.not', int(correct[0].item()), 2, failures)
|
| 288 |
+
if debug:
|
| 289 |
+
r = self.results[-1]
|
| 290 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 291 |
+
|
| 292 |
+
# Two-layer gates
|
| 293 |
+
for gate in ['xnor', 'biimplies']:
|
| 294 |
+
scores += self._test_twolayer_gate(pop, f'boolean.{gate}', self.tt2, self.expected.get(gate, self.expected['xnor']))
|
| 295 |
+
total += 4
|
| 296 |
+
if debug:
|
| 297 |
+
r = self.results[-1]
|
| 298 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 299 |
+
|
| 300 |
+
# XOR with neuron1/neuron2 naming (same as xnor/biimplies)
|
| 301 |
+
scores += self._test_twolayer_gate(pop, 'boolean.xor', self.tt2, self.expected['xor'])
|
| 302 |
+
total += 4
|
| 303 |
+
if debug:
|
| 304 |
+
r = self.results[-1]
|
| 305 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 306 |
+
|
| 307 |
+
return scores, total
|
| 308 |
+
|
| 309 |
+
# =========================================================================
|
| 310 |
+
# ARITHMETIC - ADDERS
|
| 311 |
+
# =========================================================================
|
| 312 |
+
|
| 313 |
+
def _eval_xor(self, pop: Dict, prefix: str, a: torch.Tensor, b: torch.Tensor) -> torch.Tensor:
|
| 314 |
+
"""Evaluate XOR gate with or/nand decomposition.
|
| 315 |
+
|
| 316 |
+
Args:
|
| 317 |
+
a, b: Tensors of shape [num_tests] or [num_tests, pop_size]
|
| 318 |
+
|
| 319 |
+
Returns:
|
| 320 |
+
Tensor of shape [num_tests, pop_size]
|
| 321 |
+
"""
|
| 322 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 323 |
+
|
| 324 |
+
# Ensure inputs are [num_tests, pop_size]
|
| 325 |
+
if a.dim() == 1:
|
| 326 |
+
a = a.unsqueeze(1).expand(-1, pop_size)
|
| 327 |
+
if b.dim() == 1:
|
| 328 |
+
b = b.unsqueeze(1).expand(-1, pop_size)
|
| 329 |
+
|
| 330 |
+
# inputs: [num_tests, pop_size, 2]
|
| 331 |
+
inputs = torch.stack([a, b], dim=-1)
|
| 332 |
+
|
| 333 |
+
w_or = pop[f'{prefix}.layer1.or.weight'].view(pop_size, 2)
|
| 334 |
+
b_or = pop[f'{prefix}.layer1.or.bias'].view(pop_size)
|
| 335 |
+
w_nand = pop[f'{prefix}.layer1.nand.weight'].view(pop_size, 2)
|
| 336 |
+
b_nand = pop[f'{prefix}.layer1.nand.bias'].view(pop_size)
|
| 337 |
+
|
| 338 |
+
# [num_tests, pop_size]
|
| 339 |
+
h_or = heaviside((inputs * w_or).sum(-1) + b_or)
|
| 340 |
+
h_nand = heaviside((inputs * w_nand).sum(-1) + b_nand)
|
| 341 |
+
|
| 342 |
+
# hidden: [num_tests, pop_size, 2]
|
| 343 |
+
hidden = torch.stack([h_or, h_nand], dim=-1)
|
| 344 |
+
|
| 345 |
+
w2 = pop[f'{prefix}.layer2.weight'].view(pop_size, 2)
|
| 346 |
+
b2 = pop[f'{prefix}.layer2.bias'].view(pop_size)
|
| 347 |
+
return heaviside((hidden * w2).sum(-1) + b2)
|
| 348 |
+
|
| 349 |
+
def _eval_single_fa(self, pop: Dict, prefix: str,
|
| 350 |
+
a: torch.Tensor, b: torch.Tensor, cin: torch.Tensor) -> Tuple[torch.Tensor, torch.Tensor]:
|
| 351 |
+
"""Evaluate single full adder.
|
| 352 |
+
|
| 353 |
+
Args:
|
| 354 |
+
a, b, cin: Tensors of shape [num_tests] or [num_tests, pop_size]
|
| 355 |
+
|
| 356 |
+
Returns:
|
| 357 |
+
sum_out, cout: Both of shape [num_tests, pop_size]
|
| 358 |
+
"""
|
| 359 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 360 |
+
|
| 361 |
+
# Ensure inputs are [num_tests, pop_size]
|
| 362 |
+
if a.dim() == 1:
|
| 363 |
+
a = a.unsqueeze(1).expand(-1, pop_size)
|
| 364 |
+
if b.dim() == 1:
|
| 365 |
+
b = b.unsqueeze(1).expand(-1, pop_size)
|
| 366 |
+
if cin.dim() == 1:
|
| 367 |
+
cin = cin.unsqueeze(1).expand(-1, pop_size)
|
| 368 |
+
|
| 369 |
+
# Half adder 1: a XOR b -> [num_tests, pop_size]
|
| 370 |
+
ha1_sum = self._eval_xor(pop, f'{prefix}.ha1.sum', a, b)
|
| 371 |
+
|
| 372 |
+
# Half adder 1 carry: a AND b
|
| 373 |
+
ab = torch.stack([a, b], dim=-1) # [num_tests, pop_size, 2]
|
| 374 |
+
w_c1 = pop[f'{prefix}.ha1.carry.weight'].view(pop_size, 2)
|
| 375 |
+
b_c1 = pop[f'{prefix}.ha1.carry.bias'].view(pop_size)
|
| 376 |
+
ha1_carry = heaviside((ab * w_c1).sum(-1) + b_c1)
|
| 377 |
+
|
| 378 |
+
# Half adder 2: ha1_sum XOR cin
|
| 379 |
+
ha2_sum = self._eval_xor(pop, f'{prefix}.ha2.sum', ha1_sum, cin)
|
| 380 |
+
|
| 381 |
+
# Half adder 2 carry
|
| 382 |
+
sc = torch.stack([ha1_sum, cin], dim=-1)
|
| 383 |
+
w_c2 = pop[f'{prefix}.ha2.carry.weight'].view(pop_size, 2)
|
| 384 |
+
b_c2 = pop[f'{prefix}.ha2.carry.bias'].view(pop_size)
|
| 385 |
+
ha2_carry = heaviside((sc * w_c2).sum(-1) + b_c2)
|
| 386 |
+
|
| 387 |
+
# Carry out: ha1_carry OR ha2_carry
|
| 388 |
+
carries = torch.stack([ha1_carry, ha2_carry], dim=-1)
|
| 389 |
+
w_cout = pop[f'{prefix}.carry_or.weight'].view(pop_size, 2)
|
| 390 |
+
b_cout = pop[f'{prefix}.carry_or.bias'].view(pop_size)
|
| 391 |
+
cout = heaviside((carries * w_cout).sum(-1) + b_cout)
|
| 392 |
+
|
| 393 |
+
return ha2_sum, cout
|
| 394 |
+
|
| 395 |
+
def _test_halfadder(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 396 |
+
"""Test half adder."""
|
| 397 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 398 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 399 |
+
total = 0
|
| 400 |
+
|
| 401 |
+
if debug:
|
| 402 |
+
print("\n=== HALF ADDER ===")
|
| 403 |
+
|
| 404 |
+
# Sum (XOR)
|
| 405 |
+
scores += self._test_xor_ornand(pop, 'arithmetic.halfadder.sum', self.tt2, self.expected['ha_sum'])
|
| 406 |
+
total += 4
|
| 407 |
+
if debug:
|
| 408 |
+
r = self.results[-1]
|
| 409 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 410 |
+
|
| 411 |
+
# Carry (AND)
|
| 412 |
+
scores += self._test_single_gate(pop, 'arithmetic.halfadder.carry', self.tt2, self.expected['ha_carry'])
|
| 413 |
+
total += 4
|
| 414 |
+
if debug:
|
| 415 |
+
r = self.results[-1]
|
| 416 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 417 |
+
|
| 418 |
+
return scores, total
|
| 419 |
+
|
| 420 |
+
def _test_fulladder(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 421 |
+
"""Test full adder with all 8 input combinations."""
|
| 422 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 423 |
+
|
| 424 |
+
if debug:
|
| 425 |
+
print("\n=== FULL ADDER ===")
|
| 426 |
+
|
| 427 |
+
a = self.tt3[:, 0]
|
| 428 |
+
b = self.tt3[:, 1]
|
| 429 |
+
cin = self.tt3[:, 2]
|
| 430 |
+
|
| 431 |
+
sum_out, cout = self._eval_single_fa(pop, 'arithmetic.fulladder', a, b, cin)
|
| 432 |
+
|
| 433 |
+
sum_correct = (sum_out == self.expected['fa_sum'].unsqueeze(1)).float().sum(0)
|
| 434 |
+
cout_correct = (cout == self.expected['fa_cout'].unsqueeze(1)).float().sum(0)
|
| 435 |
+
|
| 436 |
+
failures_sum = []
|
| 437 |
+
failures_cout = []
|
| 438 |
+
if pop_size == 1:
|
| 439 |
+
for i in range(8):
|
| 440 |
+
if sum_out[i, 0].item() != self.expected['fa_sum'][i].item():
|
| 441 |
+
failures_sum.append(([a[i].item(), b[i].item(), cin[i].item()],
|
| 442 |
+
self.expected['fa_sum'][i].item(), sum_out[i, 0].item()))
|
| 443 |
+
if cout[i, 0].item() != self.expected['fa_cout'][i].item():
|
| 444 |
+
failures_cout.append(([a[i].item(), b[i].item(), cin[i].item()],
|
| 445 |
+
self.expected['fa_cout'][i].item(), cout[i, 0].item()))
|
| 446 |
+
|
| 447 |
+
self._record('arithmetic.fulladder.sum', int(sum_correct[0].item()), 8, failures_sum)
|
| 448 |
+
self._record('arithmetic.fulladder.cout', int(cout_correct[0].item()), 8, failures_cout)
|
| 449 |
+
|
| 450 |
+
if debug:
|
| 451 |
+
for r in self.results[-2:]:
|
| 452 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 453 |
+
|
| 454 |
+
return sum_correct + cout_correct, 16
|
| 455 |
+
|
| 456 |
+
def _test_ripplecarry(self, pop: Dict, bits: int, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 457 |
+
"""Test N-bit ripple carry adder."""
|
| 458 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 459 |
+
|
| 460 |
+
if debug:
|
| 461 |
+
print(f"\n=== RIPPLE CARRY {bits}-BIT ===")
|
| 462 |
+
|
| 463 |
+
prefix = f'arithmetic.ripplecarry{bits}bit'
|
| 464 |
+
max_val = 1 << bits
|
| 465 |
+
num_tests = min(max_val * max_val, 65536)
|
| 466 |
+
|
| 467 |
+
if bits <= 4:
|
| 468 |
+
# Exhaustive for small widths
|
| 469 |
+
test_a = torch.arange(max_val, device=self.device)
|
| 470 |
+
test_b = torch.arange(max_val, device=self.device)
|
| 471 |
+
a_vals, b_vals = torch.meshgrid(test_a, test_b, indexing='ij')
|
| 472 |
+
a_vals = a_vals.flatten()
|
| 473 |
+
b_vals = b_vals.flatten()
|
| 474 |
+
else:
|
| 475 |
+
# Strategic sampling for 8-bit
|
| 476 |
+
edge_vals = [0, 1, 2, 127, 128, 254, 255]
|
| 477 |
+
pairs = [(a, b) for a in edge_vals for b in edge_vals]
|
| 478 |
+
for i in range(0, 256, 16):
|
| 479 |
+
pairs.append((i, 255 - i))
|
| 480 |
+
pairs = list(set(pairs))
|
| 481 |
+
a_vals = torch.tensor([p[0] for p in pairs], device=self.device)
|
| 482 |
+
b_vals = torch.tensor([p[1] for p in pairs], device=self.device)
|
| 483 |
+
num_tests = len(pairs)
|
| 484 |
+
|
| 485 |
+
# Convert to bits [num_tests, bits]
|
| 486 |
+
a_bits = torch.stack([((a_vals >> (bits - 1 - i)) & 1).float() for i in range(bits)], dim=1)
|
| 487 |
+
b_bits = torch.stack([((b_vals >> (bits - 1 - i)) & 1).float() for i in range(bits)], dim=1)
|
| 488 |
+
|
| 489 |
+
# Evaluate ripple carry
|
| 490 |
+
carry = torch.zeros(len(a_vals), pop_size, device=self.device)
|
| 491 |
+
sum_bits = []
|
| 492 |
+
|
| 493 |
+
for bit in range(bits):
|
| 494 |
+
bit_idx = bits - 1 - bit # LSB first
|
| 495 |
+
s, carry = self._eval_single_fa(
|
| 496 |
+
pop, f'{prefix}.fa{bit}',
|
| 497 |
+
a_bits[:, bit_idx].unsqueeze(1).expand(-1, pop_size),
|
| 498 |
+
b_bits[:, bit_idx].unsqueeze(1).expand(-1, pop_size),
|
| 499 |
+
carry
|
| 500 |
+
)
|
| 501 |
+
sum_bits.append(s)
|
| 502 |
+
|
| 503 |
+
# Reconstruct result
|
| 504 |
+
sum_bits = torch.stack(sum_bits[::-1], dim=-1) # MSB first
|
| 505 |
+
result = torch.zeros(len(a_vals), pop_size, device=self.device)
|
| 506 |
+
for i in range(bits):
|
| 507 |
+
result += sum_bits[:, :, i] * (1 << (bits - 1 - i))
|
| 508 |
+
|
| 509 |
+
# Expected
|
| 510 |
+
expected = ((a_vals + b_vals) & (max_val - 1)).unsqueeze(1).expand(-1, pop_size).float()
|
| 511 |
+
correct = (result == expected).float().sum(0)
|
| 512 |
+
|
| 513 |
+
failures = []
|
| 514 |
+
if pop_size == 1:
|
| 515 |
+
for i in range(min(len(a_vals), 100)):
|
| 516 |
+
if result[i, 0].item() != expected[i, 0].item():
|
| 517 |
+
failures.append((
|
| 518 |
+
[int(a_vals[i].item()), int(b_vals[i].item())],
|
| 519 |
+
int(expected[i, 0].item()),
|
| 520 |
+
int(result[i, 0].item())
|
| 521 |
+
))
|
| 522 |
+
|
| 523 |
+
self._record(prefix, int(correct[0].item()), num_tests, failures)
|
| 524 |
+
if debug:
|
| 525 |
+
r = self.results[-1]
|
| 526 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 527 |
+
|
| 528 |
+
return correct, num_tests
|
| 529 |
+
|
| 530 |
+
# =========================================================================
|
| 531 |
+
# COMPARATORS
|
| 532 |
+
# =========================================================================
|
| 533 |
+
|
| 534 |
+
def _test_comparator(self, pop: Dict, name: str, op: Callable[[int, int], bool],
|
| 535 |
+
debug: bool) -> Tuple[torch.Tensor, int]:
|
| 536 |
+
"""Test 8-bit comparator."""
|
| 537 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 538 |
+
prefix = f'arithmetic.{name}'
|
| 539 |
+
|
| 540 |
+
# Use pre-computed test pairs
|
| 541 |
+
expected = torch.tensor([1.0 if op(a.item(), b.item()) else 0.0
|
| 542 |
+
for a, b in zip(self.comp_a, self.comp_b)],
|
| 543 |
+
device=self.device)
|
| 544 |
+
|
| 545 |
+
# Convert to bits
|
| 546 |
+
a_bits = torch.stack([((self.comp_a >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 547 |
+
b_bits = torch.stack([((self.comp_b >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 548 |
+
inputs = torch.cat([a_bits, b_bits], dim=1)
|
| 549 |
+
|
| 550 |
+
w = pop[f'{prefix}.weight']
|
| 551 |
+
b = pop[f'{prefix}.bias']
|
| 552 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 553 |
+
|
| 554 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 555 |
+
|
| 556 |
+
failures = []
|
| 557 |
+
if pop_size == 1:
|
| 558 |
+
for i in range(len(self.comp_a)):
|
| 559 |
+
if out[i, 0].item() != expected[i].item():
|
| 560 |
+
failures.append((
|
| 561 |
+
[int(self.comp_a[i].item()), int(self.comp_b[i].item())],
|
| 562 |
+
expected[i].item(),
|
| 563 |
+
out[i, 0].item()
|
| 564 |
+
))
|
| 565 |
+
|
| 566 |
+
self._record(prefix, int(correct[0].item()), len(self.comp_a), failures)
|
| 567 |
+
if debug:
|
| 568 |
+
r = self.results[-1]
|
| 569 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 570 |
+
|
| 571 |
+
return correct, len(self.comp_a)
|
| 572 |
+
|
| 573 |
+
def _test_comparators(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 574 |
+
"""Test all comparators."""
|
| 575 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 576 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 577 |
+
total = 0
|
| 578 |
+
|
| 579 |
+
if debug:
|
| 580 |
+
print("\n=== COMPARATORS ===")
|
| 581 |
+
|
| 582 |
+
comparators = [
|
| 583 |
+
('greaterthan8bit', lambda a, b: a > b),
|
| 584 |
+
('lessthan8bit', lambda a, b: a < b),
|
| 585 |
+
('greaterorequal8bit', lambda a, b: a >= b),
|
| 586 |
+
('lessorequal8bit', lambda a, b: a <= b),
|
| 587 |
+
('equality8bit', lambda a, b: a == b),
|
| 588 |
+
]
|
| 589 |
+
|
| 590 |
+
for name, op in comparators:
|
| 591 |
+
try:
|
| 592 |
+
s, t = self._test_comparator(pop, name, op, debug)
|
| 593 |
+
scores += s
|
| 594 |
+
total += t
|
| 595 |
+
except KeyError:
|
| 596 |
+
pass # Circuit not present
|
| 597 |
+
|
| 598 |
+
return scores, total
|
| 599 |
+
|
| 600 |
+
# =========================================================================
|
| 601 |
+
# THRESHOLD GATES
|
| 602 |
+
# =========================================================================
|
| 603 |
+
|
| 604 |
+
def _test_threshold_kofn(self, pop: Dict, k: int, name: str, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 605 |
+
"""Test k-of-n threshold gate."""
|
| 606 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 607 |
+
prefix = f'threshold.{name}'
|
| 608 |
+
|
| 609 |
+
# Test all 256 8-bit patterns
|
| 610 |
+
inputs = self.test_8bit_bits if len(self.test_8bit_bits) == 24 else None
|
| 611 |
+
if inputs is None:
|
| 612 |
+
test_vals = torch.arange(256, device=self.device, dtype=torch.long)
|
| 613 |
+
inputs = torch.stack([((test_vals >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 614 |
+
|
| 615 |
+
# For k-of-8: output 1 if popcount >= k (for "at least k")
|
| 616 |
+
# For exact naming like "oneoutof8", it's exactly k=1
|
| 617 |
+
popcounts = inputs.sum(dim=1)
|
| 618 |
+
|
| 619 |
+
if 'atleast' in name:
|
| 620 |
+
expected = (popcounts >= k).float()
|
| 621 |
+
elif 'atmost' in name or 'minority' in name:
|
| 622 |
+
# minority = popcount <= 3 (less than half of 8)
|
| 623 |
+
expected = (popcounts <= k).float()
|
| 624 |
+
elif 'exactly' in name:
|
| 625 |
+
expected = (popcounts == k).float()
|
| 626 |
+
else:
|
| 627 |
+
# Standard k-of-n (at least k), including majority (>= 5)
|
| 628 |
+
expected = (popcounts >= k).float()
|
| 629 |
+
|
| 630 |
+
w = pop[f'{prefix}.weight']
|
| 631 |
+
b = pop[f'{prefix}.bias']
|
| 632 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 633 |
+
|
| 634 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 635 |
+
|
| 636 |
+
failures = []
|
| 637 |
+
if pop_size == 1:
|
| 638 |
+
for i in range(min(len(inputs), 256)):
|
| 639 |
+
if out[i, 0].item() != expected[i].item():
|
| 640 |
+
val = int(sum(inputs[i, j].item() * (1 << (7 - j)) for j in range(8)))
|
| 641 |
+
failures.append((val, expected[i].item(), out[i, 0].item()))
|
| 642 |
+
|
| 643 |
+
self._record(prefix, int(correct[0].item()), len(inputs), failures[:10])
|
| 644 |
+
if debug:
|
| 645 |
+
r = self.results[-1]
|
| 646 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 647 |
+
|
| 648 |
+
return correct, len(inputs)
|
| 649 |
+
|
| 650 |
+
def _test_threshold_gates(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 651 |
+
"""Test all threshold gates."""
|
| 652 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 653 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 654 |
+
total = 0
|
| 655 |
+
|
| 656 |
+
if debug:
|
| 657 |
+
print("\n=== THRESHOLD GATES ===")
|
| 658 |
+
|
| 659 |
+
# k-of-8 gates
|
| 660 |
+
kofn_gates = [
|
| 661 |
+
(1, 'oneoutof8'), (2, 'twooutof8'), (3, 'threeoutof8'), (4, 'fouroutof8'),
|
| 662 |
+
(5, 'fiveoutof8'), (6, 'sixoutof8'), (7, 'sevenoutof8'), (8, 'alloutof8'),
|
| 663 |
+
]
|
| 664 |
+
|
| 665 |
+
for k, name in kofn_gates:
|
| 666 |
+
try:
|
| 667 |
+
s, t = self._test_threshold_kofn(pop, k, name, debug)
|
| 668 |
+
scores += s
|
| 669 |
+
total += t
|
| 670 |
+
except KeyError:
|
| 671 |
+
pass
|
| 672 |
+
|
| 673 |
+
# Special gates
|
| 674 |
+
special = [
|
| 675 |
+
(5, 'majority'), (3, 'minority'),
|
| 676 |
+
(4, 'atleastk_4'), (4, 'atmostk_4'), (4, 'exactlyk_4'),
|
| 677 |
+
]
|
| 678 |
+
|
| 679 |
+
for k, name in special:
|
| 680 |
+
try:
|
| 681 |
+
s, t = self._test_threshold_kofn(pop, k, name, debug)
|
| 682 |
+
scores += s
|
| 683 |
+
total += t
|
| 684 |
+
except KeyError:
|
| 685 |
+
pass
|
| 686 |
+
|
| 687 |
+
return scores, total
|
| 688 |
+
|
| 689 |
+
# =========================================================================
|
| 690 |
+
# MODULAR ARITHMETIC
|
| 691 |
+
# =========================================================================
|
| 692 |
+
|
| 693 |
+
def _test_modular(self, pop: Dict, mod: int, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 694 |
+
"""Test modular divisibility circuit (multi-layer for non-powers-of-2)."""
|
| 695 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 696 |
+
prefix = f'modular.mod{mod}'
|
| 697 |
+
|
| 698 |
+
# Test 0-255
|
| 699 |
+
inputs = torch.stack([((self.mod_test >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 700 |
+
expected = ((self.mod_test % mod) == 0).float()
|
| 701 |
+
|
| 702 |
+
# Try single layer first (powers of 2)
|
| 703 |
+
try:
|
| 704 |
+
w = pop[f'{prefix}.weight']
|
| 705 |
+
b = pop[f'{prefix}.bias']
|
| 706 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 707 |
+
except KeyError:
|
| 708 |
+
# Multi-layer structure: layer1 (geq/leq) -> layer2 (eq) -> layer3 (or)
|
| 709 |
+
try:
|
| 710 |
+
# Layer 1: geq and leq neurons
|
| 711 |
+
geq_outputs = {}
|
| 712 |
+
leq_outputs = {}
|
| 713 |
+
i = 0
|
| 714 |
+
while True:
|
| 715 |
+
found = False
|
| 716 |
+
if f'{prefix}.layer1.geq{i}.weight' in pop:
|
| 717 |
+
w = pop[f'{prefix}.layer1.geq{i}.weight'].view(pop_size, -1)
|
| 718 |
+
b = pop[f'{prefix}.layer1.geq{i}.bias'].view(pop_size)
|
| 719 |
+
geq_outputs[i] = heaviside(inputs @ w.T + b) # [256, pop_size]
|
| 720 |
+
found = True
|
| 721 |
+
if f'{prefix}.layer1.leq{i}.weight' in pop:
|
| 722 |
+
w = pop[f'{prefix}.layer1.leq{i}.weight'].view(pop_size, -1)
|
| 723 |
+
b = pop[f'{prefix}.layer1.leq{i}.bias'].view(pop_size)
|
| 724 |
+
leq_outputs[i] = heaviside(inputs @ w.T + b)
|
| 725 |
+
found = True
|
| 726 |
+
if not found:
|
| 727 |
+
break
|
| 728 |
+
i += 1
|
| 729 |
+
|
| 730 |
+
if not geq_outputs and not leq_outputs:
|
| 731 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 732 |
+
|
| 733 |
+
# Layer 2: eq neurons (AND of geq and leq for same index)
|
| 734 |
+
eq_outputs = []
|
| 735 |
+
i = 0
|
| 736 |
+
while f'{prefix}.layer2.eq{i}.weight' in pop:
|
| 737 |
+
w = pop[f'{prefix}.layer2.eq{i}.weight'].view(pop_size, -1)
|
| 738 |
+
b = pop[f'{prefix}.layer2.eq{i}.bias'].view(pop_size)
|
| 739 |
+
# Input is [geq_i, leq_i]
|
| 740 |
+
eq_in = torch.stack([geq_outputs.get(i, torch.zeros(256, pop_size, device=self.device)),
|
| 741 |
+
leq_outputs.get(i, torch.zeros(256, pop_size, device=self.device))], dim=-1)
|
| 742 |
+
eq_out = heaviside((eq_in * w).sum(-1) + b)
|
| 743 |
+
eq_outputs.append(eq_out)
|
| 744 |
+
i += 1
|
| 745 |
+
|
| 746 |
+
if not eq_outputs:
|
| 747 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 748 |
+
|
| 749 |
+
# Layer 3: OR of all eq outputs
|
| 750 |
+
eq_stack = torch.stack(eq_outputs, dim=-1) # [256, pop_size, num_eq]
|
| 751 |
+
w3 = pop[f'{prefix}.layer3.or.weight'].view(pop_size, -1)
|
| 752 |
+
b3 = pop[f'{prefix}.layer3.or.bias'].view(pop_size)
|
| 753 |
+
out = heaviside((eq_stack * w3).sum(-1) + b3) # [256, pop_size]
|
| 754 |
+
|
| 755 |
+
except Exception as e:
|
| 756 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 757 |
+
|
| 758 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 759 |
+
|
| 760 |
+
failures = []
|
| 761 |
+
if pop_size == 1:
|
| 762 |
+
for i in range(256):
|
| 763 |
+
if out[i, 0].item() != expected[i].item():
|
| 764 |
+
failures.append((i, expected[i].item(), out[i, 0].item()))
|
| 765 |
+
|
| 766 |
+
self._record(prefix, int(correct[0].item()), 256, failures[:10])
|
| 767 |
+
if debug:
|
| 768 |
+
r = self.results[-1]
|
| 769 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 770 |
+
|
| 771 |
+
return correct, 256
|
| 772 |
+
|
| 773 |
+
def _test_modular_all(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 774 |
+
"""Test all modular arithmetic circuits."""
|
| 775 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 776 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 777 |
+
total = 0
|
| 778 |
+
|
| 779 |
+
if debug:
|
| 780 |
+
print("\n=== MODULAR ARITHMETIC ===")
|
| 781 |
+
|
| 782 |
+
for mod in range(2, 13):
|
| 783 |
+
s, t = self._test_modular(pop, mod, debug)
|
| 784 |
+
scores += s
|
| 785 |
+
total += t
|
| 786 |
+
|
| 787 |
+
return scores, total
|
| 788 |
+
|
| 789 |
+
# =========================================================================
|
| 790 |
+
# PATTERN RECOGNITION
|
| 791 |
+
# =========================================================================
|
| 792 |
+
|
| 793 |
+
def _test_pattern(self, pop: Dict, name: str, expected_fn: Callable[[int], float],
|
| 794 |
+
debug: bool) -> Tuple[torch.Tensor, int]:
|
| 795 |
+
"""Test pattern recognition circuit."""
|
| 796 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 797 |
+
prefix = f'pattern_recognition.{name}'
|
| 798 |
+
|
| 799 |
+
test_vals = torch.arange(256, device=self.device, dtype=torch.long)
|
| 800 |
+
inputs = torch.stack([((test_vals >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 801 |
+
expected = torch.tensor([expected_fn(v.item()) for v in test_vals], device=self.device)
|
| 802 |
+
|
| 803 |
+
try:
|
| 804 |
+
w = pop[f'{prefix}.weight'].view(pop_size, -1)
|
| 805 |
+
b = pop[f'{prefix}.bias'].view(pop_size)
|
| 806 |
+
out = heaviside(inputs @ w.T + b)
|
| 807 |
+
except KeyError:
|
| 808 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 809 |
+
|
| 810 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 811 |
+
|
| 812 |
+
failures = []
|
| 813 |
+
if pop_size == 1:
|
| 814 |
+
for i in range(256):
|
| 815 |
+
if out[i, 0].item() != expected[i].item():
|
| 816 |
+
failures.append((i, expected[i].item(), out[i, 0].item()))
|
| 817 |
+
|
| 818 |
+
self._record(prefix, int(correct[0].item()), 256, failures[:10])
|
| 819 |
+
if debug:
|
| 820 |
+
r = self.results[-1]
|
| 821 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 822 |
+
|
| 823 |
+
return correct, 256
|
| 824 |
+
|
| 825 |
+
def _test_patterns(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 826 |
+
"""Test pattern recognition circuits."""
|
| 827 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 828 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 829 |
+
total = 0
|
| 830 |
+
|
| 831 |
+
if debug:
|
| 832 |
+
print("\n=== PATTERN RECOGNITION ===")
|
| 833 |
+
|
| 834 |
+
# Use correct naming: pattern_recognition.allzeros, pattern_recognition.allones
|
| 835 |
+
patterns = [
|
| 836 |
+
('allzeros', lambda v: 1.0 if v == 0 else 0.0),
|
| 837 |
+
('allones', lambda v: 1.0 if v == 255 else 0.0),
|
| 838 |
+
]
|
| 839 |
+
|
| 840 |
+
for name, fn in patterns:
|
| 841 |
+
s, t = self._test_pattern(pop, name, fn, debug)
|
| 842 |
+
scores += s
|
| 843 |
+
total += t
|
| 844 |
+
|
| 845 |
+
return scores, total
|
| 846 |
+
|
| 847 |
+
# =========================================================================
|
| 848 |
+
# ERROR DETECTION
|
| 849 |
+
# =========================================================================
|
| 850 |
+
|
| 851 |
+
def _eval_xor_tree_stage(self, pop: Dict, prefix: str, stage: int, idx: int,
|
| 852 |
+
a: torch.Tensor, b: torch.Tensor) -> torch.Tensor:
|
| 853 |
+
"""Evaluate a single XOR in the parity tree."""
|
| 854 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 855 |
+
xor_prefix = f'{prefix}.stage{stage}.xor{idx}'
|
| 856 |
+
|
| 857 |
+
# Ensure 2D: [256, pop_size]
|
| 858 |
+
if a.dim() == 1:
|
| 859 |
+
a = a.unsqueeze(1).expand(-1, pop_size)
|
| 860 |
+
if b.dim() == 1:
|
| 861 |
+
b = b.unsqueeze(1).expand(-1, pop_size)
|
| 862 |
+
|
| 863 |
+
# Layer 1: OR and NAND
|
| 864 |
+
w_or = pop[f'{xor_prefix}.layer1.or.weight'].view(pop_size, 2)
|
| 865 |
+
b_or = pop[f'{xor_prefix}.layer1.or.bias'].view(pop_size)
|
| 866 |
+
w_nand = pop[f'{xor_prefix}.layer1.nand.weight'].view(pop_size, 2)
|
| 867 |
+
b_nand = pop[f'{xor_prefix}.layer1.nand.bias'].view(pop_size)
|
| 868 |
+
|
| 869 |
+
inputs = torch.stack([a, b], dim=-1) # [256, pop_size, 2]
|
| 870 |
+
h_or = heaviside((inputs * w_or).sum(-1) + b_or)
|
| 871 |
+
h_nand = heaviside((inputs * w_nand).sum(-1) + b_nand)
|
| 872 |
+
|
| 873 |
+
# Layer 2
|
| 874 |
+
hidden = torch.stack([h_or, h_nand], dim=-1)
|
| 875 |
+
w2 = pop[f'{xor_prefix}.layer2.weight'].view(pop_size, 2)
|
| 876 |
+
b2 = pop[f'{xor_prefix}.layer2.bias'].view(pop_size)
|
| 877 |
+
return heaviside((hidden * w2).sum(-1) + b2)
|
| 878 |
+
|
| 879 |
+
def _test_parity_xor_tree(self, pop: Dict, prefix: str, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 880 |
+
"""Test parity circuit with XOR tree structure."""
|
| 881 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 882 |
+
|
| 883 |
+
test_vals = torch.arange(256, device=self.device, dtype=torch.long)
|
| 884 |
+
inputs = torch.stack([((test_vals >> (7 - i)) & 1).float() for i in range(8)], dim=1)
|
| 885 |
+
|
| 886 |
+
# XOR of all bits: 1 if odd number of 1s
|
| 887 |
+
popcounts = inputs.sum(dim=1)
|
| 888 |
+
xor_result = (popcounts.long() % 2).float()
|
| 889 |
+
|
| 890 |
+
try:
|
| 891 |
+
# Stage 1: 4 XORs (pairs of bits)
|
| 892 |
+
s1_out = []
|
| 893 |
+
for i in range(4):
|
| 894 |
+
xor_out = self._eval_xor_tree_stage(pop, prefix, 1, i, inputs[:, i*2], inputs[:, i*2+1])
|
| 895 |
+
s1_out.append(xor_out)
|
| 896 |
+
|
| 897 |
+
# Stage 2: 2 XORs
|
| 898 |
+
s2_out = []
|
| 899 |
+
for i in range(2):
|
| 900 |
+
xor_out = self._eval_xor_tree_stage(pop, prefix, 2, i, s1_out[i*2], s1_out[i*2+1])
|
| 901 |
+
s2_out.append(xor_out)
|
| 902 |
+
|
| 903 |
+
# Stage 3: 1 XOR
|
| 904 |
+
s3_out = self._eval_xor_tree_stage(pop, prefix, 3, 0, s2_out[0], s2_out[1])
|
| 905 |
+
|
| 906 |
+
# Output NOT (for parity checker - inverts the XOR result)
|
| 907 |
+
if f'{prefix}.output.not.weight' in pop:
|
| 908 |
+
w_not = pop[f'{prefix}.output.not.weight'].view(pop_size)
|
| 909 |
+
b_not = pop[f'{prefix}.output.not.bias'].view(pop_size)
|
| 910 |
+
out = heaviside(s3_out * w_not + b_not)
|
| 911 |
+
# Checker outputs 1 if even parity (XOR=0), so expected is inverted xor_result
|
| 912 |
+
expected = 1.0 - xor_result
|
| 913 |
+
else:
|
| 914 |
+
out = s3_out
|
| 915 |
+
expected = xor_result
|
| 916 |
+
|
| 917 |
+
except KeyError as e:
|
| 918 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 919 |
+
|
| 920 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 921 |
+
|
| 922 |
+
failures = []
|
| 923 |
+
if pop_size == 1:
|
| 924 |
+
for i in range(256):
|
| 925 |
+
if out[i, 0].item() != expected[i].item():
|
| 926 |
+
failures.append((i, expected[i].item(), out[i, 0].item()))
|
| 927 |
+
|
| 928 |
+
self._record(prefix, int(correct[0].item()), 256, failures[:10])
|
| 929 |
+
if debug:
|
| 930 |
+
r = self.results[-1]
|
| 931 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 932 |
+
|
| 933 |
+
return correct, 256
|
| 934 |
+
|
| 935 |
+
def _test_error_detection(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 936 |
+
"""Test error detection circuits."""
|
| 937 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 938 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 939 |
+
total = 0
|
| 940 |
+
|
| 941 |
+
if debug:
|
| 942 |
+
print("\n=== ERROR DETECTION ===")
|
| 943 |
+
|
| 944 |
+
# XOR tree parity circuits
|
| 945 |
+
for prefix in ['error_detection.paritychecker8bit', 'error_detection.paritygenerator8bit']:
|
| 946 |
+
s, t = self._test_parity_xor_tree(pop, prefix, debug)
|
| 947 |
+
scores += s
|
| 948 |
+
total += t
|
| 949 |
+
|
| 950 |
+
return scores, total
|
| 951 |
+
|
| 952 |
+
# =========================================================================
|
| 953 |
+
# COMBINATIONAL LOGIC
|
| 954 |
+
# =========================================================================
|
| 955 |
+
|
| 956 |
+
def _test_mux2to1(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 957 |
+
"""Test 2-to-1 multiplexer."""
|
| 958 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 959 |
+
prefix = 'combinational.multiplexer2to1'
|
| 960 |
+
|
| 961 |
+
# Inputs: [a, b, sel] -> out = sel ? b : a
|
| 962 |
+
inputs = torch.tensor([
|
| 963 |
+
[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1],
|
| 964 |
+
[1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1],
|
| 965 |
+
], device=self.device, dtype=torch.float32)
|
| 966 |
+
expected = torch.tensor([0, 0, 0, 1, 1, 0, 1, 1], device=self.device, dtype=torch.float32)
|
| 967 |
+
|
| 968 |
+
try:
|
| 969 |
+
w = pop[f'{prefix}.weight']
|
| 970 |
+
b = pop[f'{prefix}.bias']
|
| 971 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 972 |
+
except KeyError:
|
| 973 |
+
return torch.zeros(pop_size, device=self.device), 0
|
| 974 |
+
|
| 975 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 976 |
+
|
| 977 |
+
failures = []
|
| 978 |
+
if pop_size == 1:
|
| 979 |
+
for i in range(8):
|
| 980 |
+
if out[i, 0].item() != expected[i].item():
|
| 981 |
+
failures.append((inputs[i].tolist(), expected[i].item(), out[i, 0].item()))
|
| 982 |
+
|
| 983 |
+
self._record(prefix, int(correct[0].item()), 8, failures)
|
| 984 |
+
if debug:
|
| 985 |
+
r = self.results[-1]
|
| 986 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 987 |
+
|
| 988 |
+
return correct, 8
|
| 989 |
+
|
| 990 |
+
def _test_decoder3to8(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 991 |
+
"""Test 3-to-8 decoder."""
|
| 992 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 993 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 994 |
+
total = 0
|
| 995 |
+
|
| 996 |
+
if debug:
|
| 997 |
+
print("\n=== DECODER 3-TO-8 ===")
|
| 998 |
+
|
| 999 |
+
inputs = torch.tensor([
|
| 1000 |
+
[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1],
|
| 1001 |
+
[1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1],
|
| 1002 |
+
], device=self.device, dtype=torch.float32)
|
| 1003 |
+
|
| 1004 |
+
for out_idx in range(8):
|
| 1005 |
+
prefix = f'combinational.decoder3to8.out{out_idx}'
|
| 1006 |
+
expected = torch.zeros(8, device=self.device)
|
| 1007 |
+
expected[out_idx] = 1.0
|
| 1008 |
+
|
| 1009 |
+
try:
|
| 1010 |
+
w = pop[f'{prefix}.weight']
|
| 1011 |
+
b = pop[f'{prefix}.bias']
|
| 1012 |
+
out = heaviside(inputs @ w.view(pop_size, -1).T + b.view(pop_size))
|
| 1013 |
+
except KeyError:
|
| 1014 |
+
continue
|
| 1015 |
+
|
| 1016 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0)
|
| 1017 |
+
scores += correct
|
| 1018 |
+
total += 8
|
| 1019 |
+
|
| 1020 |
+
failures = []
|
| 1021 |
+
if pop_size == 1:
|
| 1022 |
+
for i in range(8):
|
| 1023 |
+
if out[i, 0].item() != expected[i].item():
|
| 1024 |
+
failures.append((inputs[i].tolist(), expected[i].item(), out[i, 0].item()))
|
| 1025 |
+
|
| 1026 |
+
self._record(prefix, int(correct[0].item()), 8, failures)
|
| 1027 |
+
if debug:
|
| 1028 |
+
r = self.results[-1]
|
| 1029 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1030 |
+
|
| 1031 |
+
return scores, total
|
| 1032 |
+
|
| 1033 |
+
def _test_combinational(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1034 |
+
"""Test combinational logic circuits."""
|
| 1035 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1036 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1037 |
+
total = 0
|
| 1038 |
+
|
| 1039 |
+
if debug:
|
| 1040 |
+
print("\n=== COMBINATIONAL LOGIC ===")
|
| 1041 |
+
|
| 1042 |
+
s, t = self._test_mux2to1(pop, debug)
|
| 1043 |
+
scores += s
|
| 1044 |
+
total += t
|
| 1045 |
+
|
| 1046 |
+
s, t = self._test_decoder3to8(pop, debug)
|
| 1047 |
+
scores += s
|
| 1048 |
+
total += t
|
| 1049 |
+
|
| 1050 |
+
return scores, total
|
| 1051 |
+
|
| 1052 |
+
# =========================================================================
|
| 1053 |
+
# CONTROL FLOW
|
| 1054 |
+
# =========================================================================
|
| 1055 |
+
|
| 1056 |
+
def _test_conditional_jump(self, pop: Dict, name: str, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1057 |
+
"""Test conditional jump circuit."""
|
| 1058 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1059 |
+
prefix = f'control.{name}'
|
| 1060 |
+
|
| 1061 |
+
# Test cases: [pc_bit, target_bit, flag] -> out = flag ? target : pc
|
| 1062 |
+
inputs = torch.tensor([
|
| 1063 |
+
[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1],
|
| 1064 |
+
[1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1],
|
| 1065 |
+
], device=self.device, dtype=torch.float32)
|
| 1066 |
+
expected = torch.tensor([0, 0, 0, 1, 1, 0, 1, 1], device=self.device, dtype=torch.float32)
|
| 1067 |
+
|
| 1068 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1069 |
+
total = 0
|
| 1070 |
+
|
| 1071 |
+
for bit in range(8):
|
| 1072 |
+
bit_prefix = f'{prefix}.bit{bit}'
|
| 1073 |
+
try:
|
| 1074 |
+
# NOT sel
|
| 1075 |
+
w_not = pop[f'{bit_prefix}.not_sel.weight']
|
| 1076 |
+
b_not = pop[f'{bit_prefix}.not_sel.bias']
|
| 1077 |
+
flag = inputs[:, 2:3]
|
| 1078 |
+
not_sel = heaviside(flag @ w_not.view(pop_size, -1).T + b_not.view(pop_size))
|
| 1079 |
+
|
| 1080 |
+
# AND a (pc AND NOT sel)
|
| 1081 |
+
w_and_a = pop[f'{bit_prefix}.and_a.weight']
|
| 1082 |
+
b_and_a = pop[f'{bit_prefix}.and_a.bias']
|
| 1083 |
+
pc_not = torch.cat([inputs[:, 0:1], not_sel], dim=-1)
|
| 1084 |
+
and_a = heaviside((pc_not * w_and_a.view(pop_size, 1, 2)).sum(-1) + b_and_a.view(pop_size, 1))
|
| 1085 |
+
|
| 1086 |
+
# AND b (target AND sel)
|
| 1087 |
+
w_and_b = pop[f'{bit_prefix}.and_b.weight']
|
| 1088 |
+
b_and_b = pop[f'{bit_prefix}.and_b.bias']
|
| 1089 |
+
target_sel = inputs[:, 1:3]
|
| 1090 |
+
and_b = heaviside((target_sel * w_and_b.view(pop_size, 1, 2)).sum(-1) + b_and_b.view(pop_size, 1))
|
| 1091 |
+
|
| 1092 |
+
# OR
|
| 1093 |
+
w_or = pop[f'{bit_prefix}.or.weight']
|
| 1094 |
+
b_or = pop[f'{bit_prefix}.or.bias']
|
| 1095 |
+
# Ensure we keep [num_tests, pop_size] shape
|
| 1096 |
+
and_a_2d = and_a.view(8, pop_size)
|
| 1097 |
+
and_b_2d = and_b.view(8, pop_size)
|
| 1098 |
+
ab = torch.stack([and_a_2d, and_b_2d], dim=-1) # [8, pop_size, 2]
|
| 1099 |
+
out = heaviside((ab * w_or.view(pop_size, 2)).sum(-1) + b_or.view(pop_size)) # [8, pop_size]
|
| 1100 |
+
|
| 1101 |
+
correct = (out == expected.unsqueeze(1)).float().sum(0) # [pop_size]
|
| 1102 |
+
scores += correct
|
| 1103 |
+
total += 8
|
| 1104 |
+
|
| 1105 |
+
except KeyError:
|
| 1106 |
+
pass
|
| 1107 |
+
|
| 1108 |
+
if total > 0:
|
| 1109 |
+
self._record(prefix, int((scores[0] / total * total).item()), total, [])
|
| 1110 |
+
if debug:
|
| 1111 |
+
r = self.results[-1]
|
| 1112 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1113 |
+
|
| 1114 |
+
return scores, total
|
| 1115 |
+
|
| 1116 |
+
def _test_control_flow(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1117 |
+
"""Test control flow circuits."""
|
| 1118 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1119 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1120 |
+
total = 0
|
| 1121 |
+
|
| 1122 |
+
if debug:
|
| 1123 |
+
print("\n=== CONTROL FLOW ===")
|
| 1124 |
+
|
| 1125 |
+
jumps = ['jz', 'jnz', 'jc', 'jnc', 'jn', 'jp', 'jv', 'jnv', 'conditionaljump']
|
| 1126 |
+
for name in jumps:
|
| 1127 |
+
s, t = self._test_conditional_jump(pop, name, debug)
|
| 1128 |
+
scores += s
|
| 1129 |
+
total += t
|
| 1130 |
+
|
| 1131 |
+
return scores, total
|
| 1132 |
+
|
| 1133 |
+
# =========================================================================
|
| 1134 |
+
# ALU
|
| 1135 |
+
# =========================================================================
|
| 1136 |
+
|
| 1137 |
+
def _test_alu_ops(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1138 |
+
"""Test ALU operations (8-bit bitwise)."""
|
| 1139 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1140 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1141 |
+
total = 0
|
| 1142 |
+
|
| 1143 |
+
if debug:
|
| 1144 |
+
print("\n=== ALU OPERATIONS ===")
|
| 1145 |
+
|
| 1146 |
+
# Test ALU AND/OR/NOT on 8-bit values
|
| 1147 |
+
# Each ALU op has weight [16] or [8] and bias [8]
|
| 1148 |
+
# Structured as 8 parallel 2-input (or 1-input for NOT) gates
|
| 1149 |
+
|
| 1150 |
+
test_vals = [(0, 0), (255, 255), (0xAA, 0x55), (0x0F, 0xF0)]
|
| 1151 |
+
|
| 1152 |
+
# AND: weight [16] = 8 * [2], bias [8]
|
| 1153 |
+
try:
|
| 1154 |
+
w = pop['alu.alu8bit.and.weight'].view(pop_size, 8, 2) # [pop, 8, 2]
|
| 1155 |
+
b = pop['alu.alu8bit.and.bias'].view(pop_size, 8) # [pop, 8]
|
| 1156 |
+
|
| 1157 |
+
for a_val, b_val in test_vals:
|
| 1158 |
+
a_bits = torch.tensor([((a_val >> (7 - i)) & 1) for i in range(8)],
|
| 1159 |
+
device=self.device, dtype=torch.float32)
|
| 1160 |
+
b_bits = torch.tensor([((b_val >> (7 - i)) & 1) for i in range(8)],
|
| 1161 |
+
device=self.device, dtype=torch.float32)
|
| 1162 |
+
# [8, 2]
|
| 1163 |
+
inputs = torch.stack([a_bits, b_bits], dim=-1)
|
| 1164 |
+
# [pop, 8]
|
| 1165 |
+
out = heaviside((inputs * w).sum(-1) + b)
|
| 1166 |
+
expected = torch.tensor([((a_val & b_val) >> (7 - i)) & 1 for i in range(8)],
|
| 1167 |
+
device=self.device, dtype=torch.float32)
|
| 1168 |
+
correct = (out == expected.unsqueeze(0)).float().sum(1) # [pop]
|
| 1169 |
+
scores += correct
|
| 1170 |
+
total += 8
|
| 1171 |
+
|
| 1172 |
+
self._record('alu.alu8bit.and', int(scores[0].item()), total, [])
|
| 1173 |
+
if debug:
|
| 1174 |
+
r = self.results[-1]
|
| 1175 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1176 |
+
except (KeyError, RuntimeError):
|
| 1177 |
+
pass
|
| 1178 |
+
|
| 1179 |
+
# OR
|
| 1180 |
+
try:
|
| 1181 |
+
w = pop['alu.alu8bit.or.weight'].view(pop_size, 8, 2)
|
| 1182 |
+
b = pop['alu.alu8bit.or.bias'].view(pop_size, 8)
|
| 1183 |
+
op_scores = torch.zeros(pop_size, device=self.device)
|
| 1184 |
+
op_total = 0
|
| 1185 |
+
|
| 1186 |
+
for a_val, b_val in test_vals:
|
| 1187 |
+
a_bits = torch.tensor([((a_val >> (7 - i)) & 1) for i in range(8)],
|
| 1188 |
+
device=self.device, dtype=torch.float32)
|
| 1189 |
+
b_bits = torch.tensor([((b_val >> (7 - i)) & 1) for i in range(8)],
|
| 1190 |
+
device=self.device, dtype=torch.float32)
|
| 1191 |
+
inputs = torch.stack([a_bits, b_bits], dim=-1)
|
| 1192 |
+
out = heaviside((inputs * w).sum(-1) + b)
|
| 1193 |
+
expected = torch.tensor([((a_val | b_val) >> (7 - i)) & 1 for i in range(8)],
|
| 1194 |
+
device=self.device, dtype=torch.float32)
|
| 1195 |
+
correct = (out == expected.unsqueeze(0)).float().sum(1)
|
| 1196 |
+
op_scores += correct
|
| 1197 |
+
op_total += 8
|
| 1198 |
+
|
| 1199 |
+
scores += op_scores
|
| 1200 |
+
total += op_total
|
| 1201 |
+
self._record('alu.alu8bit.or', int(op_scores[0].item()), op_total, [])
|
| 1202 |
+
if debug:
|
| 1203 |
+
r = self.results[-1]
|
| 1204 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1205 |
+
except (KeyError, RuntimeError):
|
| 1206 |
+
pass
|
| 1207 |
+
|
| 1208 |
+
# NOT
|
| 1209 |
+
try:
|
| 1210 |
+
w = pop['alu.alu8bit.not.weight'].view(pop_size, 8)
|
| 1211 |
+
b = pop['alu.alu8bit.not.bias'].view(pop_size, 8)
|
| 1212 |
+
op_scores = torch.zeros(pop_size, device=self.device)
|
| 1213 |
+
op_total = 0
|
| 1214 |
+
|
| 1215 |
+
for a_val, _ in test_vals:
|
| 1216 |
+
a_bits = torch.tensor([((a_val >> (7 - i)) & 1) for i in range(8)],
|
| 1217 |
+
device=self.device, dtype=torch.float32)
|
| 1218 |
+
out = heaviside(a_bits * w + b)
|
| 1219 |
+
expected = torch.tensor([(((~a_val) & 0xFF) >> (7 - i)) & 1 for i in range(8)],
|
| 1220 |
+
device=self.device, dtype=torch.float32)
|
| 1221 |
+
correct = (out == expected.unsqueeze(0)).float().sum(1)
|
| 1222 |
+
op_scores += correct
|
| 1223 |
+
op_total += 8
|
| 1224 |
+
|
| 1225 |
+
scores += op_scores
|
| 1226 |
+
total += op_total
|
| 1227 |
+
self._record('alu.alu8bit.not', int(op_scores[0].item()), op_total, [])
|
| 1228 |
+
if debug:
|
| 1229 |
+
r = self.results[-1]
|
| 1230 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1231 |
+
except (KeyError, RuntimeError):
|
| 1232 |
+
pass
|
| 1233 |
+
|
| 1234 |
+
return scores, total
|
| 1235 |
+
|
| 1236 |
+
# =========================================================================
|
| 1237 |
+
# MANIFEST
|
| 1238 |
+
# =========================================================================
|
| 1239 |
+
|
| 1240 |
+
def _test_manifest(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1241 |
+
"""Verify manifest values."""
|
| 1242 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1243 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1244 |
+
total = 0
|
| 1245 |
+
|
| 1246 |
+
if debug:
|
| 1247 |
+
print("\n=== MANIFEST ===")
|
| 1248 |
+
|
| 1249 |
+
expected = {
|
| 1250 |
+
'manifest.alu_operations': 16.0,
|
| 1251 |
+
'manifest.flags': 4.0,
|
| 1252 |
+
'manifest.instruction_width': 16.0,
|
| 1253 |
+
'manifest.memory_bytes': 65536.0,
|
| 1254 |
+
'manifest.pc_width': 16.0,
|
| 1255 |
+
'manifest.register_width': 8.0,
|
| 1256 |
+
'manifest.registers': 4.0,
|
| 1257 |
+
'manifest.turing_complete': 1.0,
|
| 1258 |
+
'manifest.version': 3.0,
|
| 1259 |
+
}
|
| 1260 |
+
|
| 1261 |
+
for name, exp_val in expected.items():
|
| 1262 |
+
try:
|
| 1263 |
+
val = pop[name][0, 0].item() # [pop_size, 1] -> scalar
|
| 1264 |
+
if val == exp_val:
|
| 1265 |
+
scores += 1
|
| 1266 |
+
self._record(name, 1, 1, [])
|
| 1267 |
+
else:
|
| 1268 |
+
self._record(name, 0, 1, [(exp_val, val)])
|
| 1269 |
+
total += 1
|
| 1270 |
+
|
| 1271 |
+
if debug:
|
| 1272 |
+
r = self.results[-1]
|
| 1273 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1274 |
+
except KeyError:
|
| 1275 |
+
pass
|
| 1276 |
+
|
| 1277 |
+
return scores, total
|
| 1278 |
+
|
| 1279 |
+
# =========================================================================
|
| 1280 |
+
# MEMORY
|
| 1281 |
+
# =========================================================================
|
| 1282 |
+
|
| 1283 |
+
def _test_memory(self, pop: Dict, debug: bool) -> Tuple[torch.Tensor, int]:
|
| 1284 |
+
"""Test memory circuits (shape validation)."""
|
| 1285 |
+
pop_size = next(iter(pop.values())).shape[0]
|
| 1286 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1287 |
+
total = 0
|
| 1288 |
+
|
| 1289 |
+
if debug:
|
| 1290 |
+
print("\n=== MEMORY ===")
|
| 1291 |
+
|
| 1292 |
+
expected_shapes = {
|
| 1293 |
+
'memory.addr_decode.weight': (65536, 16),
|
| 1294 |
+
'memory.addr_decode.bias': (65536,),
|
| 1295 |
+
'memory.read.and.weight': (8, 65536, 2),
|
| 1296 |
+
'memory.read.and.bias': (8, 65536),
|
| 1297 |
+
'memory.read.or.weight': (8, 65536),
|
| 1298 |
+
'memory.read.or.bias': (8,),
|
| 1299 |
+
'memory.write.sel.weight': (65536, 2),
|
| 1300 |
+
'memory.write.sel.bias': (65536,),
|
| 1301 |
+
'memory.write.nsel.weight': (65536, 1),
|
| 1302 |
+
'memory.write.nsel.bias': (65536,),
|
| 1303 |
+
'memory.write.and_old.weight': (65536, 8, 2),
|
| 1304 |
+
'memory.write.and_old.bias': (65536, 8),
|
| 1305 |
+
'memory.write.and_new.weight': (65536, 8, 2),
|
| 1306 |
+
'memory.write.and_new.bias': (65536, 8),
|
| 1307 |
+
'memory.write.or.weight': (65536, 8, 2),
|
| 1308 |
+
'memory.write.or.bias': (65536, 8),
|
| 1309 |
+
}
|
| 1310 |
+
|
| 1311 |
+
for name, expected_shape in expected_shapes.items():
|
| 1312 |
+
try:
|
| 1313 |
+
tensor = pop[name]
|
| 1314 |
+
actual_shape = tuple(tensor.shape[1:]) # Skip pop_size dimension
|
| 1315 |
+
if actual_shape == expected_shape:
|
| 1316 |
+
scores += 1
|
| 1317 |
+
self._record(name, 1, 1, [])
|
| 1318 |
+
else:
|
| 1319 |
+
self._record(name, 0, 1, [(expected_shape, actual_shape)])
|
| 1320 |
+
total += 1
|
| 1321 |
+
|
| 1322 |
+
if debug:
|
| 1323 |
+
r = self.results[-1]
|
| 1324 |
+
print(f" {r.name}: {r.passed}/{r.total} {'PASS' if r.success else 'FAIL'}")
|
| 1325 |
+
except KeyError:
|
| 1326 |
+
pass
|
| 1327 |
+
|
| 1328 |
+
return scores, total
|
| 1329 |
+
|
| 1330 |
+
# =========================================================================
|
| 1331 |
+
# MAIN EVALUATE
|
| 1332 |
+
# =========================================================================
|
| 1333 |
+
|
| 1334 |
+
def evaluate(self, population: Dict[str, torch.Tensor], debug: bool = False) -> torch.Tensor:
|
| 1335 |
+
"""
|
| 1336 |
+
Evaluate population fitness with per-circuit reporting.
|
| 1337 |
+
|
| 1338 |
+
Args:
|
| 1339 |
+
population: Dict of tensors, each with shape [pop_size, ...]
|
| 1340 |
+
debug: If True, print per-circuit results
|
| 1341 |
+
|
| 1342 |
+
Returns:
|
| 1343 |
+
Tensor of fitness scores [pop_size], normalized to [0, 1]
|
| 1344 |
+
"""
|
| 1345 |
+
self.results = []
|
| 1346 |
+
self.category_scores = {}
|
| 1347 |
+
|
| 1348 |
+
pop_size = next(iter(population.values())).shape[0]
|
| 1349 |
+
scores = torch.zeros(pop_size, device=self.device)
|
| 1350 |
+
total_tests = 0
|
| 1351 |
+
|
| 1352 |
+
# Boolean gates
|
| 1353 |
+
s, t = self._test_boolean_gates(population, debug)
|
| 1354 |
+
scores += s
|
| 1355 |
+
total_tests += t
|
| 1356 |
+
self.category_scores['boolean'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1357 |
+
|
| 1358 |
+
# Half adder
|
| 1359 |
+
s, t = self._test_halfadder(population, debug)
|
| 1360 |
+
scores += s
|
| 1361 |
+
total_tests += t
|
| 1362 |
+
self.category_scores['halfadder'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1363 |
+
|
| 1364 |
+
# Full adder
|
| 1365 |
+
s, t = self._test_fulladder(population, debug)
|
| 1366 |
+
scores += s
|
| 1367 |
+
total_tests += t
|
| 1368 |
+
self.category_scores['fulladder'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1369 |
+
|
| 1370 |
+
# Ripple carry adders
|
| 1371 |
+
for bits in [2, 4, 8]:
|
| 1372 |
+
s, t = self._test_ripplecarry(population, bits, debug)
|
| 1373 |
+
scores += s
|
| 1374 |
+
total_tests += t
|
| 1375 |
+
self.category_scores[f'ripplecarry{bits}'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1376 |
+
|
| 1377 |
+
# Comparators
|
| 1378 |
+
s, t = self._test_comparators(population, debug)
|
| 1379 |
+
scores += s
|
| 1380 |
+
total_tests += t
|
| 1381 |
+
self.category_scores['comparators'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1382 |
+
|
| 1383 |
+
# Threshold gates
|
| 1384 |
+
s, t = self._test_threshold_gates(population, debug)
|
| 1385 |
+
scores += s
|
| 1386 |
+
total_tests += t
|
| 1387 |
+
self.category_scores['threshold'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1388 |
+
|
| 1389 |
+
# Modular arithmetic
|
| 1390 |
+
s, t = self._test_modular_all(population, debug)
|
| 1391 |
+
scores += s
|
| 1392 |
+
total_tests += t
|
| 1393 |
+
self.category_scores['modular'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1394 |
+
|
| 1395 |
+
# Pattern recognition
|
| 1396 |
+
s, t = self._test_patterns(population, debug)
|
| 1397 |
+
scores += s
|
| 1398 |
+
total_tests += t
|
| 1399 |
+
self.category_scores['patterns'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1400 |
+
|
| 1401 |
+
# Error detection
|
| 1402 |
+
s, t = self._test_error_detection(population, debug)
|
| 1403 |
+
scores += s
|
| 1404 |
+
total_tests += t
|
| 1405 |
+
self.category_scores['error_detection'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1406 |
+
|
| 1407 |
+
# Combinational
|
| 1408 |
+
s, t = self._test_combinational(population, debug)
|
| 1409 |
+
scores += s
|
| 1410 |
+
total_tests += t
|
| 1411 |
+
self.category_scores['combinational'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1412 |
+
|
| 1413 |
+
# Control flow
|
| 1414 |
+
s, t = self._test_control_flow(population, debug)
|
| 1415 |
+
scores += s
|
| 1416 |
+
total_tests += t
|
| 1417 |
+
self.category_scores['control'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1418 |
+
|
| 1419 |
+
# ALU
|
| 1420 |
+
s, t = self._test_alu_ops(population, debug)
|
| 1421 |
+
scores += s
|
| 1422 |
+
total_tests += t
|
| 1423 |
+
self.category_scores['alu'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1424 |
+
|
| 1425 |
+
# Manifest
|
| 1426 |
+
s, t = self._test_manifest(population, debug)
|
| 1427 |
+
scores += s
|
| 1428 |
+
total_tests += t
|
| 1429 |
+
self.category_scores['manifest'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1430 |
+
|
| 1431 |
+
# Memory
|
| 1432 |
+
s, t = self._test_memory(population, debug)
|
| 1433 |
+
scores += s
|
| 1434 |
+
total_tests += t
|
| 1435 |
+
self.category_scores['memory'] = (s[0].item() if pop_size == 1 else s.mean().item(), t)
|
| 1436 |
+
|
| 1437 |
+
self.total_tests = total_tests
|
| 1438 |
+
|
| 1439 |
+
if debug:
|
| 1440 |
+
print("\n" + "=" * 60)
|
| 1441 |
+
print("CATEGORY SUMMARY")
|
| 1442 |
+
print("=" * 60)
|
| 1443 |
+
for cat, (got, expected) in sorted(self.category_scores.items()):
|
| 1444 |
+
pct = 100 * got / expected if expected > 0 else 0
|
| 1445 |
+
status = "PASS" if got == expected else "FAIL"
|
| 1446 |
+
print(f" {cat:20} {int(got):6}/{expected:6} ({pct:6.2f}%) [{status}]")
|
| 1447 |
+
|
| 1448 |
+
print("\n" + "=" * 60)
|
| 1449 |
+
print("CIRCUIT FAILURES")
|
| 1450 |
+
print("=" * 60)
|
| 1451 |
+
failed = [r for r in self.results if not r.success]
|
| 1452 |
+
if failed:
|
| 1453 |
+
for r in failed[:20]:
|
| 1454 |
+
print(f" {r.name}: {r.passed}/{r.total}")
|
| 1455 |
+
if r.failures:
|
| 1456 |
+
print(f" First failure: {r.failures[0]}")
|
| 1457 |
+
if len(failed) > 20:
|
| 1458 |
+
print(f" ... and {len(failed) - 20} more")
|
| 1459 |
+
else:
|
| 1460 |
+
print(" None!")
|
| 1461 |
+
|
| 1462 |
+
return scores / total_tests if total_tests > 0 else scores
|
| 1463 |
+
|
| 1464 |
+
|
| 1465 |
+
def main():
|
| 1466 |
+
parser = argparse.ArgumentParser(description='Unified Evaluation Suite for 8-bit Threshold Computer')
|
| 1467 |
+
parser.add_argument('--model', type=str, default=MODEL_PATH, help='Path to safetensors model')
|
| 1468 |
+
parser.add_argument('--device', type=str, default='cuda', help='Device: cuda or cpu')
|
| 1469 |
+
parser.add_argument('--pop_size', type=int, default=1, help='Population size for batched evaluation')
|
| 1470 |
+
parser.add_argument('--quiet', action='store_true', help='Suppress detailed output')
|
| 1471 |
+
args = parser.parse_args()
|
| 1472 |
+
|
| 1473 |
+
print("=" * 70)
|
| 1474 |
+
print(" UNIFIED EVALUATION SUITE")
|
| 1475 |
+
print("=" * 70)
|
| 1476 |
+
|
| 1477 |
+
print(f"\nLoading model from {args.model}...")
|
| 1478 |
+
model = load_model(args.model)
|
| 1479 |
+
print(f" Loaded {len(model)} tensors, {sum(t.numel() for t in model.values()):,} params")
|
| 1480 |
+
|
| 1481 |
+
print(f"\nInitializing evaluator on {args.device}...")
|
| 1482 |
+
evaluator = BatchedFitnessEvaluator(device=args.device, model_path=args.model)
|
| 1483 |
+
|
| 1484 |
+
print(f"\nCreating population (size {args.pop_size})...")
|
| 1485 |
+
population = create_population(model, pop_size=args.pop_size, device=args.device)
|
| 1486 |
+
|
| 1487 |
+
print("\nRunning evaluation...")
|
| 1488 |
+
if args.device == 'cuda':
|
| 1489 |
+
torch.cuda.synchronize()
|
| 1490 |
+
start = time.perf_counter()
|
| 1491 |
+
|
| 1492 |
+
fitness = evaluator.evaluate(population, debug=not args.quiet)
|
| 1493 |
+
|
| 1494 |
+
if args.device == 'cuda':
|
| 1495 |
+
torch.cuda.synchronize()
|
| 1496 |
+
elapsed = time.perf_counter() - start
|
| 1497 |
+
|
| 1498 |
+
print("\n" + "=" * 70)
|
| 1499 |
+
print("RESULTS")
|
| 1500 |
+
print("=" * 70)
|
| 1501 |
+
|
| 1502 |
+
if args.pop_size == 1:
|
| 1503 |
+
print(f" Fitness: {fitness[0].item():.6f}")
|
| 1504 |
+
else:
|
| 1505 |
+
print(f" Mean Fitness: {fitness.mean().item():.6f}")
|
| 1506 |
+
print(f" Min Fitness: {fitness.min().item():.6f}")
|
| 1507 |
+
print(f" Max Fitness: {fitness.max().item():.6f}")
|
| 1508 |
+
|
| 1509 |
+
print(f" Total tests: {evaluator.total_tests}")
|
| 1510 |
+
print(f" Time: {elapsed * 1000:.2f} ms")
|
| 1511 |
+
|
| 1512 |
+
if args.pop_size > 1:
|
| 1513 |
+
print(f" Throughput: {args.pop_size / elapsed:.0f} evals/sec")
|
| 1514 |
+
perfect = (fitness >= 0.9999).sum().item()
|
| 1515 |
+
print(f" Perfect (>=99.99%): {perfect}/{args.pop_size}")
|
| 1516 |
+
|
| 1517 |
+
if fitness[0].item() >= 0.9999:
|
| 1518 |
+
print("\n STATUS: PASS")
|
| 1519 |
+
return 0
|
| 1520 |
+
else:
|
| 1521 |
+
failed_count = int((1 - fitness[0].item()) * evaluator.total_tests)
|
| 1522 |
+
print(f"\n STATUS: FAIL ({failed_count} tests failed)")
|
| 1523 |
+
return 1
|
| 1524 |
+
|
| 1525 |
+
|
| 1526 |
+
if __name__ == '__main__':
|
| 1527 |
+
exit(main())
|