AI Summarized Hacker News

Front-page articles summarized hourly.

How Long Does It Take for a QQuickItem to Become Visible?

KDAB explains how long a QQuickItem takes to become visible and how to measure perceived frame delays in Qt Quick. The solution is to subclass QQuickItem (TimedItem) and time from when visibleChanged signals true to the frame that actually displays the item. It uses ensurePolished, an override of updatePolish, and a connection to QQuickWindow::afterFrameEnd to capture the display time on the correct frame. Measured time divided by the frame period T = 1000/refreshRate (e.g., 16 ms at 60 Hz) and floored yields the number of frames dropped. Includes sample code.

HN Comments

Show HN: Kyushu – A self-hostable WASM sandbox for JavaScript workers

Kyushu is an open-source CLI that lets you write a JavaScript/TypeScript handler, compile it into a standalone WebAssembly binary, and run it anywhere with a single command (kyu). No Node, Bun, or Docker required. It provides a Cloudflare Workers-style fetch handler API and runs in a self-hosted WebAssembly sandbox isolated from the host, suitable for a VPS or any environment. Documentation and GitHub available; built by David.

HN Comments

Yon – a topos-oriented language with a content-addressed lattice heap

Yon is a topos-oriented language where a program’s world is a category, a place an object, and a value an immutable section identified by content. It uses a content-addressed heap (Leech lattice Λ24, 196,560 slots) so identical content shares a slot; equality is a single O(1) comparison. Strings are interned on the heap. Yon eliminates garbage collection, threads, and exceptions; concurrency is via processes and failures are values. Behavior is defined by arrows; identity is explicit; no typeclasses. Execution rests on Yoneda relations; future work includes OCaml/MLIR/C backends.

HN Comments

LLMs are eroding my software engineering career and I don't know what to do

An experienced backend software engineer in finance explains how LLMs and agentic workflows erode his three pillars of employability: domain knowledge, debugging/distributed systems, and code architecture (now seen as “taste”). AI now drafts docs, writes code, and fixes hard bugs, reducing years of domain experience. The market favors generalists, shrinking demand for specialists. With uncertain long-term prospects, he contemplates pivoting to AI-immune work (math/ML research) or other paths like woodworking, while noting current employment but a bleak horizon.

HN Comments

The Secret Life of Circuits with lcamtuf / Michał Zalewski (Audio Interview)

#725 features Michał Zalewski (lcamtuf). He discusses teaching electronics, his book The Secret Life of Circuits (No Starch Press), and the Amp Hour promo code AMPHOUR26 (June 1–30). The chat covers deriving formulas from basic trig vs calculus, row hammer DRAM, fuzzing, and security; influential books (American Fuzzy Lop, The Tangled Web, P0f v3, Silence on the Wire); the history of electronics and security, including calculators, CRTs, Nixie tubes, and transistors (FETs vs BJTs). Projects include a clock from current meters; a woodworking/AI example.

HN Comments

9 Mothers (YC P26) Is Hiring

9 Mothers AI mission systems in Austin builds deployable counter-drone hardware–software, shipping hardware at software tempo with autonomous perception, kinetic engagement, and manufacturability front and center. Teams own full systems, iterate on telemetry, and treat operators as users. A day includes range setup, live-fire tests, debriefs, bench work, and rapid re-spec. They’re hiring across Perception, Robotics, Hardware, and Platform (Senior and Staff) roles in Austin, including ML, CV, embedded BSP, and R&D. If you don’t see your role, reach out; recruiters should not contact them.

HN Comments

Enforcing the First as in BGP AS_PATHs

Cloudflare analyzes BGP hijacks that forge AS_PATHs to misdirect traffic. They argue that enforcing the First AS in AS_PATHs is a simple, effective defense even when ASPA validation fails. Through examples involving Orange and Gcore, they show how forged paths can bypass protections unless the First AS matches the peer. Their measurements show about half of Tier 1 networks enforce the rule by default, while others accept malformed paths. Vendors’ defaults vary (Cisco yes, Junos no, FRR yes, etc.). They urge operators to enable First AS enforcement on EBGP sessions (excluding IX route servers) to improve Internet routing security.

