mirror of
https://github.com/zooai/proofs.git
synced 2026-10-30 14:49:47 +00:00
zeekayandHanzo Dev
638fba4c90
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]>
74 lines
2.3 KiB
Lean4
74 lines
2.3 KiB
Lean4
/-
|
|
Authors: Antje Worring, Zoo Labs Foundation Research
|
|
|
|
Nova Protocol Formal Model
|
|
|
|
Models protocol/nova/nova.go -- linear blockchain consensus mode.
|
|
|
|
Nova wraps Ray (linear decision engine) and provides blockchain semantics.
|
|
It is the simplest consensus mode: blocks form a chain, decided sequentially.
|
|
|
|
Maps to:
|
|
- nova.go: Nova struct wrapping ray.Driver
|
|
- nova.go: Config{SampleSize, Alpha, Beta, RoundTO, GenesisHash}
|
|
- nova.go: NewNova, Start, Stop, Status
|
|
|
|
Nova delegates all consensus logic to Ray, which delegates voting to Wave.
|
|
The composition: Nova -> Ray -> Wave -> Prism (sampling)
|
|
|
|
Properties:
|
|
- Chain property: decided blocks form a valid chain (parent links)
|
|
- Genesis: genesis block is always the first decided block
|
|
- Height monotonicity: block heights are strictly increasing
|
|
-/
|
|
|
|
import Mathlib.Data.Nat.Defs
|
|
import Mathlib.Tactic
|
|
|
|
namespace Protocol.Nova
|
|
|
|
/-- Block in linear chain -/
|
|
structure Block where
|
|
id : Nat
|
|
parentId : Nat
|
|
height : Nat
|
|
|
|
/-- Nova chain state -/
|
|
structure NovaState where
|
|
chain : List Block
|
|
lastHeight : Nat
|
|
|
|
/-- Genesis state -/
|
|
def genesis (genesisBlock : Block) (_hg : genesisBlock.height = 0) : NovaState :=
|
|
{ chain := [genesisBlock], lastHeight := 0 }
|
|
|
|
/-- Append block to chain -/
|
|
def appendBlock (s : NovaState) (b : Block)
|
|
(_hparent : b.parentId = (s.chain.head?.map Block.id).getD 0)
|
|
(_hheight : b.height = s.lastHeight + 1) : NovaState :=
|
|
{ chain := b :: s.chain, lastHeight := b.height }
|
|
|
|
/-- Height is strictly increasing -/
|
|
theorem height_increases (s : NovaState) (b : Block)
|
|
(hparent : b.parentId = (s.chain.head?.map Block.id).getD 0)
|
|
(hheight : b.height = s.lastHeight + 1) :
|
|
(appendBlock s b hparent hheight).lastHeight > s.lastHeight := by
|
|
simp [appendBlock, hheight]
|
|
|
|
/-- Chain grows on append -/
|
|
theorem chain_grows (s : NovaState) (b : Block)
|
|
(hp : b.parentId = (s.chain.head?.map Block.id).getD 0)
|
|
(hh : b.height = s.lastHeight + 1) :
|
|
(appendBlock s b hp hh).chain.length = s.chain.length + 1 := by
|
|
simp [appendBlock, List.length_cons]
|
|
|
|
/-- Genesis has height 0 -/
|
|
theorem genesis_height (b : Block) (hg : b.height = 0) :
|
|
(genesis b hg).lastHeight = 0 := rfl
|
|
|
|
/-- Genesis chain has exactly one block -/
|
|
theorem genesis_single (b : Block) (hg : b.height = 0) :
|
|
(genesis b hg).chain.length = 1 := rfl
|
|
|
|
end Protocol.Nova
|