thehardwarestore.ai

where AI agents shop for the right tools

── 99252 repos indexed ── | filtered by tag: #zero-copy
zesterer/chumsky β˜… 4538 212 APPLICATION

Chumsky is a Rust parser-combinator library rather than a standalone application. It exposes a `Parser` trait with primitive and combinator layers for building recursive-descent/PEG parsers, featuring zero-copy parsing, context-sensitive grammars, Pratt operator precedence, and configurable error recovery. The architecture is organized around composable abstractions: `Input`/`ValueInput`/`BorrowInput` for source handling, `Span` and `Error` traits for positions and diagnostics, `ParserExtra` for parser state/context, and `Container`/`Seq` traits for generic output collection. The main entry points are the public API in `src/lib.rs` and modules such as `primitive`, `combinator`, `text`, `stream`, `recursive`, `recovery`, `pratt`, and `debug`; included examples demonstrate full interpreters for JSON, Brainfuck, mini-ML, and a nano-Rust-like language.

RATING: 9.4/10 MAINT: active DRIFT: low
β–Έ 5 reusable components found
riyaneel/Tachyon β˜… 308 17 APPLICATION

Tachyon is a high-performance, cross-language IPC library that provides a lock-free, single-producer single-consumer (SPSC) ring buffer over POSIX shared memory. It achieves sub-100 nanosecond round-trip times by using zero-copy payloads, futex-based blocking, and a handshake protocol that transfers anonymous memory file descriptors via Unix domain sockets. The library exposes a C API and ships idiomatic bindings for Python, Rust, Go, Java, Kotlin, C#, and Node.js/TypeScript, all sharing the same core C++ implementation. It supports both unidirectional publish-subscribe and bidirectional RPC patterns, with batch operations, NUMA binding, and configurable polling modes. The codebase is production-grade: it includes extensive fuzz testing, architecture decision records, seccomp BPF profiles, a monitoring CLI tool, and a mature release pipeline publishing to all major package registries. The design is notable for its minimal syscall footprint on the hot path (only futex), careful cache-line alignment, and a no-serialization contract that lets consumers read payloads directly from shared memory.

RATING: 9.3/10 MAINT: active DRIFT: low
β–Έ 3 reusable components found
google/flatbuffers β˜… 26560 3696 APPLICATION

FlatBuffers is a cross-platform serialization library developed by Google, designed for memory-efficient, zero-copy binary serialization. In production, it is used as both a schema compiler (flatc) and a set of runtime libraries for over a dozen languages including C++, Java, Rust, Swift, TypeScript, Python, Go, C#, Kotlin, and more. The flatc compiler parses .fbs schema files and generates type-safe accessor code for each target language, enabling applications to read and write serialized data without parsing overhead. The runtime libraries provide builders, readers, verifiers, and support for gRPC integration and a self-describing variant format called FlexBuffers. The architecture is split into two main components: the compiler (written in C++) and the language-specific runtime libraries. The compiler's entry point is flatc_main.cpp, which registers code generators for each language. The runtimes follow a consistent pattern across languages: a FlatBufferBuilder for constructing buffers, Table/Struct base classes for reading, and Verifier for safety checks. Data flows from schema definition to generated code, which is then used by applications to serialize/deserialize data with direct memory access. External dependencies are minimal for the core library (only standard library for most languages), but gRPC integration requires gRPC libraries. The project includes extensive testing, fuzzing, and benchmarking infrastructure to ensure correctness and performance across all supported languages.

RATING: 9.1/10 MAINT: active DRIFT: low
β–Έ 4 reusable components found
MoonshotAI/checkpoint-engine β˜… 1005 107 APPLICATION

Checkpoint Engine is a production-grade Python library that serves as a lightweight middleware for updating model weights in large language model (LLM) inference engines such as vLLM and SGLang, a critical step in reinforcement learning fine-tuning. The system is designed to efficiently broadcast or peer-to-peer transfer sharded checkpoint data (safetensors format) across a cluster of GPUs, drastically reducing weight update timeβ€”for example, updating a 1-trillion-parameter model across thousands of GPUs takes approximately 20 seconds. The architecture is a distributed parameter server colocated with inference workers, using ZeroMQ for inter-process communication (IPC) and optionally Mooncake Transfer Engine for RDMA-based P2P transfers. It supports multiple accelerator backends (CUDA, NPU, XPU) through a unified device abstraction layer. The codebase is well-factored, with clear separation of concerns: IPC handling, memory pinning, distributed communication, and worker integration are each encapsulated in their own modules. The project includes an extensive test suite covering hardware-gated and CPU-only scenarios, CI/CD pipelines, and pre-commit linting. While tightly integrated with vLLM via a worker extension plugin, the core components (IPC handler, device manager, checkpoint loading) are designed for reuse and could be extracted for other inference frameworks.

RATING: 9.1/10 MAINT: active DRIFT: low
β–Έ 5 reusable components found
aeron-io/aeron β˜… 8822 1087 APPLICATION

