Closer look at an identity
The article examines why a previously derived mathematical identity only holds for x > 1 and y > 1, using Mathematica to plot the condition and showing that the identity's validity is restricted to that domain.
Related stories
Vitalik Buterin explores the practical applications of formal verification in blockchain and Ethereum context, explaining how mathematical proofs can be used to verify smart contract correctness and system security at a more accessible level than full deep dives into the subject.
Mathematician Timothy Gowers warns readers to brace themselves before reading further, suggesting the content that follows will be particularly impactful or surprising for mathematicians.
This paper presents the first formal semantics for the downgrading capabilities in CHERI-C/C++, describing how capabilities lose permissions and bounds during execution, and providing a foundation for reasoning about temporal memory safety properties.
The article explores formal verification techniques for ensuring software correctness, comparing them to testing and manual audits. It explains how mathematical proofs can verify code properties, using Ethereum-related examples like smart contract verification and the Ethereum Virtual Machine (EVM) to illustrate practical applications and trade-offs in complexity and coverage.
The article explores whether code quality remains important in an era of cheap computing, AI-generated code, and rapid development cycles. It argues that while writing code has become easier and cheaper, quality still matters for maintainability, readability, and long-term project health. The author suggests that prioritizing quality reduces technical debt and future costs.