wiki/projects/side-projects-desktop/consent-grammar/boundary-compute

Rendered from markdown source. Open raw source on GitHub.

Boundary Compute

This page compresses the boundary-compute essay into the consent grammar seam.

Source Artifact

• Source role: standard_named_source
• Inbound original: boundary_compute_invariant.md
• Standard-named source: 20260710__SIDE-PROJECTS-DESKTOP__ESSAY__BOUNDARY-COMPUTE-IS-CHEAPER-THAN-GLOBAL-CLEANUP__v1__boundary-compute-is-cheaper-than-global-cleanup.md

Working Read

The essay argues that boundary work is cheaper than remediation after propagation. It keeps the cost curve local by doing the consent, scope, and consequence work before an effect spreads.

Core Claim

Systems either pay a small, intentional cost at the boundary or a much larger cleanup cost after diffusion. There is no neutral middle ground.

Key Ideas

• Boundary compute buys reversibility.
• Cleanup grows with radius.
• Delay and externalization make the debt larger.
• Consent and ethics are cost-minimizing when propagation exists.

Related Pages

• Consent Grammar
• How Consent Works
• Frame-Anchored Consent Protocol
• Consent Physics
• Intent-Consent

Attractor Bridge

• Consent
• Governance
• Trust

Notes

• This is a source-anchored branch note, not a canon claim.
• Keep the radius argument visible when the page is reused elsewhere.