Improving NAT traversal, part 2: challenges in cloud environments

How Tailscale can work with and inside Google Cloud, Microsoft Azure, and Amazon Web Services.

tailscale.com

Autotools Mythbuster

Autotools Mythbuster is a no-nonsense guide to Autotools, written with the idea of providing a full, integrated view of the tools in the GNU build chain: autoconf, automake, libtool, pkg-config, and so on. Instead of providing a full detailing of the workings of the components, which most consumers are not interested on, this guide focuses on building useful, solid and distribution-friendly packages, that developers can submit to distributions without having to jump through hoops to get them accepted. Autotools Mythbuster is available as an eBook on Amazon for those who want to read or reference it online. Profits from its sales are used to pay for hosting and domain name registration.

autotools.info

The Encryption Summit 2025: A Shield in Uncertain Times, The Role of Encryption – Global Encryption Coalition

A Shield in Uncertain Times: The Role of Encryption highlights the ways encryption protects our security and privacy during dangerous times.

www.globalencryption.org · Global Encryption Coalition

The Neurodivergent Genius Who Invented Formula 1 For Marbles

Marble racing has become a viral sport on YouTube, drawing millions of fans to intense marble league tournaments, high-speed marble runs, and oddly satisfyin...

www.youtube.com · YouTube

A Tool That Crushes Creativity

AI slop is winning.

www.theatlantic.com · The Atlantic

GitHub - bilinearlabs/rs-merkle-tree: Merkle tree implementation in Rust with configurable storage backends and hash functions. Fixed depth and incremental only. Optimized for fast proof generation.

Merkle tree implementation in Rust with configurable storage backends and hash functions. Fixed depth and incremental only. Optimized for fast proof generation. - bilinearlabs/rs-merkle-tree

github.com · GitHub

Receiptify

receiptify.herokuapp.com

HITrees: Higher-Order Interaction Trees

Recent years have witnessed the rise of compositional semantics as a foundation for formal verification of complex systems. In particular, interaction trees have emerged as a popular denotational semantics. Interaction trees achieve compositionality by providing a reusable library of effects. However, their notion of effects does not support higher-order effects, i.e., effects that take or return monadic computations. Such effects are essential to model complex semantic features like parallel composition and call/cc. We introduce Higher-Order Interaction Trees (HITrees), the first variant of interaction trees to support higher-order effects in a non-guarded type theory. HITrees accomplish this through two key techniques: first, by designing the notion of effects such that the fixpoints of effects with higher-order input can be expressed as inductive types inside the type theory; and second, using defunctionalization to encode higher-order outputs into a first-order representation. We implement HITrees in the Lean proof assistant, accompanied by a comprehensive library of effects including concurrency, recursion, and call/cc. Furthermore, we provide two interpretations of HITrees, as state transition systems and as monadic programs. To demonstrate the expressiveness of HITrees, we apply them to define the semantics of a language with parallel composition and call/cc.

arxiv.org · arXiv.org

Certifying optimal MEV strategies with Lean

Maximal Extractable Value (MEV) refers to a class of attacks to decentralized applications where the adversary profits by manipulating the ordering, inclusion, or exclusion of transactions in a blockchain. Decentralized Finance (DeFi) protocols are a primary target of these attacks, as their logic depends critically on transaction sequencing. To date, MEV attacks have already extracted billions of dollars in value, underscoring their systemic impact on blockchain security. Verifying the absence of MEV attacks requires determining suitable upper bounds, i.e. proving that no adversarial strategy can extract more value (if any) than expected by protocol designers. This problem is notoriously difficult: the space of adversarial strategies is extremely vast, making empirical studies and pen-and-paper reasoning insufficiently rigorous. In this paper, we present the first mechanized formalization of MEV in the Lean theorem prover. We introduce a methodology to construct machine-checked proofs of MEV bounds, providing correctness guarantees beyond what is possible with existing techniques. To demonstrate the generality of our approach, we model and analyse the MEV of two paradigmatic DeFi protocols. Notably, we develop the first machine-checked proof of the optimality of sandwich attacks in Automated Market Makers, a fundamental DeFi primitive.

arxiv.org · arXiv.org

Working in Between Public and Private - Jacob Kaplan-Moss

If working in public isn’t working, consider adopting a middle-ground option instead of retreating into fully-private.

jacobian.org

Pastyou🔥🕯 (@pastyou.bsky.social)

This post requires authentication to view.

bsky.app · Bluesky Social

Radical Gallery

radical-gallery.neocities.org