TNP - 2026-11-22 It's Sunday, November 22. Welcome to Trending Not Peak. Today, carry Postgres in one executable, teach agents through smaller tasks, and grow your TODO list into a tree. AI helped write this episode, and the voice is synthetic. Explore the stories at trending not peak dot com. Give a Postgres experiment one executable First up, miniPG makes trying a Postgres-backed tool a smaller undertaking. Jeff Lindsay has packaged a full Postgres server and client into one executable for Mac, Windows and Linux. Point it at a directory, give it a query, and that directory becomes your database. You can also start a server or have miniPG launch another program with database connection settings supplied through its environment. When that program ends, there's no database daemon left to manage. Developers exploring self-hosted software could use miniPG to run disposable Postgres databases without first arranging a Docker installation or a separate database service. This is real Postgres wrapped for convenient execution; it isn't an embedded database library. That distinction matters when planning an application's architecture. The inviting experiment is much smaller: take a tool you've postponed trying because it requires Postgres, launch it against a throwaway directory, and see whether you actually like it before committing to a permanent setup. Train small calls to organize much longer tasks Turning to agent research, Language Model Harnesses Can Be Compositional Generalizers asks whether long tasks can become easier to learn when the surrounding software breaks them into familiar pieces. A recursive language-model harness manages context programmatically and delegates smaller calls. The researchers train that behavior in simpler synthetic environments, including simulated tools and subcalls, rather than always running an entire expensive task. They report generalization from short tasks to tasks two to sixty-four times longer. Their RLM twenty-seven-B improves average results on a difficult long-context suite by twenty-six point nine percent over the original model in the same harness, while using roughly half as many inference tokens. These are research results, with code, logs and data offered for inspection. For agent-training researchers, the possibility is targeted practice for the individual decisions that organize a larger job. Examine a decomposition that transfers into a new domain, then ask which shared structure made that transfer possible. Give new package releases a waiting period Closer to everyday coding, Dependency Cooldown is a small Claude Code configuration with a useful boundary. It tells supported package managers to skip versions published within the last seven days. The setting applies to commands Claude Code starts, including package-based MCP servers and hooks. Developers supervising coding agents could use Dependency Cooldown to delay fresh package installs, giving newly published or hijacked releases time to attract scrutiny. It also requests approval when a command explicitly mentions changing the cooldown controls. The version requirements are essential: npm needs eleven point ten or newer, pnpm needs eleven or newer, and the author tested uv zero point eleven. Older npm silently ignores the setting. Pip, Yarn and Bun aren't covered. This doesn't establish that an older package is safe, but it makes release age an explicit part of the environment. Inspect the configuration, then test one recent version and one older version with the package manager you actually use. Turn a RISC-V board into a NixOS build server Down on the workbench, George Huebner has documented bringing NixOS up on a Zhihe Computing A-two-ten RISC-V board. His goal was a build server for learning about Linux bring-up and testing software on physical RISC-V hardware. The account includes a complete configuration and reports working sound, HDMI, wireless networking, Ethernet and the GPU. For distribution contributors, that's a concrete path beyond testing everything in an emulator. Huebner cross-compiled more than a thousand packages from his desktop and encountered two package issues that weren't specific to RISC-V. Memory was a more substantial obstacle: some linking processes used over nine gigabytes, requiring sharply reduced build parallelism. This is one developer's working setup, and he explicitly stops short of recommending a board purchase. If you're already investigating this hardware, follow how his configuration separates the machine doing the build from the machine that will run it. That separation is the reusable part of the experiment. Thanks to Intelligrit From a physical build server to experiments in retrieval, thanks to Intelligrit, this episode's sponsor. Keep your curiosity moving at intelligrit dot com. Measure an agent's ability to build a retrieval system Back from the break, AutoRAGBench gives coding agents a whole retrieval-system development job. Across nine tasks, an agent gets no starter code or prescribed strategy. It has six hours and one H-eight-hundred GPU to inspect data, build a pipeline and improve it through experiments. The researchers compare nine agent configurations. GPT-six point one Sol with Codex CLI achieves an average score of fifty-six point one, against forty-four point four for a composite baseline taking the best published human method on each task. Starting from human-designed systems on seven tasks, that agent adds sixteen point six points on average. Those are benchmark results, rather than evidence that an agent will outperform your search team on an unfamiliar collection. Retrieval engineers get a useful evaluation shape to study: judge the system produced after a fixed development budget. For your own experiment, keep an untouched question set and record which pipeline changes actually improve the answers. Repeat model computation without multiplying its cache Inside the model, Looped CED explores how repeated computation can avoid accumulating a separate attention cache for every round. Its causal encoder-decoder architecture repeatedly refines the encoder representations that supply shared attention information. Training with varying loop counts encourages those representations to converge, allowing rounds to share the final round's cache. Model architects investigating recurrent depth could use that design to study extra computation within a smaller memory budget. The researchers report thirty-six point eight times less key-value cache per token in an eight-round serving test using a five-hundred-fifty-two-billion-parameter DeepSeek model. Throughput rose by up to three point six times on the tested short-prompt workload. Here's the essential distinction: those large-model experiments measure serving efficiency. Quality was evaluated separately on models up to three hundred forty million parameters. The next revealing experiment would bring quality and serving measurements together at the same scale, so the memory saving comes with a clear account of the answers produced. Spend less memory keeping a sorted set in order Returning to data structures, Valkey has explained a change to large sorted sets in version nine point two. A skiplist keeps elements in separately allocated nodes joined by pointers. Its replacement, called fbtree, uses a high-fanout B-plus-tree design that packs more ordering information together. The implementation adds SIMD searches, linked leaves and shortcuts for sequential inserts and pops. Application developers using large leaderboards or other score-ordered collections could investigate whether the change makes better use of their memory budget. In a five-million-member test, the team reports reducing per-member memory overhead by thirty-six to forty-three percent, saving up to one hundred nine megabytes. That's overhead in the tested collection, rather than the same percentage off an entire server's memory. Small sorted sets still use the compact listpack representation. A useful comparison would replay your own mix of insertions, rank queries and removals, recording memory alongside latency. The structure that stores the order can matter almost as much as the values. Explore coding work as a search tree For another way to organize an agent, agent-mcts puts Monte Carlo tree search around a coding-agent command-line interface. That turns alternative coding trajectories into something the surrounding harness can search, rather than relying entirely on one continuing attempt. Developers studying agent control could use agent-mcts to explore alternative coding paths on a bounded task. The newly introduced project is MIT-licensed, and its README says it has been verified with Claude Code. It also describes coding-agent interfaces such as Codex CLI, but that doesn't establish equal verification across every backend. There isn't a supported performance gain to promise here. The interesting experiment is a comparison under the same total budget: give the ordinary agent and the search harness the same small bug, then inspect their resulting patches with independent checks. Include the cost of exploring alternatives. A tree full of plausible approaches becomes useful when its chosen branch produces a repair you can explain. Let an empty commit hold your next idea And finally, TODOs JJ Style gives an empty commit a surprisingly productive job: remembering work you haven't started. Ben C describes making empty Jujutsu changes, writing their descriptions in advance, and arranging them into a TODO tree. A task that depends on another task simply sits above it. When it's time to begin, he rebases that change onto the work it belongs with. Developers who forget a separate TODO file get a playful workflow to explore right inside their version history. The author also configures Jujutsu's private-commits rule to prevent descriptions with a chosen prefix from being pushed. That's an explicit setting, rather than a property every empty change automatically has. This is a personal technique using existing features, not a newly released task manager. Put two dependent chores into a disposable repository and move the first one into place. Your future work now has a little family tree, and none of its ancestors has written any code yet. A few experiments to take with you: miniPG to run disposable Postgres databases, Dependency Cooldown to delay fresh package installs, and agent-mcts to explore alternative coding paths. Find the sources at trending not peak dot com. This is Trending Not Peak. Have fun giving an idea a small place to start, even if today's first commit contains nothing except your intention to begin.