The ip command from the iproute2 suite has replaced the legacy ifconfig and route tools on virtually every modern Linux distribution. For the LFCS exam, ip addr is the essential tool for inspecting and modifying network interface addresses. The command operates on live kernel state, which means every change made with ip addr add or…
1. Toolchain & Cargo 2. Variables & Mutability 3. Primitives & Types 4. Strings 5. Ownership & Borrowing 6. Structs & Enums 7. Pattern Matching 8. Traits & Generics 9. Smart Pointers 10. Error Handling 11. Closures 12. Iterators 13. Threads & Concurrency 14. Unsafe & FFI 15. Lifetimes 16. Macros 17. Edition 2024 Changes…
Testing shows the presence of bugs, never their absence. Fuzzing finds panics and crashes, but it cannot prove that a function returns the correct value for every possible input. Formal verification is the discipline of mathematically proving that a program satisfies a specification. For Rust, two tools occupy opposite ends of the verification spectrum. Kani…
Fuzzing is the automated art of throwing malformed, mutated, and malicious inputs at a program until it breaks. In C and C++, a fuzzer’s goal is memory corruption: heap overflows, use-after-free, and out-of-bounds writes. In safe Rust, those specific bugs are impossible—the compiler eliminates them. But this does not make fuzzing irrelevant. It shifts the…
A compiled Rust binary is not a black box. The machine code can be disassembled, the data sections can be read, and the control flow can be reconstructed. For developers shipping proprietary algorithms, licensing logic, or security-sensitive code, this visibility is a liability. The defense is layered: stripping symbols removes the map that makes reverse…
In high-frequency trading, latency is measured in nanoseconds, and memory allocation is the enemy. A single call to the system allocator can cost hundreds of nanoseconds—an eternity when competing orders are separated by microseconds. Rust’s ownership model and zero-cost abstractions make it a viable language for HFT, but the default allocator and standard data structures…
A distributed system is a collection of independent computers that appears to its users as a single coherent system. The moment a Rust backend outgrows a single process, the communication layer becomes the critical path: it determines latency, failure behavior, and the shape of every service boundary. Remote Procedure Calls (RPC) abstract the network away,…
Single Instruction, Multiple Data (SIMD) allows a CPU to process multiple values with a single instruction. On modern x86_64 processors, this means adding four f32 values in the time it takes to add one, or processing eight u8 values in a single operation. Rust provides two primary paths to SIMD: the std::arch module, which exposes…
Rust’s default build path assumes the host machine and the target machine are the same. A standard cargo build compiles for the host architecture, links against the host’s C library, and produces a binary that runs on the machine that produced it. Cross-compilation breaks this assumption. The toolchain must be told which target to build…
Extended Berkeley Packet Filter (eBPF) allows custom programs to run inside the Linux kernel without changing kernel source code or loading modules. For years, writing eBPF meant writing C and relying on libbpf and clang. The aya framework changes this: it is a pure-Rust library that lets you write both the kernel-side eBPF program and…