Exploring how game-theoretical modeling can be applied to decentralized exchange (DEX) protocols to identify design weaknesses and strategic attack vectors. We discuss the incentives and strategies of participants in Uniswap, SushiSwap, Cetus, and KyberSwap, illustrating how game theory can reveal exploits and inform more secure DEX design.| Blogs on Inferara
Demonstrating how to define a single-argument abstract Method trait in Rust, and use a PhantomData-based hint technique to automatically infer generic types.| Blogs on Inferara
A look into specialized C standard libraries like Newlib, picolibc, nanolib, and dietlibc, designed for resource-constrained environments where standard libraries like glibc are too large or complex.| Blogs on Inferara
In this post, we explore an advanced CPS (Continuation-Passing Style) implementation that leverages local memory pointers alongside arrow statements to declare an abstract program.| Blogs on Inferara
Embedding formal specification constructs directly into programming languages could revolutionize smart contract development and eradicate vulnerabilities in smart contracts.| Blogs on Inferara
Arena-based allocation is a memory management strategy in which a large block of memory is pre-allocated, and then many small objects are quickly carved out from that block.| Blogs on Inferara
The C runtime (CRT) is a collection of startup routines, initialization code, standard library support, and sometimes system call wrappers that form the environment in which a C program executes.| Blogs on Inferara
This blog outlines the basics of propositional logic, as explained by the book “Logic in compuer science”.| Blogs on Inferara
The second part of the conspect of the “Intoduction to TLA+” course by Leslie Lamport.| Blogs on Inferara
The first part of the conspect of the “Intoduction to TLA+” course by Leslie Lamport.| Blogs on Inferara
This blog outlines small-step and big-step semantics, their differences, and applications in analyzing computer programs.| Blogs on Inferara
In this blog we explore linear temporal logic as well as computation tree logic, and how we could use them to verify smart-contracts.| Blogs on Inferara
A deep dive into implementing the ’tagless initial’ pattern in Rust using enums and the never type to achieve zero-cost abstractions, demonstrated with optimized assembly output.| Inferara