40x less overhead! Rateless Invertible Bloom Filters - Part 3 of 3

inkandswitch/subduction

🏔️ Sync protocol for hash-linked data

Practical Rateless Set Reconciliation

HTML conversions sometimes display errors due to content that did not convert correctly from the source. This paper uses the following packages that are not yet supported by the HTML conversion tool. Feedback on these issues are not necessary; they are known and are being worked on.

Compiling Match Statements to Bytecode

Full pipeline deep dive for purple garden: AST, BB SSA IR, Bytecode, Optimisations

FlowLog - Efficient and Extensible Datalog | FlowLog

FlowLog: Efficient and Extensible Datalog via Incrementality

Email filters: Stay organized with these best practices | Proton

Learn how email filters can create better email organization and workflow, and increase your productivity at work.

Email filters: Stay organized with these best practices | Proton

Learn how email filters can create better email organization and workflow, and increase your productivity at work.

Making Databases Faster with LLM Evolutionary Sampling

Traditional query optimization relies on cost-based optimizers that estimate execution cost (e.g., runtime, memory, and I/O) using predefined heuristics and statistical models. Improving these heuristics requires substantial engineering effort, and even when implemented, these heuristics often cannot take into account semantic correlations in queries and schemas that could enable better physical plans. Using our DBPlanBench harness for the DataFusion engine, we expose the physical plan through a compact serialized representation and let the LLM propose localized edits that can be applied and executed. We then apply an evolutionary search over these edits to refine candidates across iterations. Our key insight is that LLMs can leverage semantic knowledge to identify and apply non-obvious optimizations, such as join orderings that minimize intermediate cardinalities. We obtain up to 4.78$\times$ speedups on some queries and we demonstrate a small-to-large workflow in which optimizations found on small databases transfer effectively to larger databases.

Ante: A New Way to Blend Borrow Checking and Reference Counting

Ante has taken the first step towards something we all thought was impossible: blending reference counting and borrow checking without run-time crashes. 0

OODA loop

Make faster decisions with incomplete data.

Bab

Bab is a family of secure hash functions, heavily inspired by BLAKE3. Bab hashes allow for streaming verification of strings, similar to the BLAKE3-based Bao algorithm. We discuss several optimization techniques that go beyond the Bao specification. Further, unlike BLAKE3 and Bao, Bab digests allow for constant-sized length proofs of their strings.

Benchmarks | EXO

Transparent benchmarks for LLMs tested on real hardware. Coming soon.

Concise Binary Object Representation (CBOR)

The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack. This document obsoletes RFC 7049, providing editorial improvements, new details, and errata fixes while keeping full compatibility with the interchange format of RFC 7049. It does not create a new version of the format.