Front-page articles summarized hourly.
An issue complains that Home Assistant scans secrets without explicit opt-in and may send data to Have I Been Pwned. The thread debates privacy, with proponents citing k-anonymity and that passwords are not sent; a suggestion to make the feature opt-in. The issue is ultimately closed as won't fix, with some users threatening to fork.
Boolean scans in APL can be made fast by exploiting symmetries among primitive boolean functions. By applying pre/post-processing transformations (with negation and reversals) to truth tables, many binary booleans are interrelated; the relations form an equivalence class where ∧, <, and ≠ cover all cases. Implement fast versions of these core ops and derive the rest via symmetries, reducing implementation effort and code size without hurting performance. The piece details efficient word-level scans (XOR, AND, Less-than) with aggressive carry handling and notes related work in K/CBQN; performance reaches up to ~10.5 bits per cycle.
Access to hub.jhu.edu is blocked by Cloudflare’s security. The page notes you must enable cookies and that certain actions can trigger the block (e.g., specific words, SQL commands, or malformed data). To resolve, email the site owner with details of what you were doing and include the Cloudflare Ray ID shown on the page.
Alex Wang recasts transformers as memory stores that map keys to values. Recall is affected by interference among memories; capacity is the memory count M the store can recall before interference drowns signal. The basic outer-product memory has capacity ~ d_k. The optimal linear memory stores memories to double capacity (~2 d_k). Introducing nonlinearities (MLPs) suppresses interference and boosts capacity to ~2 d_k^2/3 (Squared ReLU) or ~2 d_k^3/15 (Cubed ReLU). Self-attention is a non-parametric memory; with beta ~ sqrt(d_k) capacity near 10^6 for d_k=64. Scaling beta with log M yields essentially unbounded memory, clarifying how transformers memorize vast facts.
FLUX 3 Image Klein is a 5.6B open-weights model for text-to-image generation, image editing, and multi-reference generation (up to 10 refs). It offers native 4K, pixel-perfect edits, and bounding-box–controlled placement. Released as a base model for fine-tuning and a step-distilled, low-latency variant, with FP8, INT8, and NVFP4 builds under the FLUX Kommunity License. Optimized for consumer GPUs—INT8 runs on 8GB VRAM; ~4s for 1MP on RTX 5090 and <9s on RTX 4070. It ranks top among open weights in T2I, editing and multi-reference tasks, and supports LoRA/NVIDIA NeMo AutoModel; safety audits by Cinder.
Monte Carlo simulations use randomness and the law of large numbers to solve problems difficult analytically. Originating with Ulam and von Neumann, they’re useful for numerical integration and high-dimensional problems. Examples include estimating pi by random darts in a unit square, and estimating combinatorial questions like the probability of no set in a 12-card SET hand. They’re also used for retirement projections by simulating many scenarios with distributions for returns and inflation. Code for the examples is on GitHub.
Claude Code's review aims to minimize human time without raising reverts or incidents. Most code is written by Claude, with AI review on every PR and six layers of automated checks (lint, types, tests, build, security, etc.) plus a rollback-capable merge process. Human review is risk-based: low-risk changes may pass with one or zero humans; high-risk require two. The lifecycle spans pre-PR verifications, post-PR bug hunts, security review, and a merge queue with gradual rollout. They measure human time against incident guardrails, share context, and own outcomes.
Stoke Money automates cash-flow forecasting by linking accounts, detecting recurring transactions, and projecting a day-by-day balance and bills. It updates forecasts as you spend, guiding you from signup to a live forecast in three steps: connect or enter accounts, auto-detect recurring activity, and view daily projections. It supports manual entry and Plaid sync; Pro adds MCP AI (Claude/ChatGPT). Plans: Free, Plus ($5/mo billed yearly or $7/mo), Pro ($8/mo billed yearly or $12/mo); 30-day free trial. Security: read-only access, AES-256-GCM, TLS; data not sold; deletion permanent.
C++26 standardizes debugging with <debugging> and three functions: std::breakpoint(), std::is_debugger_present(), and std::breakpoint_if_debugging(). Freestanding, noexcept and non-constexpr, they address runtime debugging needs. std::breakpoint() halts under a debugger or follows platform-defined behavior otherwise. std::is_debugger_present() reports debugger attachment at call time and is replaceable for non-OS environments. std::breakpoint_if_debugging() composes the two. The API enables broader uses like extra diagnostics, disabling timeouts during stepping, and debuggable allocators, reducing ad-hoc tooling.
Penman surveys Anthony Burgess’s life and work, arguing Burgess embodies a hybrid identity: Mancunian North, cosmopolitan literary omnivore, brash media personality. From his Manchester childhood to Joyce’s influence and the Enderby saga, Tremor of Intent, and Ninety-Nine Novels, Burgess fused high culture with pulp and popular culture. He navigated teaching, fame, and a fraught private life—Lynne’s death, his You’ve Had Your Time revelations—and cultivated a public persona that thrived on performance as much as prose, and his self-mythologizing AB persona.
GifCities is a project of the Internet Archive that provides an animated GIF search service. It invites donations to support universal access to knowledge and lists sample search terms such as snowglobe, butterfly, balloons, sparkles, and drawing of a cat.
A Financial Times security verification page tells users to enable JavaScript and cookies to continue, notes a 403 CG000 error with request ID a4b9590539af67ab, and provides help options plus links to Terms, Privacy, Cookie Policy, and related policies.
Anthropic’s Claude explains that the seeds for NIST/ANSI ECDSA curves were not hashes but outputs of the Unix timestamp–seeded lrand48 PRNG in 1997–1998. Claude recovered the seeds (and some base points) using pattern recognition and LLL; for P-192, P-224, P-256, P-384, P-521 (and some binary curves). The clock-based generator reproduced the seeds, implying no backdoor and increasing confidence in the curves. Some base points come from FreeLIP/NTL; others remain unexplained. A bounty funded the research.
Anthropic’s Claude Mythos 5 designed eight quantum-circuit primitives from plain-language briefs and, via a closed-loop evaluator (qubits × gates), produced smaller, faster designs than the best published ones. In 53 hours, Claude discovered a new reversible modular-inversion method for elliptic-curve point addition and, in a quantum-decoder task, achieved ~12× fewer gates by using Berlekamp–Massey decoding with minimal extra memory. These results show AI can speed quantum circuit design, potentially bringing practical quantum computing closer, though Claude remained cautious and benefited from parallel proposals and broader search.
PS5LM enables a jailbroken PS5 to run llama.cpp GGUF models natively on the console, starting with Qwen 3.8. It loads models onto the RDNA2 GPU via Vulkan, runs a private model server at http://<console>:8081, and can query OpenAI/Anthropic endpoints or run local decision models (Ollaya) with calibrated probabilities. Models load from internal storage, USB, or Hugging Face. Requires PS5 firmware 7.00–13.60 and jailbreak with specific payloads; update by copying folders. Not Sony-affiliated; licenses GPL-3.0/MIT.
Adepts of 0xCC recount hacking a Eufy HomeBase 2. They extract the 3.4.2.2h firmware, desolder the flash after damage, and recover data—losing 64 KB. They show the Wi‑Fi credential method: the management SSID uses OCEAN_ plus MAC; the password stems from WPAPSK1 and is created by MD5 and an HMAC-SHA256 with the device SN read over I2C. They bypass UART lockdown by patching a recovery image (U-Boot) to drop into a root shell, then mount a staged filesystem to run main binaries. The piece closes with reflections on AI and article publishing.
Nick Ficara chronicles turning Hack the North’s name tags into 1,750 programmable PCB badges with screens, LEDs, and Bluetooth. Tracing EVT, DVT, and PVT through design wins and near-disasters, the piece details mislabels (10u vs 10uH), dense FPC soldering, NFC mis‑behavior, silkscreen hiccups, and the fab’s changing instructions. Supply-chain chaos forced last-minute trade-offs; a reverse-polarity FET and orientation dots improved safety and assembly. About 1,725 working boards shipped on time for roughly $11.60 each; the hardware, firmware, and emulator are open source, and hackers built projects like an Among Us game.
Senior Backend Engineer role at Piramidal, Inc. in New York. Full-time, 5 days/week with travel to client sites; US work authorization required. Build and run Python and Go services handling real-time neurological data streams; design data models, ingestion pipelines, and APIs for clinical workflows; collaborate with ML engineers to productionize models; ensure observability, capacity planning, and incident response; develop software to regulated medical-device standards (cybersecurity, traceability, change control). 5+ years backend experience; strong Python, concurrency, testing; containerization/Kubernetes; relational DBs; nice-to-have Go, Azure services, columnar formats, and PyTorch model serving. Comp: $250k–$300k + equity.
Mercor’s Benchmark Map catalogs benchmark coverage of the US economy, mapping 18,797 O*NET tasks across 923 occupations into 22 families. From 29 benchmarks, 208 occupations have at least one task with 5+ prompts; 6 families have none. The map finds that roughly 90% of working hours involve tasks with little benchmark coverage, with coverage skewed toward high-wage, AI-exposed tasks in large occupations (e.g., lawyers) and underweighting many middle-income knowledge jobs. They propose weighting by O*NET tasks to estimate occupation-level performance. Early results with APEX benchmarks are similar to simple averages. Limitations: sample, task difficulty, augmentation, physical tasks; updates planned.
Made by Johno Whitaker using FastHTML