A Solana Program Change Can Be Compatible with One Consumer but Not Another
Testing Provider Changes Against Consumer-Declared Requirements
Posts / 18 records
Searchable archive. For the latest feed with pagination, start on the home page.
A chronological index of field notes on research, engineering, markets, and protocols.
Testing Provider Changes Against Consumer-Declared Requirements
Two compiled Solana implementations accepted the same call. Both transactions succeeded; only one preserved the caller’s fixed postcondition.
A transaction-level audit shows why a quoted slippage threshold can disappear before a Solana swap lands.
Part II of the DFlow series: what a landed Solana transaction can and cannot prove about which router executed it.
How frozen AMM logs became a matched difference-in-differences pipeline in R, behind the finding of no large short-run liquidity exit after UNIfication.
When does a dynamic AMM fee actually help? Simulations of which pool-state signals let a fee price toxic flow.
How separate RWA evidence collectors became one Rust CLI: three contracts, versioned evidence bundles, and reproducible audits.
An interactive P2P attack gym in Rust: slot pressure, fake state, and poisoned discovery, made visible on 127.0.0.1.
Sybil, Eclipse, and network-partition attacks, traced from real incidents and rebuilt as local simulations in a Rust lab.
A Rust-based pipeline that turns stablecoin transfer checks into artifacts, manifests, and an inspectable evidence console.
A mini ZK-rollup verifier in Rust, built from the basics most explanations skip: Pedersen commitments, Sigma proofs, and Merkle state.
Testing Metering Chain against the guarantees defined in Phases 1-4, with QA cases that follow business logic rather than code paths.
Why digital finance still leans on centralized operators, what blockchains change about trust and state, and why Rust fits the systems underneath.
From accounting to settlement: how Metering Chain defines when a bill becomes economically final.
In DePIN, owners can't sign every event. Capability-driven delegation lets operators submit usage without opening a trust hole.
Deterministic authorization for multi-operator DePIN: deciding who may submit usage, so replayed history still yields the same bill.
Replaying usage into deterministic balances (same history, same bill) after one too many "we have the logs, but the bill feels wrong" incidents.
Five consensus algorithms implemented conceptually in Rust to compare PBFT, Gossip, Eventual Consistency, Quorum-less, and Flexible Paxos.