Conflict-free Replicated Data Types (CRDTs) ensure Strong Eventual Consistency without coordination, but typically assume benign participants and rely on validation or exclusion to handle Byzantine behavior. We address this problem through deterministic state reconstruction: rather than deciding which updates are admissible, all accepted updates are incorporated, while only a subset contributes to the reconstructed state. We instantiate this app... Read more ›
🚀 Create Quick Nest A Quick Setup for NestJS 11 + Prisma 7 + PostgreSQL backend in seconds. The fastest way to start a NestJS + Prisma database project. Skip boilerplate, skip setup start building real features in minutes. Create your project instantly: bunx quick-nest my-app # or npx quick-nest my-app npm/bun pacakge : Your NestJS + Prisma database is ready to go. ✨ Features 🏗️ NestJS 11 — Modern, opinionated Node.js framework 🗄️ Prisma ORM v7 — Type-safe PostgreSQL ORM with auto-migrations ... Read more ›
I’ve written a couple posts lately on getting an LLM to generate code to solve chess problems. The first used Claude to generate Prolog and the second used ChatGPT to generate Prolog. This post will use Claude to generate Z3/Python code. The puzzle is one I’ve written about before: Place all the pieces—king, queen, two […] The post first appeared on . Read more ›
A lot has happened in transformer quantization over the past few years, from barely being able to quantize a 7B model in INT8 without... Read more ›
I’m building a B+Tree as part of a database project, style but in Rust, inspired by QuillSQL and the Bustub by CMU. This post was a set of… Read more ›
Two models on Hugging Face looked ordinary — but the instant you loaded one, it opened a backdoor to your machine. The trick: a file… Read more ›
Data structures sound scary. They are not. Let this simple project show you exactly what they are and why they matter. Read more ›
Sampling from complex, unnormalized probability densities is a fundamental challenge in Bayesian inference and probabilistic modeling. While Markov chain Monte Carlo (MCMC) methods provide asymptotic guarantees, they often suffer from slow mixing and high computational costs due to fixed or manually tuned trajectory lengths. In this work, we propose a novel framework that treats trajectory termination as a learnable component of the sampling dyn... Read more ›
A real-time order analytics pipeline built on CDC from Postgres to ClickHouse on the Brazilian Ecommerce Dataset - el10savio/ecommrt Read more ›
String sorting is a fundamental operation in various data-intensive applications, ranging from bioinformatics to database indexing. However, parallelizing string sorting remains challenging due to irregular memory access patterns, which often lead to inefficient cache utilization. This paper introduces the Parallel N-Deque Partition Dual-Deque Merge string sorting algorithm, which is evaluated against several state-of-the-art parallel sorting techniques. It utilizes a parallel block-based par... Read more ›
#Shell Metadata Release Generated: 2026-06-18 09:12:59 UTC Contents File Size metadata-aarch64-linux.json 441K metadata-aarch64-linux.json.zstd 59K metadata-aarch64-linux.sdb 320K metadata-aarch64-linux.sdb.zstd 50K metadata-x86_64-linux.json 582K metadata-x86_64-linux.json.zstd 76K metadata-x86_64-linux.sdb 404K metadata-x86_64-linux.sdb.zstd 64K This release was generated automatically. Read more ›
Earlier this year I on how to implement slopes in AABB collision resolution using bump.lua. The resulting system worked, but was a bit hard to use in-game and had a few issues, so I wouldn’t consider it a viable solution. The main issue with the old approach was the use of the cross collision response. It allowed the object to move through the slope as if it wasn’t there at all, and then the update loop corrected the y position after the fact. This alone makes writing code the game a lot more... Read more ›
Shadow warrior test includes a written exam, with marks given for shuriken throwing and ninja attire. On 14 June, 131 aspiring modern-day ninjas descended on Koka City in Shiga Prefecture to test their ninja prowess by taking a special ninja certification test. Known as the Koka-ryu Ninja Certification, with “Koka-ryu” meaning “Koka School”, the exam […] Read more ›
Cloudflare won't re-compress an asset your origin already gzipped, so browsers got 50KB gzip instead of 40KB Brotli. The fix is one line of nginx. Read more ›
Reinforcement learning (RL)-based post-training for large language models (LLMs) is computationally expensive, as it generates many rollout sequences that frequently share long token prefixes. Existing RL frameworks usually process these sequences independently during policy training, i.e., repeatedly recomputing identical prefixes in both the forward and backward passes of policy gradient computation, leading to substantial inefficiencies i... Read more ›
Calculate distributed progress without a central leader. You use this pure mathematical primitive to merge partially ordered timestamps across your network. Its lattice algebra guarantees your work... Read more ›
I tried solving Leetcode problem #10( Regular Expression Matching) for fun, ended up spending hours on it. problem Link: I took a naive greedy string construction approach to check if the string s matched the pattern p. That worked for simple cases where: p="a*b" s="aaab" output:True But failed in cases where p ="ab*a*c*a" and s ="aaa", output should be True why greedy string construction failed: the flaw was that a* is not a single choice, it can match "", "a", "aa", "aaa" etc. To determine ... Read more ›
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. Read more ›