Skip to content

v2.2.2

Choose a tag to compare

@CodeAbra CodeAbra released this 13 Jul 03:11

Fixed

  • No duplicate startup work. The daemon no longer warms its dispatch surface twice at boot, and a cancelled startup cleans up its locks properly.
  • Cleaner graph. A stale edge can no longer resurrect a deleted record as an empty graph node.
  • Path classification. IAI-MCP checkouts are classified by exact path component instead of a loose substring match.

Changed

  • Faster topology on large graphs. Shortest-path work is bounded above ~2,500 nodes with a deterministic estimator (within 0.2% of exact), avoiding a large N×N allocation.
  • Reproducible test suite. The default suite no longer depends on machine-specific state.

All of the above contributed by @Marsu6996.