Front-page articles summarized hourly.
MOSAIC argues that compute-optimal models are not cluster-optimal: optimizing for model FLOPs alone misses how a cluster delivers work. The authors integrate the systems stage into the scaling-law stage, pricing architectures by deliverable FLOPs, MFU, and goodput on a cluster. In MoEs, sparsity and the expert-split factor G reshape MFU and the feasible design space. With a fixed FLOP budget, predicted loss favors sparsity, but hardware constraints push deliverable FLOPs interior, flipping the optimum. Ranking by FLOPs misorders designs; the same run can win on loss-per-FLOP yet lose on efficiency. Architecture and systems co-design are required; cluster-aware pricing matters.
Explores an unresolved ambiguity in C89/C90 about implicit function declarations: calling an undeclared function implicitly declares extern int (), and the scope of this implicit declaration (innermost block vs file scope vs prototype scope) is not clearly defined in ANSI X.3-159-1989. This leads to GCC and Clang producing different results on edge cases such as int f(int [sizeof(f())]); and similar constructs, with one compiler accepting and the other rejecting. Since the rule was removed long ago, there is no canonical interpretation. The author urges moving away from C89.
Fil-C proposes a memory-safe ABI for C/C++, adding capabilities, runtime checks, and a concurrent garbage collector so Rust can interoperate via extern "fil-c". It aims to keep existing C code with safer semantics, trading some runtime costs for safety. The bridge would start narrowly (scalars, strings, opaque handles) with safe Rust wrappers and no escape hatches to ordinary C. Fil-C is source-compatible with C but not ABI-compatible, and cross-language interoperability is not the immediate goal. An ecosystem effort (filnix/Nix, Zig, Rust) is urged, with OceanSprint in Lanzarote as the collaboration kickoff.
SparrowMap is a volunteer, crowd-sourced live map that watches government vehicles. Volunteers run a detector on spare phones or PCs in-browser; video never leaves the device. Government vehicles’ photos and license plates are kept and become public records, while plates of other vehicles are destroyed locally. Only anonymous detections, not photos or plates, are sent to the server as a dot on the map. No accounts or apps required. It runs on old phones or laptops, with desktop setup scripts for Windows/Linux. Built in Michigan.
Bluesky launches Bluesky Protocol Services to organize infrastructure docs and contracts for Jetstream and Bluesky endpoints. Jetstream v2 adds Network Replay, enabling backfill history and point-in-time snapshots via planBackfill, listSegments, getSegment, and getBlock; archive requests require a token, live tail remains unauthenticated. v2 is live in west/east regions; v1 remains. New Jetstream SDKs (TypeScript and Go) and a Bluesky TypeScript SDK rebuilt on @atproto/lex. Updated endpoints.bsky.app docs cover the Jetstream surface. The infrastructure is self-hostable and open source.
DDR (Discovery of Designated Resolvers) lets a DNS resolver publish encrypted endpoints (hostname, port, protocol) for devices already talking to it. Devices ask _dns.resolver.arpa to see if encrypted endpoints exist; the resolver replies with available endpoints (DoH, DoT, DoQ) and a preference order. The device then connects to its chosen endpoint, so all further queries are encrypted. Windows 11 and Apple devices auto-ask on network join. Replies may be global or per-profile, depending on the resolver. If no endpoints are published, none are offered. Upgrading from plain DNS is susceptible to on-path tampering; device-config is stronger.
AI text watermarking hides a pattern in the writer’s word-choice process, not in the letters themselves. At each word fork, a secret key colors candidate words green or red, nudging the outcome while keeping meaning intact. A detector replays the key and counts greens; with the right key, green wins beyond chance. Editing erases the mark where word-runs survive—light edits dilute it, heavy rewrites erase it. Watermarks are private, probabilistic tests controlled by providers (not universal detectors), and detection depends on text length and the specific scheme.
Financial Times security verification page prompting users to enable JavaScript and cookies to proceed. Displays a 403 error (Reason: Security Verification, Request ID a2ab619eee87483d). Provides links to Terms & Conditions, Privacy Policy, Cookie Policy, Manage Cookies, and notes copyright and FT's self-regulation under its Editorial Code of Practice.
SunRanker is a free watchdog for home solar that checks daily production and emails you the moment something breaks. After a one-minute setup (via Enphase or SolarEdge), it reports in plain language what was produced and whether that’s normal, plus a short monthly review. It highlights outages where monitoring goes quiet or output drops below typical levels, catching issues in days rather than weeks. Built by a solar owner to avoid silent bills, it aims to provide simple, actionable alerts rather than engineer portals.
J.V. Noble explains building finite-state machines in Forth, deterministic and nondeterministic, using state tables to avoid slow nested IFs. Beginning with a number-input example, he shows progressively improved implementations: brute-force CASE-based FSMs, a table-driven indirect-threaded FSM that computes action addresses from a current state and input category, and a readable FSM where transitions are embedded in action words. He then advocates per-FSM state storage, using the return stack for stack effects, and presents nondeterministic FSMs (e.g., Fortran identifier rules and floating-point parsers) with HS/FORTH and ANSI-compatible variants.
Nine PBS in St. Louis sued Iron Mountain Data Centers on July 28 to recover more than 50 terabytes of archival material stored at Iron Mountain’s Denver facility after its cloud-storage vendor OSS cut off access earlier in the year. OSS, now defunct, had a relationship with Iron Mountain; Iron Mountain says OSS owned the housing infrastructure and won’t return the data. Nine PBS seeks emergency relief to prevent deletion and regain access to about 70 years of material, including coverage of East St. Louis, COVID-19, and the 1993 Great Flood. Iron Mountain hasn’t commented.
Cloudflare blocks access to medium.com, instructing users to enable cookies. The block may be triggered by certain inputs or data. To resolve, email the site owner with what you were doing and include the Cloudflare Ray ID shown on the page.
Smooth Move: Taming Trajectories with Polynomials explains how to plan smooth robot/3D-printer motion by shaping position trajectories with polynomials to minimize jerk and higher derivatives. It covers derivatives (velocity, acceleration, jerk), discontinuities between movement segments, and matching ends of segments with smooth transitions using sigmoid-like curves. The piece focuses on SmoothStep (and smootherstep) polynomials that ensure zero velocity and acceleration at endpoints, derives a 5th-degree trajectory under boundary conditions (x(0)=0, x(1)=1, zero first/second derivatives at ends), and shows how to solve for coefficients. It extends to multi-axis motion, speed constraints, and mentions jerk-limiting methods like Ruckig and G-code.
Pi manages growing conversation histories by compacting older content when the LLM's context window nears its limit or on demand (/compact). Compaction replaces older messages with a structured, compressed summary created by a dedicated 'context summarization' prompt. Pi keeps a configurable token budget (default about 20k tokens, ~5–20 turns) to decide what to retain. Compaction can occur after a turn or mid-turn on overflow. The summarized 'compaction entry' is appended to the session; prompt caching is broken by compaction, but new caching resumes afterward. Users can experiment with custom compaction via extensions.
Argues that NP-hard does not imply practical intractability. Worst-case exists, but real-world instances often are fast or solvable with heuristics and better algorithms. Examples: dependency resolution, type checking, scheduling, SAT/SMT; worst cases rarely occur in practice. Over decades, algorithmic speedups have outpaced hardware gains (cited ~450-billion-fold 1991–2015). Even hard problems like SAT/SMT are routinely solved at scale; when inputs are tough, we use timeouts and errors. No magic—no quantum computers needed.
OpenCode Senses is a local, privacy-first vision plugin for OpenCode that lets the text-only model inspect images with OCR, object detection, colors, and more. It auto-injects evidence (scene read, caption, exact OCR) when an image is attached and exposes 13 senses_* tools for deeper analysis. It runs fully offline on GPU using Moondream 2 by default (6 GB VRAM) or Moondream 3.1; no API keys. Install via npm; first run downloads ~3.9 GB weights and caches locally. Free forever.
Idol Mahjong Final Romance (1991) by Video System is a strip-mahjong dating game: date eight women and win three riichi rounds to strip the girl. Play in a fixed order with an item shop between stages and an optional redraw after the initial hand. Visuals use rotoscoped photos and low-frame-rate animation; the AI can call chii/pon. Hardware includes two Z80 CPUs, YM2413, MSM5205, and a V-System GGA with two 8x4 tilemaps, creating a slideshow feel. The sequel added arcade linking; the Neo Geo CD port adopts anime art; 2-R-4 Special re-releases the three games, the first remaining in arcades.
Geoffrey Litt argues that as AI agents write more code, humans must understand it to participate creatively, not just verify. He outlines three education-inspired techniques: Explanations (literate diffs with quizzes to test understanding); Micro-worlds (interactive sandboxes and step-through debuggers); and Shared spaces (collaborative work environments for a shared mental model). Notion’s collaboration features help run agents and discuss plans. The aim is to augment humans, not automate them, aligning with Alan Kay’s vision that understanding enables deeper participation and better outcomes.
Made by Johno Whitaker using FastHTML