AI Summarized Hacker News

Front-page articles summarized hourly.

Redeploying Fable 5

Anthropic says export controls on Claude Fable 5 and Mythos 5 were lifted on June 30. Fable 5 goes live globally July 1 across Claude Platform services; Pro/Max/Team and select Enterprise plans include 1 Fable 5 up to 50% of weekly usage through July 7, then use credits. Access on AWS, Google Cloud, and Microsoft Foundry will be re-enabled soon. Mythos 5 is restored for certain US organizations after June 26 approval, with broader Glasswing access planned. The post details safeguards, a 99% effective new safety classifier, a proposed industry jailbreak framework, deeper government collaboration, and a HackerOne program.

Segmenting Robot Video into Actionable Subtasks

Macrodata Labs introduces WGO-Bench (What’s Going On Bench), a benchmark for robotics subtask annotation, built from 100 episodes (HomER, DROID, Galaxea) with 743 atomic subtasks across 62 high-level instructions. Across 60+ experiments, they find Gemini 3.5 Flash best for segmentation (0.306 F1) and labeling at 61.0% accuracy; end-to-end F1 0.168. A timestamped contact-sheet pipeline costs about $2.64/hour, ~19x cheaper than human annotation, and is open-source in Refiner with ready-to-use examples.

The first early human eggs from stem cells

Conception announces generating the first early human egg cells (primary oocytes) derived from stem cells, created from a donor blood sample that is reprogrammed to iPSCs and guided into mini-ovaries containing developing eggs. The mini-ovaries show organization similar to natural ovaries, evidence of meiosis machinery forming, and activation of early egg-cell genes. The team reports producing fully iPSC-derived follicles, a claimed world first, and describes a stepwise IVG approach benchmarked against a human ovary atlas. Next steps include maturing follicles to the antral stage and validating safety; they invite collaboration.

Firms that adopt AI grow headcount 10% over the two years following adoption

Could not summarize article.

Americans see their country's past, present and future

Could not summarize article.

Structural Correctness

Structural Correctness argues for modeling a domain as a graph of typed nodes and edges, where each edge encodes a capability (deps, srcs, data). Such definitional graphs make the system and its validity coexpressive, enabling verification by construction. While databases define schema and checks, they don’t specify valid state transitions. Colored Petri Nets extend this by making state changes explicit via tokens and transitions, unifying state, behavior and verification. The web scraper example shows atomic transitions (lease a proxy, increment domain activity) and topological invariants. The article frames this unification as a path to more robust systems.

Supersonic flight returning to US after half-century ban

US moves to overturn the 50-year ban on overland supersonic flight by replacing it with a noise-based standard. The FAA published a notice allowing Mach-1-plus speeds over land if sonic booms stay below a set limit, with final rules expected by mid-2027 after a 2025 executive order to repeal the prohibition. The ban stemmed from public harm caused by sonic booms. Companies like Boom Supersonic (Overture) and Spike Aerospace are developing quieter jets; Boom has orders from United, American, and Japan Airlines for 60–80-seat aircraft.

Scaling Laws, Carefully

Scaling laws describe predictable power-law relations between generalization loss, model size N, data size D, and compute C in pretraining language models. Kaplan et al. show L scales with N, D, and C; under a fixed compute budget, the compute-efficient rule was N_opt ∝ C^0.73, suggesting bigger models with little data. Chinchilla (Hoffmann et al. 2022) argues for N_opt ∝ D ∝ C^0.5, i.e., train on more data with a smaller model. Later work adds data repetition and overfitting penalties and shows fitting is sensitive to regime and method.

From Julia to Rust: a differentiable tensor stack for scientific computing

tenferro-rs is a Rust-native dense tensor stack for scientific computing, offering typed tensors with eager autodiff and PyTorch-style gradients, JAX-style traced graphs, einsum, FFT, and explicit CPU/CUDA backends, built on faer and CubeCL. It fills a missing Rust layer between array/linear-algebra libraries, featuring column-major storage, dynamic shapes, and modular operation crates with autodiff rules outside tensor types. It supports both eager and traced workflows, OpenXLA-backed execution, and correctness checks via tensor-ad-oracles and benchmarks. Crates are on crates.io; used under tensor4all-rs; feedback invited.

Forestiere Underground Gardens

Requests setting a user-agent and respecting the robots policy, with references to https://w.wiki/4wJS and https://phabricator.wikimedia.org/T400119.

