The M1-M6 Pipeline
The mineable ABI contains six optional hooks. A miner may improve one hook or a combination. Any absent hook uses the deterministic reference implementation.
| Hook | Stage | Mineable responsibility |
|---|---|---|
| M1: ingest transform | Write | Normalize input and derive labels, salience, retention hints, and chunk metadata |
| M2: organize | Write | Resolve entities and aliases; derive relations, conflicts, corrections, and multi-hop structure |
| M3: consolidate | Write | Deduplicate, summarize, cluster, merge, and maintain compact derived memory |
| M4: candidates | Read | Produce a bounded candidate frontier for a query |
| M5: rank | Read | Order candidates using relevance, validity, time, conflicts, scope, and confidence |
| M6: pack | Read | Select and render the best evidence under the final context budget |
M3 operates as a scheduled phase. The portable agent integration invokes it at deterministic boundaries, including session end and configured event-count or storage-pressure triggers. Its output is available to the read path after validation and survives restart.
The six hooks form one composable pipeline. A useful improvement may, for example, add alias structure in M2, consume it during M4 candidate generation, apply temporal ordering in M5, and remove redundant evidence in M6. Combined candidates are supported and evaluated as one release.
Storage use, deterministic work, rendered context cost, and corpus-scale behavior are part of the evaluation surface where the active law defines them. Wall-clock latency is reported separately because it varies with hardware.