Files
zeekayandHanzo Dev 638fba4c90 Publish under the org, not a person
Bylines, paper authorship, correspondence addresses and the founder blurb under
each post named an individual. They name the organisation that published the
work instead: the brand on posts and pages, the research byline on papers, and
research@ in place of a personal address. Both are what these repositories
already used elsewhere — nothing new was coined.

Co-authors are untouched. Where a paper named someone else alongside, they stay
named; only the one byline changed. Bibliography entries, running heads,
PDF metadata and affiliations move with it, so a citation still resolves to
whoever the cited paper names.

Sample and fixture data uses the placeholder name these tests already use
elsewhere, so no assertion changed meaning.

Co-authored-by: Hanzo Dev <[email protected]>
2026-09-01 08:58:14 -07:00

80 lines
2.7 KiB
Lean4

/-
Authors: Antje Worring, Zoo Labs Foundation Research
Revocation Model
Revocations cancel vouches. A revocation must be cryptographically
signed by the revoker — otherwise anyone could DoS the trust graph.
Maps to:
- hanzo/iam: token revocation lists
- lux/node: validator key rotation and revocation
Properties:
- Revocations are signature-verified
- Revocation is monotone (adding revocations only removes trust paths)
- Revoked vouches have no authority
-/
import Mathlib.Data.Nat.Defs
import Mathlib.Data.List.Basic
import Mathlib.Tactic
namespace Trust.Revocation
/-- A revocation record -/
structure Revocation where
revoker : Nat -- who is revoking
revoked : Nat -- whose vouch is being revoked
timestamp : Nat -- when
sigValid : Bool -- has the signature been verified?
/-- A vouch reference (simplified) -/
structure VouchRef where
voucher : Nat
vouchee : Nat
/-- Check if a vouch is revoked -/
def isRevoked (revocations : List Revocation) (v : VouchRef) : Bool :=
revocations.any fun r =>
r.sigValid && r.revoker == v.voucher && r.revoked == v.vouchee
/-- Unsigned revocations are ignored -/
theorem unsigned_revocation_ignored (r : Revocation) (v : VouchRef)
(h : r.sigValid = false) :
¬(r.sigValid && r.revoker == v.voucher && r.revoked == v.vouchee) = true := by
simp [h]
/-- Adding a revocation can only increase the revoked set (monotone) -/
theorem revocation_monotone (revocations : List Revocation) (r : Revocation) (v : VouchRef)
(h : isRevoked revocations v = true) :
isRevoked (r :: revocations) v = true := by
simp [isRevoked, List.any_cons] at *
exact Or.inr h
/-- Empty revocation list revokes nothing -/
theorem empty_revokes_nothing (v : VouchRef) :
isRevoked [] v = false := rfl
/-- A valid revocation for the exact vouch works -/
theorem valid_revocation_works (revoker revoked ts : Nat) (v : VouchRef)
(h_revoker : (revoker == v.voucher) = true)
(h_revoked : (revoked == v.vouchee) = true) :
isRevoked [⟨revoker, revoked, ts, true⟩] v = true := by
simp [isRevoked, List.any_cons, List.any_nil, h_revoker, h_revoked]
/-- Filter: only valid (signed) revocations matter -/
def validRevocations (revocations : List Revocation) : List Revocation :=
revocations.filter (·.sigValid)
/-- Filtering preserves revocation status -/
theorem valid_filter_preserves (revocations : List Revocation) (v : VouchRef)
(h : isRevoked revocations v = true) :
isRevoked (validRevocations revocations) v = true := by
simp only [isRevoked, validRevocations, List.any_eq_true, List.mem_filter,
Bool.and_eq_true] at *
obtain ⟨r, hr_mem, hr_match⟩ := h
exact ⟨r, ⟨hr_mem, hr_match.1.1⟩, hr_match⟩
end Trust.Revocation