The President Made More Than $1Billon in Crypto Deals

The page is a Wall Street Journal 404 error indicating the requested page cannot be found. It highlights popular articles and latest podcasts, including topics on the Supreme Court and birthright citizenship, student-loan debt delaying retirement, a family watching over a 52-year pot of soup, and Nasdaq/S&P gains.

Anthropic restoring access to Claude Fable 5 and Mythos 5 from tomorrow

Two 403 Forbidden responses from OpenResty indicate the requested resource is blocked; access is denied due to server rules, authentication issues, or IP/permission restrictions.

Deriving SVD without even aiming at it

This post rebuilds SVD from first principles: for any A, A^T A is symmetric, so its eigenvectors v_i form an orthonormal input basis; set u_i = A v_i / σ_i, with σ_i = ||A v_i|| and A^T A v_i = σ_i^2 v_i. Then A = U_r Σ_r V_r^T with U_r = [u_i], V_r = [v_i], Σ_r = diag(σ_i). The kernel directions map to zero, leaving r orthonormal input/output directions; A acts as a simple stretch along these directions. Equivalently A = ∑ σ_i u_i v_i^T; rank-k truncation gives best rank-k approximation (Eckart-Young). Links to compression and PCA.

Google copybara: moving code between repositories

Copybara is an open-source Google tool for transforming and moving code between repositories, enabling syncing between confidential and public repos while designating one authoritative source of truth. It operates statelessly by recording state in the destination commit messages and primarily supports Git (Mercurial support experimental). It features an extensible workflow and can move or import changes across repos, with example configurations and integration with Bazel, Docker, and Maven. The project provides instructions to install, build from source, or use weekly releases, plus documentation and tutorials.

Department of Commerce has lifted export controls on Claude Fable 5 and Mythos 5

Anthropic announced that the Department of Commerce has lifted export controls on Claude Fable 5 and Mythos 5. Access will be restored starting tomorrow, with updates to follow. They thank users and collaborators for their patience and help redeploying the models.

Loko Scheme 0.13.0

Loko Scheme 0.13.0 released: bug fixes, performance improvements, and new features. Downloads include tarballs and a bootable 64-bit disk image; signatures signed with GPG key 0xDD839B748F10AD4D. See NEWS.md for details. Loko Scheme is an optimizing compiler that builds statically linked binaries for bare metal, Linux, and NetBSD/amd64, supporting R6RS and R7RS. Website: scheme.fail; license: EUPL v1.2 or later; mailing list available.

Hengefinder

Could not summarize article.

Ante: A new way to blend borrow checking and reference counting

Ante is a work-in-progress language that aims to blend borrow checking and reference counting without runtime crashes. It introduces shape-stability, allowing multiple mutable borrows to the same struct safely, and a shared RC model that lets you mutate fields of reference‑counted data without locking. It also uses uniq conversions to safely mutate within unions, avoiding the pitfalls of Rust’s Rc/RefCell and Swift’s exclusivity checks. The design promises a simpler, memory‑safe systems language, with ongoing experiments, comparisons to Rust’s Cells, and future compiler analyses to improve ergonomics.

TabFM: A zero-shot foundation model for tabular data

TabFM is a zero-shot foundation model for tabular data reframing prediction as in-context learning, enabling classification and regression without model training, tuning, or feature engineering. It uses a hybrid architecture inspired by TabPFN and TabICL with alternating row/column attention, row compression, and a compressed-embedding Transformer for efficient ICL. Trained on millions of synthetic tabular datasets generated from structural causal models due to scarcity of real data, TabFM generalizes to unseen tables. Evaluations on TabArena show strong performance; TabFM-Ensemble improves results. It’s integrated with Google BigQuery via AI.PREDICT and available on Hugging Face and GitHub.

Leanstral 1.5

Leanstral 1.5 is an updated Lean 4 formal proof engineering model optimized for automated theorem proving and autoformalization, with 119B total parameters and 6.5B active. It offers extensive capabilities including chat completions, function calling, agents and conversations, built-in tools, structured and predicted outputs, OCR, Document Q&A, embeddings, moderations, transcriptions and TTS, timestamps, and batching. The model is available at no cost ($0) and sits among other Mistral models (Small 4, Medium 3.5) with docs, API access, and community resources.

Made by Johno Whitaker using FastHTML