Base PCN Algebraic Security

Can payment channel security be proved without cryptographic assumptions? Standard PCN security proofs rely on computational hardness (discrete log, hash preimage resistance). This project establishes an orthogonal layer: algebraic invariants that hold unconditionally. Capacity is conserved under routing. Flow balance is maintained at every node. Settlement correctness links on-chain and off-chain state. These properties hold even if the underlying cryptography is broken — they are structural, not computational. Specialized for Coinbase’s Base L2 rollup architecture.