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

86 lines
2.8 KiB
Lean4
Raw Permalink Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
/-
Authors: Antje Worring, Zoo Labs Foundation Research
Warp Cross-Chain Exactly-Once Delivery
Models the Warp messaging protocol used for cross-chain communication.
Warp messages carry BLS aggregate signatures from source chain validators.
The destination chain verifies the aggregate signature against the known
validator set before processing.
Maps to:
- src/precompiles/warp/: Warp precompile at 0x0200...0005
- treasury/Vault.sol: usedNonces mapping for replay protection
- treasury/Collect.sol: version monotonicity for settings
Properties:
- Authenticity: only messages signed by source validators are accepted
- No replay: each message processed at most once (nonce tracking)
- No loss: valid messages eventually delivered (under liveness assumption)
- Combined: exactly-once delivery
-/
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Finset.Basic
import Mathlib.Tactic
namespace Warp.Delivery
/-- Chain identifier -/
abbrev ChainId := Nat
/-- Warp message -/
structure WarpMessage where
sourceChain : ChainId
destChain : ChainId
nonce : Nat
payload : Nat -- hash of payload
sigValid : Bool -- BLS aggregate signature valid
/-- Destination chain state for Warp processing -/
structure DestState where
processedNonces : Finset Nat -- nonces already processed
lastProcessed : Nat -- monotonic counter
/-- Process a Warp message -/
def processMessage (s : DestState) (msg : WarpMessage) : Option DestState :=
if ¬msg.sigValid then none -- reject invalid signature
else if msg.nonce ∈ s.processedNonces then none -- reject replay
else some {
processedNonces := s.processedNonces ∪ {msg.nonce}
lastProcessed := max s.lastProcessed msg.nonce
}
/-- No replay: a processed nonce is never accepted again -/
theorem no_replay (s : DestState) (msg : WarpMessage)
(hmem : msg.nonce ∈ s.processedNonces) :
processMessage s msg = none := by
simp [processMessage]
intro _
exact hmem
/-- Authenticity: only valid signatures are processed -/
theorem authenticity (s : DestState) (msg : WarpMessage)
(hinv : msg.sigValid = false) :
processMessage s msg = none := by
simp [processMessage, hinv]
/-- Valid messages succeed on first attempt -/
theorem valid_message_succeeds (s : DestState) (msg : WarpMessage)
(hsig : msg.sigValid = true)
(hfresh : msg.nonce ∉ s.processedNonces) :
∃ s', processMessage s msg = some s' := by
simp [processMessage, hsig, hfresh]
/-- Processed nonces grow monotonically -/
theorem nonces_monotone (s : DestState) (msg : WarpMessage) (s' : DestState)
(h : processMessage s msg = some s') :
s.processedNonces ⊆ s'.processedNonces := by
simp [processMessage] at h
obtain ⟨_, _, heq⟩ := h
subst heq
exact Finset.subset_union_left
end Warp.Delivery