update docs and perf metrics

README.md

@@ -8,7 +8,7 @@
 *   **Negotiated Congestion**: Iteratively resolves multi-net bottlenecks by inflating costs in high-traffic regions.
 *   **Analytic Correctness**: Every move is verified against an R-Tree spatial index of obstacles and other paths.
 *   **1nm Precision**: All coordinates and ports are snapped to a 1nm manufacturing grid.
-*   **Safety & Proximity**: Incorporates a "Danger Map" (pre-computed distance transform) to maintain optimal spacing and reduce crosstalk.
+*   **Safety & Proximity**: Uses a sampled obstacle-boundary proximity model to bias routes away from nearby geometry.
 *   **Locked Routes**: Supports treating prior routed nets as fixed obstacles in later runs.
 
 ## Installation
@@ -77,7 +77,11 @@ INIRE_RUN_PERFORMANCE=1 python3 -m pytest -q inire/tests/test_example_performanc
 
 ## Documentation
 
-Full documentation for all user-tunable parameters, cost functions, and collision models can be found in **[DOCS.md](DOCS.md)**.
+Current documentation lives in:
+
+*   **[DOCS.md](DOCS.md)** for the public API and option reference.
+*   **[docs/architecture.md](docs/architecture.md)** for the current implementation structure.
+*   **[docs/performance.md](docs/performance.md)** for the committed performance-counter baseline.
 
 ## API Stability
 
@@ -92,7 +96,7 @@ Deep-module interfaces such as `inire.router._router.PathFinder`, `inire.router.
 2.  **90° Bends**: Fixed-radius PDK cells.
 3.  **Parametric S-Bends**: Procedural arcs for bridging small lateral offsets ($O < 2R$).
 
-For multi-net problems, the negotiated-congestion loop handles rip-up and reroute logic, ensuring that paths find the globally optimal configuration without crossings.
+For multi-net problems, the negotiated-congestion loop handles rip-up and reroute logic and seeks a collision-free configuration without crossings.
 
 ## Configuration