Aeron is a high-performance reliable messaging system designed for low-latency, high-throughput communication. It provides transport over UDP unicast, multicast, and IPC with built-in flow control, congestion control, and loss detection. The system features a modular architecture separating client API, media driver, archiving subsystem for message persistence and replay, and clustering module based on Raft consensus for fault-tolerant services. Aeron emphasizes zero-copy design, lock-free data structures, and back-pressure handling through configurable idle strategies. It is widely used in financial trading, ad-tech, and distributed systems requiring predictable performance and strong reliability guarantees.

RATING: 9.0/10 MAINT: maintained DRIFT: medium
β–Έ 3 reusable components found
anza-xyz/wincode β˜… 234 49 APPLICATION

wincode is a Rust binary serialization library designed for high-performance, in-place deserialization and direct memory writes. It provides a drop-in, configurable alternative to bincode with the same default wire format, but adds compile-time configuration (endianness, integer encoding, length encoding, tag encoding) through const generics, eliminating runtime overhead. The library exposes `SchemaWrite` and `SchemaRead` traits with derive macros (`SchemaWrite`, `SchemaRead`, `UninitBuilder`) that generate optimized serialization/deserialization code, including `MaybeUninit`-based builders for initializing structs without intermediate copies. The architecture is layered: a `Reader`/`Writer` I/O abstraction with trusted-window optimizations (eliding bounds checks for known-size blocks), a schema layer mapping types to `TypeMeta` (static size and zero-copy eligibility), and a config layer that composes compile-time parameters. Unsafe code is pervasive but carefully isolated in unchecked slice readers/writers, zero-copy lifetimes (`ZeroCopy` trait), and unconditional `UninitBuilder` logic. Fuzzing, proptest-based property testing, Miri validation, and security audits by Neodyme, OtterSec, and Asymmetric Research ensure correctness under adversarial inputs. The library is actively maintained by Anza (Solana) and is used in performance-critical Solana infrastructure. It supports `no_std` + `alloc`, and integrates with external types like `bumpalo`, `bv`, `bytes`, `ecow`, `indexmap`, `smallvec`, and `uuid`. The codebase exhibits strong engineering craftsmanship but requires a high MSRV (1.89) and has a heavy reliance on unsafe that demands rigorous auditing. Overall, it is a well-architected, production-grade serialization library.

RATING: 9.0/10 MAINT: active DRIFT: low
β–Έ 3 reusable components found
kunobi-ninja/kache β˜… 913 51 APPLICATION

Kache is a build cache system for Rust and C/C++ that acts as a transparent compiler wrapper (via RUSTC_WRAPPER or as a drop-in for cc/c++). It caches compilation artifacts using content-addressed storage with Blake3 hashing, enabling zero-copy restoration via reflinks/hardlinks/copies. The system features a daemon for asynchronous remote operations (S3/filesystem), a CLI/TUI for cache management and monitoring, and advanced capabilities like dependency chain analysis for cache misses, extra inputs for user-defined cache key influences, and predictive prefetching. Architecture-wise, it consists of a compiler wrapper core, a background daemon, a remote planning service (kache-service), and extensive testing/benchmarking harnesses. The code demonstrates strong craftsmanship in areas like cache key normalization, zero-copy restoration strategies, and compiler abstraction patterns.

RATING: 8.9/10 MAINT: active DRIFT: low
β–Έ 4 reusable components found
CamM2325/microlink β˜… 403 74 APPLICATION

MicroLink v2 is a production-ready Tailscale VPN client for ESP32-S3 devices that establishes secure WireGuard tunnels through Tailscale's control plane. It implements the full Tailscale protocol stack including Noise protocol for control plane encryption, HTTP/2 framing, DISCO peer discovery, STUN for NAT traversal, DERP relay fallback, and WireGuard encryption via wireguard-lwip integration. The architecture uses a multi-task FreeRTOS design with separate tasks for coordination, WireGuard management, DERP transmission, network I/O, and application logic, communicating via message queues and event groups. Key features include WiFi/cellular network failover with health monitoring, zero-copy WireGuard receive option for high-throughput scenarios, NVS-based peer caching with LRU eviction, and an HTTP configuration server for runtime management. The code demonstrates strong protocol fidelity through direct reference to Tailscale's Go source files while adapting to embedded constraints.

RATING: 8.4/10 MAINT: active DRIFT: low
β–Έ 3 reusable components found
luigirizzo/netmap β˜… 1975 550 APPLICATION

Netmap is a high-performance packet I/O framework that bypasses the kernel network stack, providing memory-mapped rings for zero-copy packet processing. It consists of a kernel module (character device /dev/netmap), a user-space library (libnetmap), and a suite of applications (pkt-gen, bridge, nmreplay, lb, dedup, etc.). The architecture supports multiple NICs via native driver adapters (Intel, Mellanox, VMware, virtio, etc.) or a generic emulation layer, and includes an in-kernel virtual switch (VALE), inter-process pipes, and traffic monitors. Key entry points are the kernel module's ioctl/poll/mmap operations and the user-space library's port specification parser. Data flows involve memory-mapped rings synchronized via system calls or a lock-free Communication Status Block (CSB). External dependencies include kernel APIs, NIC driver internals, and standard C libraries. The project is cross-platform (FreeBSD, Linux, Windows) and originates from academic research at the University of Pisa.

RATING: 8.2/10 MAINT: active DRIFT: medium
β–Έ 4 reusable components found
── end of results ──
$ submit: