Architecture

A blockchain as a state machine: how a transaction becomes a new network state.

A blockchain is a state machine. Every node applies the same rules to the same transactions and must arrive at the same next state.

S(t+1) = F( S(t), T(t) )

S(t) is the current state, T(t) the set of transactions in this block, F the transition rules, and S(t+1) the resulting state.

In plain terms: state is the balance sheet of the network — balances, positions, market state. A block is a batch of instructions. Applying the batch to the old balance sheet, using rules everyone agrees on, produces the new balance sheet.

S(t)   = { Alice: 100 USDC }
T(t)   = { Alice → Bob : 30 USDC }
S(t+1) = { Alice: 70 USDC, Bob: 30 USDC }

A minimal example: one transfer, one deterministic new state. Anyone replaying the same input reaches the same result.

Transaction path

Transaction

Sequencer

Execution

Data Availability

Settlement

New State

Sequencer — decides the order of transactions in a block.
Execution — applies F and computes the resulting state.
Data Availability — publishes transaction data so the state can be independently reconstructed.
Settlement — makes the state final and value transfers irreversible.

PolyWin Chain is EVM-compatible in design. Detailed network parameters are published once the network is live.