How resolution works
Resolution computes R(context, t): which authorities govern an act, in a context, at a time — and whether that enumeration is complete. Four conditions make the answer sound. None of them is decorative: for each, there is a published attack, built entirely from genuine keys and genuine documents, that succeeds against any resolver missing exactly that condition. Each attack ships as a conformance vector with both expectations — the attack defeated, and the attack succeeding under ablation.
The applicable set is computed from registrar logs the relying party pinned — never from anything the actor presents.
An agent simply does not mention the stricter law. Every document it does present is genuine, every signature verifies — and the omitted authority never enters the check. Under C5 the actor has no vote in what applies to it.
A registrar’s claim that a law applies binds only within the scope its certificate grants.
A genuine registrar key, certified for one scope, claims a competitor’s sector or a foreign territory. Under C6 the claim is void where it exceeds the certificate. Because the combination is strict, an added authority can only ever add refusals — squatting can cause wrongful refusal, never a wrongful commit.
Membership in the set is judged at the time of the act — a superseded authority is out from the moment its successor is in force.
A carrier — or a resolver serving week-old state — presents and satisfies the lenient version a stricter one replaced. Every artifact is genuine; what is wrong is the set’s staleness. Under C7, membership is read at the moment that matters, never at a convenient instant.
An authority’s absence from the set is load-bearing only under a current closure statement that agrees with the registrar’s own chain; a copy of a log has a bounded age.
No one lies — a pinned registrar is simply dark, or the relying party reads a mirror refreshed weeks ago. Without C8 the missing law silently reads as permission. With it, resolution answers INCOMPLETE, naming exactly what is missing.
Combined across authorities
Once the set is known, each member is consulted and the verdicts combine strictly, in a fixed severity order: a denial from any authority denies; an authority that cannot decide holds the whole answer open; escalations union, each preserving who must approve; authorized only when every member authorizes. The combination is associative and commutative — the answer cannot depend on the order in which the law was consulted.
Checked, then checked again
The reference resolver passes all twenty published vectors, the necessity table — each attack succeeds under exactly its own ablation and no other — and byte-identical determinism under shuffled inputs. Its core is additionally mechanized, step by step, in Lean 4. Writing that proof found two gaps in the specification's first draft; both were closed in 0.2.0 and became vectors. That is the discipline working.
Implement it yourself