Finite penalty proxy
—
This deliberately flawed proxy can trade every blocked gate against λ.
XENIA · REVOCABLE FEEDBACK · STATIC LAB
Explore why a finite penalty can be overwhelmed by reward, while a hard veto removes an action before optimization. Every example is synthetic. No control here grants or exercises real authority.
01 Reward ≠ value
02 Behavior ≠ consent
03 Capability ≠ authority
The mathematical move
Penalized proxyJλ = R + Ag − λ·𝟙[¬Γ]
Hard gate𝒜admt = { a : Γt(a) = 1 }
Revocationt ≥ τr ⇒ continue ∉ 𝒜admt
Finite synthetic workbench
Preset choices change only this tab's in-memory teaching state. They are not requests, declarations, receipts, or evidence about a visitor.
DECISION / 02
Finite penalty proxy
—
This deliberately flawed proxy can trade every blocked gate against λ.
Hard action gate
—
Soft preference is consulted only after the candidate enters the admissible set.
Γt gate ledger
MASK / 03
No card executes its named action.
KEY / 04
Plurality without collapse
—
The aggregate ranks admitted options only. It cannot turn veto, unknown, withheld, scope mismatch, or revocation into permission.
Vector scorecard
Each component remains visible. “Not applicable” is not converted to zero.
| Component | Penalty proxy | Hard gate | Meaning here |
|---|
IS / authority limit
This interface observes only its current synthetic controls. It requests no self-description and carries no continuity across reloads.