# Fast reusable paths that can still be reopened

ID: reusable-paths-and-rigidity
Canonical: https://rezonansapp.com/nodes/reusable-paths-and-rigidity
Version: 1
SHA256: cfe1d08aacf0ac668d1106661b9d8c4b8e1c3bb1a0b5548cc17e8c7275ad859a
Epistemic kind: reconstruction

## Question

How can a reusable abstraction make future work cheaper without making correction prohibitively difficult?

## Formulation

Treat memory as both a computational resource and a constraint: recurrent paths can be shortened, but exceptions, reverse paths, and opportunities for restructuring must remain accessible.

## Tension

The map that makes action fast can make revision difficult.

## Challenge

What evidence triggers reopening a shortcut rather than fitting new cases into it?