Nanoda

Rust is a systems programming language and toolchain developed by the Rust project. Its compiler, standard library, documentation, package manager and build tool Cargo, formatter rustfmt, linter Clippy, and editor support are maintained in the main repository. The language uses a rich type system and ownership model to enforce memory and thread safety at compile time, while targeting fast, memory-efficient software for critical services, embedded devices, and integration with other languages. Rust is primarily distributed under the MIT and Apache 2.0 licenses, with portions under BSD-like licenses.

PDF Inspector is an open-source Rust library by Firecrawl for classifying PDF documents and extracting position-aware text without OCR. It samples content streams to classify documents as text-based, scanned, image-based, or mixed, returns confidence scores and per-page OCR-routing information, and detects broken font encodings. Its extractor uses font information and X/Y coordinates to determine reading order, including multi-column and right-to-left layouts, and converts content to Markdown with headings, lists, code blocks, tables, formatting, links, and page breaks. Native Rust and CLI consumers can opt into selective OCR for pages that need it; the Python and Node.js bindings can run the same workflow, while browser WebAssembly provides local parsing without a server round trip. The project also supports CID font decoding and shares a single parsed document between classification and extraction.

Nanostack is a lightweight IPv6/6LoWPAN network protocol stack for low-power IoT devices, developed for use with Arm Mbed OS. It implements IPv6 networking, 6LoWPAN adaptation, and related mesh networking features for constrained devices.

A research artifact containing a complete machine-checked Lean 4 proof of Fermat's Last Theorem, following the Frey–Serre–Ribet–Wiles and Taylor–Wiles argument and built on Mathlib. The theorem states that for natural numbers n, a, b, and c with n ≥ 3 and a, b, and c positive, a^n + b^n ≠ c^n. Lean's kernel checks the proof, which uses only Lean's three standard axioms—propext, Classical.choice, and Quot.sound—and the repository excludes sorry statements, added axioms, native_decide, unsafe code, and related escape mechanisms. A comparator independently replays the environment against a Mathlib formulation, while Nanoda, an independent Lean kernel implemented in Rust, checks an exported version of the environment. The repository also includes PROOF-PATH.md and an offline HTML presentation of the proof's theorems, definitions, dependencies, and generated documentation. It is released under the Apache License 2.0 and is described as not maintained and not accepting contributions.

loop.js is a TypeScript framework and CLI for loop engineering: it runs an agent against a declared goal and verification criterion until a separate, skeptical Verify agent judges the work complete. Each round starts with fresh context and reads state and handoff notes from disk; the worker agent cannot approve its own work, and a failed verification supplies a reason for the next round. The framework provides round, spending, and per-round timeout guards; typed exits; crash recovery; idempotent resumption from a stored cursor; and a compare-and-set lock with heartbeat to prevent overlapping live runs and take over dead ones. It can run from a terminal, be embedded in a product, or be scheduled through crontab, launchd, Task Scheduler, or Modal's cloud.