Serbia just elected the world's brainiest parliament

YouTube-style UI over 6,454 videos sourced from 39,834 HN comments since 2007.<a href="https:&#x2F;&#x2F;hackertube.org&#x2F;" rel="nofollow">https:&#x2F;&#x2F;hackertube.org&#x2F;</a>

HackerTube: YouTube built from videos recommended by HN

TCP Use-After-Free: CVE-2026-98432 / CVSS 9.8

Do the math: How we took over ChatGPT accounts

Anthropic blocks users for anything touching training larger models

Simple circuits can create complex behaviors

<a href="https:&#x2F;&#x2F;github.com&#x2F;jepsen-io&#x2F;particledb" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;jepsen-io&#x2F;particledb</a>

Jepsen: ParticleDB 1.1.4

An Italian farmer found some unknown seeds in his attic and planted them

AI, Lean, and the Future of Formal Verification, with Lean Creator Leo de Moura

It's the memory latency, stupid

Memdoor: A team of 5 Qwen3.8-27B models beats Fable 5 on LiveCodeBench Hard

The Duty of a Scholar

Reading and writing are less symmetric than you (probably) think

<a href="https:&#x2F;&#x2F;archive.ph&#x2F;Eqn1F" rel="nofollow">https:&#x2F;&#x2F;archive.ph&#x2F;Eqn1F</a>

Surviving "The Graduate"

Based on vermiceli&#x27;s annotated disassembly of Contra: <a href="https:&#x2F;&#x2F;github.com&#x2F;vermiceli&#x2F;nes-contra-us" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;vermiceli&#x2F;nes-contra-us</a>. Thanks for the great work.I ported it in two steps. First to C: the game logic is translated routine by routine from the 6502 assembly, and checked frame by frame against the original in the Mesen emulator. Then the C code to WebAssembly so it runs in the browser.The cherry on top: online multiplayer, so two players can play co-op over the internet.Source: <a href="https:&#x2F;&#x2F;github.com&#x2F;epoyraz&#x2F;nes-contra-us" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;epoyraz&#x2F;nes-contra-us</a>

Show HN: NES Contra (1987) port (ASM –> C and then C –> WebAssembly)

William Nordhaus has died

All the ideas came from the boot sector demo scene where people had been writing chess and BASIC games in 512 bytes, even a C compiler. I wondered what one can do using a neural network instead of a program and generating boot logs for non-existent hardware was something fun to try.Entire inference engine is 510 bytes of MBR, weights, vocab, and strings reside in the sectors following MBR. Small char-level neural network was trained on dmesg generated by machine, so machine produces Linux boot messages infinitely.train.py performs precisely the same integer arithmetic operations as the asm code does and thus produces an output identical character-by-character to the one produced by QEMU. The difference analysis revealed my favorite bug. The characters at the beginning matched those generated by the simulator, but then the output diverged. I retrieved the hidden layer via QEMU’s debug port and compared the neurons&#x27; values with those of the simulator, one neuron at a time. Only the value of the first neuron was correct. The activation involves idiv, and idiv stores its remainder in edx. The pointer to the biases table was stored in edx, which resulted in the first neuron being biased correctly and the following ones using garbage. Now the bias&#x27; address is determined from the loop counter, and no pointers have to survive the division. Another bug I found simply by looking at the code before I did my first run-through: the BIOS print routine zeros out bx, but bx contains the predicted character number. This explains the push and pop of bx surrounding the print.sectorllm is the most similar to my project, as it runs an actual 5-layer llama2 with attention mechanism in just 1.2K of assembly code. It is the trade-off in the opposite direction, as my engine needs to fit into one sector and therefore my network has just one hidden layer of int8 operations for dreaming the dmesg.

Show HN: A language model that lives in a boot sector

Altoids Project

Much Ado About None: Sentinel Values in Python

When electric cars were for women