HN Comments

Scientists ejected from diabetes conference for distributing journal reprints

Five scientists were escorted out of the American Diabetes Association meeting in New Orleans for handing out reprints of a Diabetes Care editorial criticizing the Trump administration’s attacks on science. The ousted were Steven Kahn (editor-in-chief of Diabetes Care), Desmond Schatz, Aaron Kelly, Justin Ryder, and Irl Hirsch. They distributed outside a room where NIH director Jay Bhattacharya was to speak; the ADA said they violated its code of conduct and were removed. Critics called it censorship and questioned whether disseminating a journal editorial constitutes disruption. Kahn seeks readmittance; the editorial carried a disclaimer that the ADA had no involvement.

HN Comments

Games Between Programs: The Ruliology of Competition

Wolfram surveys the ruliology of competition by modeling two agents repeatedly playing a simple payoff game, with each agent’s decision rule as a program (finite-state machine, cellular automaton, or Turing machine) fed by past moves. He exhaustively compares all small-state strategies in match-or-not and prisoner’s dilemma, across 2-, 3-, and 4-state machines, and even adaptive evolution. He finds that winners need not be the simplest or the most complex; larger strategies often outmaneuver smaller ones, and evolution can yield universal winners against a class of opponents. Across rules, outcomes reflect computational irreducibility: predicting winners requires running the competitions.

HN Comments

Win16 Memory Management

Win16 Memory Management explains how 16-bit Windows managed memory as movable 64KB segments identified by 16-bit handles. GlobalAlloc allocates segments; GlobalLock pins one and returns its address; GlobalUnlock releases it. Segments can be fixed or movable, and discardable or nondiscardable; Windows may move or discard unlocked segments, creating bugs if pointers are used after unlock. NE executables and DLLs use imports/exports; the loader may patch exported prologs when a data segment moves, unless marked NODATA. Windows prologs/epilogs manage DS/SS for far functions; compilers use /Gw and /Aw. OS/2 offered a protected-mode model using segment selectors. Tools SHAKER/HEAPWALK/Stress stressed memory.

HN Comments

Speculative KV coding: losslessly compressing KV cache by up to ~4×

Speculative KV coding losslessly compresses a large model’s KV cache by predicting per-scalar values (μ, σ) with a cheaper predictor and encoding the true KV with arithmetic coding. The predictor runs on both sides; the encoder also runs the target to form KV_full. An optimized predictor uses FP8 quantization to keep residuals small. Early results with Qwen3 show notable bitrate reductions; combined with FP8 caches the approach yields ~6–8× total compression. Future work: better residual models, alternative predictors, and throughput/bit-identical constraints for use in cross‑DC prefill and larger caches.

HN Comments

Arithmetic Without Numbers – How LLMs Do Math

Rune explores whether an LLM can perform arithmetic from internal state under a no-parser rule, not by text parsing or external tools. Using four tools (probe, sparse autoencoder, activation patch, steering), the study tests five routes for gcd, division with remainder, and lcm. Across 11,736 locked examples and 1,536 targets, activation-derived readouts that supply calculator arguments yielded large exact-answer gains (division with remainder +0.81, gcd +0.50, lcm +0.97) with 0 fires on a hard-negative audit. The recommended route is reading operands from activations and computing externally, not residual writes; portability is limited.

HN Comments

The circus freaks of open source

The circus freaks of open source examines how public fascination with the mental health crises of developers like Terry A. Davis (TempleOS) and Kent Overstreet (bcachefs) turns their work into spectacle. The piece argues this sensationalism harms the individuals, fuels harassment, and distracts from technical achievements. It critiques online communities for voyeurism and calls for compassion, privacy, and responsible discourse rather than gossip or armchair diagnosis. It links this behavior to broader patterns of harassment against neurodivergent and queer people and urges supportive, nonjudgmental responses.

