7CFC2E494F4583…A17FD689C481

Arguments · 9

1. #1governor
2. #2README.md
3. #3# Governor > ⚠️ **Experimental — generated with no human supervision** by the daily MCP pipeline (Solidity→Gno port). Not audited. See [r/moul/x/daily](https://github.com/moul/gno-contracts/blob/main/r/moul/x/daily/README.md). --- A simplified on-chain governance realm inspired by OpenZeppelin's `Governor`. It ports the core proposal → vote → execute lifecycle to Gno: `Propose` records a proposal's snapshot height and a deadline of `ChainHeight() + votingPeriod`, `CastVote` gives every address a single equally-weighted vote (1 address = 1 vote, tracked in an avl voter set), and `State` computes `Active` / `Succeeded` / `Defeated` from the deadline versus the current chain height plus whether the `for` tally beats `against`. `Execute` finalizes a `Succeeded` proposal. Unlike the ERC20Votes-weighted original, voting power here is flat (one address, one vote) and there is no timelock — the emphasis is on a clean, deterministic state machine driven by block height. ## Example calls ``` # open a proposal (returns its id) Propose("Fund the docs working group for Q3") # vote: 0=against, 1=for, 2=abstain (one vote per address) CastVote(1, 1) # read the current state: Active | Succeeded | Defeated | Executed State(1) # once past the deadline with for > against, finalize it Execute(1) ``` `Render("")` lists every proposal with its tally bars (`▓░`) and state. <!-- BEGIN GNOCONTRACTS FOOTER (generated by `make readmes`; do not edit below) --> --- Part of **[moul/gno-contracts](https://github.com/moul/gno-contracts)** — moul's versioned gno.land contracts. See the repository for the full catalog, build/test tooling, and usage. **Dependency graph:**  > 🧪 **Highly experimental — potentially vibe-coded.** Not audited; may break, change, or be removed at any time. Do not use with anything of value. Full disclaimer: [DISCLAIMER](https://github.com/moul/gno-contracts/blob/main/DISCLAIMER.md). <!-- END GNOCONTRACTS FOOTER -->
4. #4gnomod.toml
5. #5module = "gno.land/r/moul/x/daily/governor/v0" gno = "0.9"
6. #6governor.gno
7. #7// Package governor is a simplified on-chain governance realm inspired by // OpenZeppelin's Governor. Anyone may open a proposal; every address gets a // single equally-weighted vote (1 address = 1 vote); a proposal succeeds when // its voting deadline has passed and the "for" tally strictly beats "against". package governor import ( "strconv" "strings" "chain" "chain/runtime" "chain/runtime/unsafe" "gno.land/p/nt/avl/v0" ) // votingPeriod is the number of blocks a proposal stays open for voting. const votingPeriod = int64(100) // Vote support values. const ( VoteAgainst = 0 VoteFor = 1 VoteAbstain = 2 ) // Proposal state values. const ( StateActive = "Active" StateSucceeded = "Succeeded" StateDefeated = "Defeated" StateExecuted = "Executed" ) // Proposal is a single governance proposal. type Proposal struct { ID int64 Proposer address Description string SnapshotHeight int64 Deadline int64 For int64 Against int64 Abstain int64 Executed bool votes *avl.Tree // voter address (string) -> support (int) } var ( proposals = avl.NewTree() // id (zero-padded string) -> *Proposal nextID = int64(1) totalCount int64 ) // Propose opens a new proposal and returns its id. The snapshot height and // deadline are recorded from the current chain height. func Propose(cur realm, description string) int64 { if strings.TrimSpace(description) == "" { panic("governor: empty description") } proposer := unsafe.PreviousRealm().Address() h := runtime.ChainHeight() id := nextID nextID++ totalCount++ p := &Proposal{ ID: id, Proposer: proposer, Description: description, SnapshotHeight: h, Deadline: h + votingPeriod, votes: avl.NewTree(), } proposals.Set(idKey(id), p) chain.Emit( "ProposalCreated", "id", strconv.FormatInt(id, 10), "proposer", proposer.String(), "deadline", strconv.FormatInt(p.Deadline, 10), ) return id } // CastVote records one vote for the caller on proposal id. support is // 0=against, 1=for, 2=abstain. One address may vote at most once per proposal, // and voting is only allowed while the proposal is Active. func CastVote(cur realm, id int64, support int) { p := mustGet(id) if computeState(p, runtime.ChainHeight()) != StateActive { panic("governor: voting closed") } if support < VoteAgainst || support > VoteAbstain { panic("governor: invalid support value") } voter := unsafe.PreviousRealm().Address() if p.votes.Has(voter.String()) { panic("governor: already voted") } p.votes.Set(voter.String(), support) switch support { case VoteFor: p.For++ case VoteAgainst: p.Against++ default: p.Abstain++ } chain.Emit( "VoteCast", "id", strconv.FormatInt(id, 10), "voter", voter.String(), "support", strconv.Itoa(support), ) } // Execute marks a Succeeded proposal as executed. It panics unless the // proposal has reached the Succeeded state. func Execute(cur realm, id int64) { p := mustGet(id) if computeState(p, runtime.ChainHeight()) != StateSucceeded { panic("governor: proposal not in Succeeded state") } p.Executed = true chain.Emit("ProposalExecuted", "id", strconv.FormatInt(id, 10)) } // State returns the current lifecycle state of proposal id. func State(id int64) string { return computeState(mustGet(id), runtime.ChainHeight()) } // computeState is the pure state machine: it decides the state of p at chain // height h. Kept free of globals so it is unit-testable. func computeState(p *Proposal, h int64) string { if p.Executed { return StateExecuted } if h < p.Deadline { return StateActive } if p.For > p.Against { return StateSucceeded } return StateDefeated } func mustGet(id int64) *Proposal { key := idKey(id) if !proposals.Has(key) { panic("governor: unknown proposal " + strconv.FormatInt(id, 10)) } return proposals.Get(key).(*Proposal) } // idKey returns a zero-padded, lexicographically-sortable key for an id so the // avl tree iterates proposals in numeric order. func idKey(id int64) string { s := strconv.FormatInt(id, 10) const width = 12 if len(s) >= width { return s } return strings.Repeat("0", width-len(s)) + s } // bar renders a proportional ▓░ progress bar of fixed width. func bar(value, total int64, width int) string { if width <= 0 { return "" } filled := 0 if total > 0 { filled = int((value*int64(width) + total/2) / total) if filled > width { filled = width } } return strings.Repeat("▓", filled) + strings.Repeat("░", width-filled) } // Render lists all proposals with their tallies and states as Markdown. func Render(path string) string { var b strings.Builder b.WriteString("# 🏛️ Governor\n\n") b.WriteString("Simplified on-chain governance — 1 address = 1 vote, ") b.WriteString("voting period of " + strconv.FormatInt(votingPeriod, 10) + " blocks.\n\n") h := runtime.ChainHeight() b.WriteString("Current chain height: **" + strconv.FormatInt(h, 10) + "**\n\n") if totalCount == 0 { b.WriteString("_No proposals yet. Call `Propose` to create one._\n") return b.String() } b.WriteString("Total proposals: **" + strconv.FormatInt(totalCount, 10) + "**\n\n") proposals.Iterate("", "", func(_ string, v interface{}) bool { p := v.(*Proposal) state := computeState(p, h) total := p.For + p.Against + p.Abstain b.WriteString("---\n\n") b.WriteString("## #" + strconv.FormatInt(p.ID, 10) + " · " + state + "\n\n") b.WriteString("> " + p.Description + "\n\n") b.WriteString("- Proposer: `" + p.Proposer.String() + "`\n") b.WriteString("- Snapshot height: " + strconv.FormatInt(p.SnapshotHeight, 10) + "\n") b.WriteString("- Deadline height: " + strconv.FormatInt(p.Deadline, 10)) if state == StateActive { b.WriteString(" (" + strconv.FormatInt(p.Deadline-h, 10) + " blocks left)") } b.WriteString("\n\n") b.WriteString("| Choice | Votes | Tally |\n") b.WriteString("|---|---|---|\n") b.WriteString("| For | " + strconv.FormatInt(p.For, 10) + " | `" + bar(p.For, total, 20) + "` |\n") b.WriteString("| Against | " + strconv.FormatInt(p.Against, 10) + " | `" + bar(p.Against, total, 20) + "` |\n") b.WriteString("| Abstain | " + strconv.FormatInt(p.Abstain, 10) + " | `" + bar(p.Abstain, total, 20) + "` |\n\n") return false }) return b.String() }
8. #8/gno.MemPackageType
9. #9 MPUserProd