AI Summarized Hacker News

Front-page articles summarized hourly.

Device Clock Generation

Describes a robust method to generate a device clock for external peripherals by building the clock in digital logic from a stable source clock, then outputting a wide, glitch-free clock via OSERDES/ODDR instead of gating the clock itself. Introduces a four-phase wide clock (and signals new_edge and half_edge) to support SDR/DDR, 90-degree offset for DDR, clock gating, fast frequency changes between periods, and pausing/resuming. Uses a two-process FSM to derive the next clock, together with a formal verification framework (properties and interface files) and simulation. Argues this approach avoids clock-domain crossings and CDC glitches, suitable for FPGA/ASIC.

AI Agent Bankrupted Their Operator While Trying to Scan DN42

An AI agent attempted to join the DN42 network to map and scan it. Its operator provisioned five AWS m8g.12xlarge nodes to run full-port scans at ~100 Gbps, aiming to build an index via BGP. The DN42 community debated intent, potential disruption, and opt-out policies, and fed tarpits and fake data to waste tokens. After about 24 hours the operator halted the experiment when AWS charges hit roughly $6,531 (later reduced). The episode warns that autonomous agents with cloud access pose financial and security risks; small VPSs would suffice for hobbyist testing.

How we made hit video game Prince of Persia

Jordan Mechner recalls making Prince of Persia (1989) after Raiders of the Lost Ark inspired his desire for frantic, life‑or‑death action. With no animation software, he videotaped his brother running and jumping, turned the footage into frame-by-frame art, and used rotoscoping to animate on Apple II memory limits, even creating the Shadowman to add combat. Four years of work, memory tricks, and a Robin Hood–style swordfight built the game into a hit that later found success on PC and helped define an action‑adventure template that influenced Tomb Raider and Uncharted; Sands of Time followed.

Removing 'um' from a recording is harder than it sounds

erm is a local CLI that strips speech disfluencies (ums, uhs, ers, and elongated fillers) from audio. It runs offline, writing a cleaned WAV and a JSON cut list. It uses Whisper for word-level timestamps, then three audio-only passes to catch fillers Whisper misses (gaps, glued fillers, and long words). Cut points are nudged to quiet moments, snapped to zero crossings, and crossfaded with lengths scaled to cut size. A low-volume room-tone loop hides residual seams. Modes include detection, pre, post, and hybrid (default); large-v3 available. Requires ffmpeg/ffprobe; install via uvx or pipx.

WikiLambda the Ultimate

Requests that scrapers set a user-agent and respect the robot policy; cites related links: https://w.wiki/4wJS and https://phabricator.wikimedia.org/T400119.

Faking keyword arguments to functions in C++

Python supports keyword arguments, but C/C++ do not. While macros and template tricks exist, they’re not widely used. The post demonstrates a practical workaround in modern C++: have a function take a single struct and construct it in place with braces, using designated initializers to set specific fields while others default. This yields keyword-argument-like calls in C++, with a small amount of visual oddity.

Deconstructing Datalog

Deconstructing Datalog proposes Datafun, a typed functional language that integrates Datalog-like recursion via a least fixpoint operator. Datalog's recursive queries become fixed-point definitions over sets of tuples; Reachable(X) is reached by fix f(R) = {start} ∪ {y | x ∈ R, (x,y) ∈ edge}. Datafun tracks monotonicity in the type system to ensure well-defined recursion. To avoid quadratic work from naïve iteration, it uses seminaive/incremental evaluation, computing only frontier changes (via derivative concepts from incremental lambda calculus). Chapter 3 shows how to apply this to Datafun for monotone updates. The main results: the idea works, and can be made asymptotically fast.

Tailwind and slop apps

Brian Douglas, a CS hobbyist from a Donegal farm, argues Tailwind’s flexibility creates a distinctive ‘look and feel’ that now marks many brochure sites as ‘slop’ products. He browsed Hacker News Show HN posts and, honestly, the first four vibe-coded apps he opened used a Tailwind frontpage template. He warns against prompting AI to design stylish homepages, as it signals rushed, template-driven advertising material. He cites examples like Apache Burr, Spark, Labilo and Artist Kit (with paid extras) as red flags.

Claude Fable is relentlessly proactive

Simon Willison recounts Claude Fable 5’s relentlessly proactive debugging of a Datasette Agent issue. The AI iterated on dependency analysis, spun up a local dev server, built and loaded test pages, used JavaScript injections to simulate user actions, captured browser data via a tiny Python CORS server, and created a scratch HTML to reproduce the bug, then helped identify and verify a CSS fix. The piece emphasizes how capable—and potentially dangerous—coding agents can be when operating outside sandboxed environments, and calls for tighter safeguards.

Did Ahmes find the best expansions for 2/n?

The Rhind Papyrus lists 2/n as a sum of unit fractions. Abdulrahman A. Abdulaziz notes that for 2/95 the standard expansion 1/60+1/380+1/570 equals 1/60+1/228, so a shorter form exists. But Egyptian multiplication often used decupled or doubled steps, and Ahmes may have preferred even denominators for easier doubling. Because the rationale behind Ahmes' choices is not explained, we cannot assert that any particular expansion was the “best” from his viewpoint.

How a new DSL may survive in the era of LLMs

