stackdump stackdump

State Root Chain Approach for ZK Games

An analysis of using cryptographic state root chains for zero-knowledge game verification.

Instead of proving facts about a game after it ends, prove each state transition as it happens:

Traditional ZK Game:

A survey of zero-knowledge proof implementations for tic-tac-toe games.

Implementation	Framework	Year	Language	Live Demo
andreysobol/tic-tac-toe-snark	ZoKrates	2019	JavaScript/Java	No
Aleo Leo Examples	Leo/Aleo	2022+	Leo	Playground

When using cdn.jsdelivr.net/gh/{owner}/{repo}@latest/..., the @latest tag resolves to the latest GitHub Release (not just a git tag).

You push a new tag but @latest still serves the old version because:

Petri-pilot generates Go code that leverages generics from go-pflow for type-safe event sourcing.

Every generated aggregate uses eventsource.StateMachine[State] for compile-time type safety:

// generated/erc20token/aggregate.go

A template for building deterministic, verifiable systems with parallel Go/JavaScript implementations.

Build complex stateful systems where state is a function of events:

State(t) = fold(apply, initialState, events[0..t])

	# Petri Net Lemmas

	Formal properties of arcnet's Petri net object model.

	## Definitions

	Model = (P, T, A) where:
	- P = set of places
	- T = set of transitions
	- A = set of arcs ⊆ (P × T) ∪ (T × P)