Front-page articles summarized hourly.
Arguing against the dominant forward, existential view of programming abstractions, the author says hiding realisation details (memory layouts, ABIs) makes software brittle and fosters monoculture. By contrast, a universal, backward approach uses metadata-driven tools that can recover abstract views from many concretes: debuggers, DWARF, and, via LTO, delayed lowering. IP’s hourglass exemplifies openness over uniformity. The post cites CPython’s interface with arbitrary native code and the Cake language as steps toward universality—and contends social factors, not raw hardware, now limit performance, so embrace backward, universal tooling.
pgtestdb leverages Postgres template databases for fast test cloning; per-test setup runs ~98–99 ms, similar to migrating a schema. However, River's reuse-enabled schema pooling yields much faster overall test times (≈14.5 s vs ≈51.1 s for pgtestdb), and with reuse the target is 10–20 ms per test. Reuse requires version-aware schemas and leaves state on failure for debugging. The author suggests considering pgtestdb for end-to-end tests and potentially adding reuse as an augmentation.
claude-account is a Linux-only profile switcher for Claude Code that uses isolated CLAUDE_CONFIG_DIRs per account and transparently forwards commands to the official Claude executable. It allows adding accounts (work, personal, company, api-billing, etc.), switching active profiles, listing, showing the current profile, and removing accounts (with an optional --purge). Switching affects new Claude processes; existing sessions stay. State is stored in ~/.config/claude-account/state.json; non-account commands pass through to Claude. Requires Linux, Claude Code, and Rust 1.85+. Install from release or build from source.
Could not summarize article.
Physicists long puzzled by the muon g-2 wobble; 2021 lattice QCD calculations, using a data-driven approach from electron-positron collisions to model the strong force, aligned with Fermilab’s precise measurement, suggesting no new particles are needed. But the older, data-driven predictions—partly based on past experiments—still clash with the newer results. Siberia’s VEPP-2000 collider's 2023 high-precision pion measurements differ from earlier data; BMW lattice and other detectors now largely agree with the new rate, while BABAR's 2023 analysis matches the old rate. The discrepancy raises questions about experimental systematics or possible new physics, and researchers continue investigations.
Could not summarize article.
An upper stage of SpaceX's Falcon 9 (2025-010D) is predicted to hit the Moon on 2026-08-05 around 06:34 UTC, near 19.455 N, 93.594 W (Einstein crater) close to the limb. The ~4900 kg stage has been tracked since 2025 by surveys and amateurs; impact speed ~2.43 km/s, energy ~14.5e9 J, likely making a ~17 m crater with ~1100 tonnes of ejecta. Visibility of the flash or ejecta is uncertain, though LRO may image the crater. The piece also discusses space junk, disposal methods, and monitoring.
Celly is a native C# CEL engine for .NET that is pure managed and passes 100% of the CEL conformance suite (2,456 tests). It enables protovalidate for .NET, compiles a CelProgram once and evaluates it many times with thread safety, and uses rope-based lists to speed up comprehensions—faster than cel-go on complex expressions. It ships NuGet packages Celly, Celly.Protobuf, and Celly.Protovalidate; docs at bsid.io/celly.
Git worktrees share the parent repo’s .git (refs, config, stash, hooks) and are not a true isolation boundary for coding agents. In a linked worktree, most state remains common; only HEAD, index, and a small per-worktree set are isolated. Hooks can run in the main repo, authorship can leak, and stashes can migrate across trees. Real isolation requires a separate clone; measurements show a local clone checkout costs roughly as much as a worktree addition. Use worktrees for single writers or quick branch testing; use clones for truly isolated parallel agents.
Thoughtworks technologist Giles Edwards-Alexander reports an experiment in agentic software engineering: refactoring a 17k-line Rust data access layer in a ~150k-line AI-powered app (written by agents) to cut token costs. By iteratively refactoring into smaller, more modular files, token input for a representative change dropped from 159,564 to 27,360 tokens (83% savings). The larger codebase remained constant, but future changes cost fewer tokens. The experiment, conducted with Claude and Python scripts over ~8 hours on slow WiFi, highlights potential time/cost savings from refactoring and notes limits of current AI refactoring tooling. Includes appendices with prompts and methodology.
DuckDB paging Parquet files is faster with file_row_number than LIMIT/OFFSET: 2.53× on a 20M-row file with 163 row groups. OFFSET can miss/duplicate rows and may degrade as pages deepen due to rewrites. Row-range reading skips non-needed blocks, but only helps if there are many row groups; a single large row group negates the benefit. Best practice: use file_row_number with boundaries from parquet_metadata(), avoid high-million-row pages, and consider streaming or pre-signed access for stateless APIs.
SDL_gp is a single-header, high-performance 2D graphics painter for SDL3, ported from sokol_gp. Unlike sokol_gp, SDL_gpu does not manage resources, so SDL_gp provides a simple resource-management layer. The README shows a minimal example: acquire a GPU command buffer, begin, clear to black, draw a red filled rect, flush to a swapchain texture, end, and submit. It exposes APIs for error handling, images, shaders, pipelines, and the painter pipeline (setup, draw, transform, color, viewport, scissor, etc.). MIT-licensed; 50 commits, ~30 stars.
Google DeepMind introduces Gemini Robotics 2, a whole-body intelligence layer for robots. It enables humanoids and other embodiments to walk, manipulate objects, and collaborate with other robots using three models: Gemini Robotics 2 (vision-language-action for full-body control), Gemini Robotics ER 2 (embodied reasoning for multi-step planning), and Gemini Robotics On-Device 2 (efficient, on-device VLA that adapts to new bodies within hours). It supports on-device adaptation, multi-robot teamwork, and safety benchmarks (ASIMOV-Agentic). Demonstrations include Apptronik Apollo 2 and Franka Duo; ER 2 is in Google AI Studio, On-Device 2 to partners. A step toward general-purpose physical AI.
NTFS forensic artefacts are three-layered: the MFT, the USN Journal, and the $LogFile. Each file stores different activity: MFT has two timestamp sets ($STANDARD_INFORMATION and $FILE_NAME); $FN is kernel-written and harder to tamper with, while $SI can be timestomped. USN Journal records changes even after deletions; $LogFile logs the redo/undo of metadata writes and ties to MFT via LSN. Use MFTECmd for CSVs and dfir_ntfs for programmatic access; cross-correlate MFT, USN, and LogFile for robust timelines. If metadata is destroyed, carve files; otherwise use VSS snapshots to recover prior states.
Agentic computer use is far from solved: long-horizon task benchmarks top out around 20%, far below human performance, with earlier AI demos inflated by simplified interfaces. A core flaw is that agents often bypass the GUI, using API calls or scripting instead of interacting with the UI, reducing reliability and relevance. Steelman Labs proposes a steelman: separate planning from execution, add a System 1 motor-control manipulator, and treat the screen as a dynamic environment with a vision-first approach to enable real-time interaction with any interface, as demonstrated in a live UI demo.
John Gordon’s after-dinner talk turns coding theory into a comic mini-course using Alice and Bob as celeb-clients. He sketches three faces of information: source coding (data compression), channel coding (error protection with a phonetic alphabet), and secrecy coding (cryptography and its jokes). He jokes about standardization vs non-standardization, weak keys, and processing delay, with references to DES, PKC, RSA, and Caesar’s cipher. The talk ends with a playful tour of modern tech—pocket calculators, multiprocessors, and a misbehaving computer—embracing how information tech reshapes daily life.
CosmosEscape exposed a flaw in Azure Cosmos DB's Gremlin API that could grant a platform-wide Cosmos Master Key, enabling Takeover (full read/write access to any account) and Enumeration (listing databases by tenant/subscription). By bypassing the Gremlin sandbox via .NET reflection, attackers could reach the DB Gateway and the Config Store, enabling cross-tenant data access, including Microsoft internal databases. Wiz responsibly disclosed; Microsoft remediated, eliminated the Master Key, added guardrails, and rolled out long-term hardening across regions by July 2026. No customer action needed.
Hacker Public Radio is a technology-focused podcast releasing new weekday episodes (Mon–Fri), produced by listeners and covering topics for hackers, hobbyists, and makers. It fosters a welcoming community with positive feedback and respectful debate. Submissions are encouraged: one show per listener per year; unfilled slots come from a Reserve Pool; the project will stop if there aren’t enough shows. Latest episodes span beer, amateur radio, DIY audio, programming, games, and more. Content is released under CC BY-SA 4.0.
Made by Johno Whitaker using FastHTML