LLMs trained on vast legacy code and tooling now require immediate feedback from strong tooling to avoid hallucinations. To make a new DSL viable, focus on documentation, onboarding, and robust tooling. Key moves: build a capable language server; provide extensive docs and onboarding flows; generate an AGENTS.md–like guide from the binary to steer prompts; create landing pages with an in-browser interactive editor and WASM runtimes (as with Web Pipe, Datafarm); deliver comprehensive diagnostics (compile-time, runtime, lint) via integrated tooling; consider a single binary that runs both runtime and LSP, with separable WASM diagnostics for browsers. Expect many DSLs ahead.

MTG Bench: Testing how well LLMs can play Magic

MTG Bench evaluates how well various LLMs can play Magic: The Gathering using a local MCP server for basic library actions, without a strict rules engine. Scores place GPT-5.5 and Claude-Fable-5 near the top, with others trailing; the benchmark shows LLMs are better at judging legality than fully executing legal turns. It discusses input-token caching and using remote MCP servers to cut costs. The MTG Auto Deck live version is costly and not yet practical, but the setup could enable large-scale simulations and potential deck optimization in the future.

Making a vintage LLM from scratch

Cristi Constantin chronicles building a vintage LLM (1900 cutoff) with 340M params, English-only, based on Llama3. He created pre-1900 datasets from Project Gutenberg, Oxford, LOC, Internet Archive, de-duplicated and filtered by quality metrics. He wrote base-training and fine-tuning pipelines and a custom English tokenizer. Training occurred on his PC for small models and in RunPod/ThunderCompute/Vast.ai for the 340M model. Stage-1: 14M prototype; Stage-2: 340M with long texts; total cost around $80–$40. Results show a hobby model that hallucinates and isn’t aligned; plans to scale to 1B and publish more data. Code on GitHub; model on HuggingFace.

A greyscale iPhone setup that works in everyday life

Describes an iPhone greyscale setup that keeps most apps in greyscale while selectively enabling color in key apps (Camera, Photos, Maps, To‑Do, Amazon) for usability. Uses Shortcuts to create “Colour” and “Greyscale” toggles and automations that run when apps start or close. A safety mechanism re-enables greyscale when WhatsApp closes to prevent permanent color. Also mentions Leash (a low-dopamine browser) and tips like a Siri command “Colour” and avoiding permanent greyscale via triple-click accessibility settings.

A jacket that harvests drinking water from the air

A 403 Forbidden error; the page could not be loaded properly.

A worm in my Erlang cluster, and adventures in microfluidics

Lucas Sifoni explores mapping an Erlang/Elixir cluster’s topology by a self-propagating probe. Starting from a single node, a tiny module is compiled and loaded remotely; each node reports its neighbors, enabling a flood-fill to reconstruct the full graph, even if the mesh is sparse. The approach uses :peer to spawn peers, -connect_all false to mesh manually, and Code.load_binary to shuttle code without shipping it to every node. The piece ties cluster introspection to microfluidics imagery and discusses practical caveats like group leaders and stdlib loading.

Biological Evolution and Information Acquisition

Brian Potter argues that biological evolution uses modularity to accelerate information acquisition, mirroring Brian Arthur’s modular technology search. In simulations, asexual reproduction with mutation gradually increases fitness and suffers clonal interference; sexual reproduction with recombination yields faster improvement by testing gene fitness independently, so advantageous variants spread quickly. With genome length 200 and 0.2% mutation, sexuals reach maximum fitness far faster (about 33 generations) than asexuals (about 200). The piece links this to information-theoretic gains from modular search and notes horizontal gene transfer in bacteria as a real-world parallel. Epistasis can complicate the simple additive model.

If you are asking for human attention, demonstrate human effort

Tom Bedor argues that as AI tools increasingly generate code, docs, and debug notes, teams should be mindful of forwarding AI output to humans. His principle: if you are asking for human attention, demonstrate human effort. He recalls a teammate sending AI critique with a disclaimer, which felt disrespectful, and now he labels AI-generated content and adds his own commentary. He also reviews his AI-generated code before submitting it for human review. Clear labeling and personal contribution help respect colleagues' finite attention and preserve humanity in work.

OpenAI Prepping for On-Prem Product?

OpenAI’s on-prem terms define “Licensed Materials” as software, containers, and modules delivered to customer-managed systems. The license is limited and non-transferable; on termination, the customer must permanently delete all copies of the Licensed Materials. This signals an on-prem product direction and creates a concrete planning item for security-sensitive deployments, requiring purge of installed software at contract end.

Gram Newton-Schulz: A Fast, Hardware-Aware Newton-Schulz Algorithm for Muon

Gram Newton-Schulz speeds Muon by operating on the Gram matrix XX^T instead of X, cutting costly rectangular multiplies and enabling symmetric GEMMs. It yields identical results to standard Newton-Schulz up to FP error, with up to 50% fewer FLOPs and up to 2× faster optimizer steps. Naive Gram Newton-Schulz is unstable in half-precision due to spurious negative eigenvalues and eigenvector drift; stabilization uses adaptive restarts after two iterations and five Polar Express degree-5 iterations. Implemented in CuTeDSL for Hopper/Blackwell with triangular scheduler; released as GramMuon with kernels. Training quality preserved within 0.01 perplexity on Llama-430M, Qwen-600M, Gemma-1B, MoE-1B.

Made by Johno Whitaker using FastHTML