HN Comments

Show HN: Free animated icon library for Vue

Respeak's lucide-motion-vue is a Vue 3 library offering 535 animated Lucide icons.

HN Comments

My Software North Star

Cro's Software North Star prioritizes end-user utility: software should be useful and lovable, correct, and maintainable and efficient. Bugs matter less than user harm; memory-safety or abstract beauty don't compensate for lack of correctness or a process to fix issues. Slow or unmaintainable software undermines usefulness. Detours happen, but the focus remains delivering software users can love, with developer experience only as a means to this end. The north star is maximum end-user utility.

HN Comments

Human-Like Neural Nets by Catapulting

Proposes 'catapulting' neural nets to human-like generalization by extreme overparameterization and high-learning-rate training on small, curated data. NNs would first memorize but, with cyclical learning rates and heavy regularization, grok into a simpler, generalizing algorithm, effectively catapulting to a human-like basin in loss space. A catapulted LLM would generalize better, resist adversarial examples, and be harder to clone, potentially aiding alignment and interpretability. It would be tested on tasks like arithmetic and hard-image benchmarks, using very large models (tens to hundreds of trillions of parameters) trained over many cycles, with dynamic evaluation and sleep-like regularization.

HN Comments

The 29th International Obfuscated C Code Contest (IOCCC) 2025 Winners

IOCCC 2025—the 29th International Obfuscated C Code Contest—highlights include near-historic submission quality, a post-IOCCC28 hiatus period, improved documentation of judging and processes, and a new live-show format with YouTube segments and per-entry award links. Winners and notable entries are listed (including new winner jingp49 from Taiwan and hat-tricks by Endoh, Nick Craig-Wood, and Don Yang). The final rules and guidelines (versions 29.15/29.08, 2025-12-02) were substantially rewritten. Plans exist to open IOCCC30 in late 2026. Resources: winning entries, tarball downloads, FAQs, author info, and publication under CC BY-SA 4.0.

HN Comments

I design with Claude more than Figma now

Edwin Morris describes how Claude reshaped his design workflow at Jane Street. Instead of heavy Figma/docs, he builds prototype features in code, prompted by a problem description, and iterates with Claude to prove feasibility. The process: write the proposal, run a build with Claude, refine, deploy to a dev environment, test with users, and submit a feature that matches his aim. In two months AI-assisted prototyping moved from small tweaks to big developments (even 2000+ lines) and sometimes skips Figma entirely. Benefits: faster validation, clearer design feedback; downsides: reviewers may get fewer input opportunities and risk narrowing creativity.

HN Comments

HateArena – A free and open source arena shooter

HATE is a free, open‑source multiplayer FPS based on the original Cube engine. The hatearena/hate GitHub repo hosts its GPL-3.0 source, README, build scripts, and docs, with links to Itch.io and hate-arena.pages.dev for gameplay demos. The project has ~434 commits, 38 stars, 0 forks, and uses C++, C, Makefile, Shell, Go, and QuakeC; latest release is v0.0.1 (Jun 2, 2026).

HN Comments

PaceVer (an alternative to SemVer, for mobile apps)

PaceVer is a three-part versioning scheme for user-facing apps with two release channels: slow native binaries via stores and fast OTA updates. Versions use MARKETING.NATIVE.OTA, where MARKETING is free and monotonically non-decreasing, NATIVE increments for new binaries, and OTA for each OTA update. When NATIVE increments, OTA resets to 0; when MARKETING increments, NATIVE and OTA usually reset to 0. A new native build must roll out across platforms. It signals deployment pace (not change size or compatibility) and is not for libraries or web.

HN Comments

Made by Johno Whitaker using FastHTML