The newest HackerNews stories, desensationalized.

Human-Centered Computing Foundation is advancing a .self top-level domain through ICANN’s Applicant Support Program to create a human-centered alternative to the current attention-driven web model. The proposal emphasizes a free, one-subdomain-per-person structure, with a stated focus on ethical, human-oriented technology and easier access for self-hosted content. Commenters generally agree the anti-abuse problem is central and argue that a fixed identity-linked registry, anti-squatting enforcement, and periodic proof of use would be required for credibility. Several suggest limiting transferability, preventing parking, and tying domains to verified identities through strong mechanisms such as passkey-linked ID proofs. Others question whether a new TLD is necessary, pointing to existing infrastructure like existing low-cost domains and even HCCF's own onmy.cloud subdomain path. Multiple participants doubt operational readiness after encountering site errors, unstable pages, and strict email-validation blocks during signup attempts. Concerns also focus on the practical definition of "self-hosted" and "ethical," the feasibility of privacy-preserving identity proofs, and how abuse prevention can avoid arbitrary takedowns. The thread repeatedly returns to economics: free or very cheap allocation could invite abuse, while higher fees undermine the initiative’s accessibility goal.

The post argues that Qwen 3.6 27B is a practical local sweet spot, presenting it as a significant step up from earlier local models for coding and general tasks. The author contrasts the dense 27B and MoE 35B A3B variants, preferring 27B for output quality and instruction adherence despite lower token speed. They provide a full setup path using llama.cpp via Hugging Face GGUF quantized models, especially unsloth Q8_0 with multi-token prediction, and show how to hook it into OpenCode through an OpenAI-compatible local endpoint. Performance claims center on roughly 30 tokens/s on a 128GB M5 Macbook and around 50 tokens/s on an RTX 5090 at higher quantization, with both variants fitting under 48GB shared memory on Apple Silicon and faster behavior than expected on dedicated GPUs. Benchmarks from external trackers are cited to position 27B ahead of Gemma4 31B in this context and close to DwarfStar4 in practical use under comparable settings. The author notes that quantization choices materially affect speed versus quality and that higher context and aggressive optimizations change latency. Broader takeaways emphasize privacy, data control, and avoiding cloud lock-in, with a forecast that local-first AI will improve as model design and tool interfaces evolve. They also frame this as a transitional moment where smaller and specialized local models become viable for meaningful offline work while frontier open-weight models are still expensive to run on consumer hardware.

The post argues that macOS Tahoe’s Liquid Glass redesign regressed app icons by enforcing a single squircle shape for third-party apps, reducing visual distinction and compressing many icons into similar gray-backed forms while blurring and simplifying previous designs. It contends that Apple’s refined Golden Gate icons are better than Tahoe’s, citing sharper detail and reduced blur, but says the larger mistake remains mandatory shape uniformity. The author links icon recognition to accessibility and usability, noting that when shape cues disappear, color becomes the main differentiator, which can fail for color-vision deficiencies or near-identical palettes. The article cites weak adoption of Clear and Tinted styles and points to a long-running Apple feedback request to lift third-party shape restrictions. Readers commenting show a split between supporters of the squircle standard, who value consistent visual weight, predictable click targets, and platform alignment (including a possible VisionOS-driven rationale), and critics who say uniformity hurts fast recognition and branding clarity. A common proposal among commenters is a compromise: keep a squircle core while allowing controlled overflow or shape detail that preserves grid consistency. Others additionally ask for stronger contrast controls, suggesting configurable color overlays or grayscale-plus-contrast options to improve readability without relying on shape bans.

The piece explains how Fil-C adds memory-safe support for setjmp/longjmp and ucontext-style context switching APIs in the 0.680 era, requiring source builds for early access. It argues these APIs are traditionally dangerous because they can restore stale or dangling stacks when used incorrectly, producing crashes that are difficult to diagnose and potential exploit paths. In setjmp/longjmp, Fil-C prevents misuse by making jmp_buf opaque and compiler-restricted to direct symbol calls, so the optimizer always treats setjmp correctly as returning twice and preserves spill-slot assumptions. The runtime stores only an opaque zjmp_buf handle, tracks valid jump targets per stack frame, and panics when longjmp leaves the valid ancestor window; it also restores internal runtime state and GC roots to avoid dangling-pointer corruption. For ucontext, Fil-C also uses an opaque zfiber_context object, ignores user-provided stack pointers, allocates a private stack from ss_size, and enforces a strict state machine (uninitialized, after_getcontext, runnable, running) plus thread affinity rules so stacks cannot migrate across threads. GC integration is handled through grey fiber tracking to avoid missing roots when running contexts are swapped during marking, with an explicit termination fallback that assumes no missed references if the collector is truly out of work. The implementation currently targets the glibc build and explicitly blocks mixing ucontext with setjmp/longjmp as a long-term safety policy, positioning the approach as conservative but practical.

The page provides a practical walkthrough for running Lisp on the PDP-1, centered on the author’s work-in-progress notes and revised instructions. It opens with historical context that Lisp was created in 1958 and points beginners to the PDP-1 and Lisp 1.5 manuals, then gives machine-specific startup steps, including switch settings for Extend, TW, SS5, and address registers. It explains interactive behavior details such as space-terminated input lines, using nil checks to verify the REPL is active, and symbol names like plus and times with octal arithmetic examples. The guide then covers the tape-based workflow: loading functions from paper tapes (including lisp-defs.pt), testing them, printing source via print, and using pdef with Sense Switch 3 to punch recoverable definitions back to tape. It highlights that core memory retains state across power cycles, so restarting often only requires address resets and CONTINUE. A short note points to external resources for DDT integration and suggests combining assembly and Lisp through manual procedures. It also links to supplemental AI-tutor markdown files intended to let language models answer PDP-1 Lisp questions.

Researchers reported molecular-level signatures consistent with two distinct local water structures by applying an unsupervised autoencoder to 74 million configurations from TIP4P/Ice simulations, training it to capture density and local energy while discovering orthogonal structural descriptors without manual assumptions. The model isolated two clusters corresponding to a denser disordered state and a less dense ordered state, supporting the two-state model and evidence for a liquid-liquid phase framework. The study further found that transitions between the states change shape with thermodynamic conditions: a single upper semi-loop path dominates in high-density liquid, a lower semi-loop path in low-density liquid, and a three-dimensional full-loop route appears near the phase boundary. This boundary region produces three transition states and then collapses toward simpler pathways as one liquid state dominates. The team argues this addresses a decades-old challenge in water theory by identifying molecular fingerprints and interconversion dynamics that traditional density-energy descriptors could not separate. Scientists still note that immediate follow-up work is needed to physically interpret the hidden model features and verify them experimentally. Potential implications were framed broadly for water behavior in biological and geological confined environments. Zeng described the findings as stronger evidence for a long-debated molecular heterogeneity model but not a final resolution.

Rocket Lab and Iridium announced a definitive agreement in which Rocket Lab will acquire all outstanding Iridium shares at $54 per share through a cash-and-stock structure with an exchange ratio collar of $67.50 to $112.50, for an estimated Iridium enterprise value of about $8.0 billion. The buyers frame the deal as a vertical integration play that combines Rocket Lab’s launch and spacecraft manufacturing with Iridium’s L-band spectrum, 500-plus partner ecosystem, and global satellite constellation to create a network-capable operator spanning launch, spacecraft, and on-orbit services. The combined company would target space IoT, direct-to-device connectivity, resilient positioning, navigation, and timing, and safety-of-life uses across commercial, defense, aviation, maritime, and government markets. Management expects the acquisition to add recurring cash-flow profile support, citing Iridium’s 2025 revenue of $871.7 million and 57% OEBITDA margin, while also reducing dependence on third-party launch capacity for constellation deployment. Transaction support includes unanimous board approvals, shareholder-vote commitments from Iridium directors, a planned 364-day $3.6 billion bridge facility, and a mid-2027 closing target pending investor and regulatory approvals. Investors are warned the announcement contains extensive forward-looking risk language, including completion risk, financing and integration execution, regulatory and legal uncertainty, and potential diversion of management focus despite the strategic rationale.

DeepReinforce introduced Ornith-1.0 as an open-source, MIT-licensed agentic coding model family built on Gemma 4 and Qwen variants, with 9B dense, 35B-MoE, and 397B-MoE checkpoints. It claims state-of-the-art coding-agent results at its size on multiple agentic benchmarks, including Terminal-Bench 2.1, SWE-Bench Verified/Pro/Multilingual, NL2Repo, Claw-eval, and SWE Atlas variants, and reports consistent harness settings and decoding choices across size-matched comparisons. The model is described as a reasoning system that can emit a block by default and supports OpenAI-style tool-calling output through a reasoning_content field. The release emphasizes deployment practicality with 256K context support, OpenAI-compatible serving via vLLM and SGLang, and lighter 9B, 35B, and 397B quantized/GGUF options for local inference or multi-GPU sharded serving. It includes concrete setup examples for local testing with Transformers, API calls, and integrations with agent frameworks such as OpenHands and terminal-based tooling. The authors also provide command templates for serving, MCP tool usage, and CLI automation aimed at terminal coding workflows. Reported benchmarks frame the model as performing strongly versus comparable open models, though the write-up also notes tradeoffs in context, runtime requirements, and tool-handling configuration. Public commentary introduces substantial skepticism, saying the model appears close to strong base-model fine-tuning rather than a fundamentally new architecture and questioning whether improvements are sustained outside benchmarks. That perspective raises open questions about whether headline claims rely on benchmark selection and evaluation habits as much as broad reliability.

Marcus Lewis proposes an SSH-first graphical shell model in which server-side apps run as small HTTP services on Unix-domain sockets and are discovered through an API so a host can present them as a home screen of web and native tools. He argues this avoids public web exposure for services like notebooks and boards by using SSH for transport, while keeping each app simple and low-dependency by shifting security and encryption to the SSH layer. The post introduces Outer Shell and related documentation for an ecosystem spanning Outer Loop, an SSH browser, and Outer Frame, with a plan for platform-tailored native clients alongside HTML-based apps. He frames the approach as an alternative path for operating remote servers, especially edge devices, by separating backend logic from frontend presentation and allowing apps to interact via URL discovery. In reaction, readers challenge whether the idea is truly novel, citing older tools such as Cockpit, Webmin, Windows Admin Center, and Xpipe as prior evidence of similar server management architectures. Others focus on practicality, noting existing workflows with SSH tunneling, VPNs, and per-app web deployment already solve many access needs. Security is a major counterpoint: several commenters say browsers do not permit generic socket permissions for a reason and worry about surface area, while others see the model as potentially useful if constrained properly. Additional concerns include the need for cross-platform compatibility, performance overhead from layered HTTP, client installation requirements, and whether arbitrary command workflows should still remain first-class. Several participants also see value in CLI integration, shell-triggered app launches, and possible text/GUI hybrids rather than replacing terminals entirely

The Supreme Court held in Chatrie v. U.S. that police access to smartphone location histories obtained through geofence warrants is a Fourth Amendment search requiring privacy protection, and a majority rejected the claim that short-duration, public-place location data is free of constitutional concern. Justice Kagan’s opinion emphasized that location records are highly revealing and that users do not truly consent to broad government use of this data by merely enabling ordinary phone functions. The Court also faulted the government’s argument that third-party collection defeats privacy expectations and cited the practical pressure on users to enable location services. The decision sends the case back to lower courts to decide whether this particular warrant was sufficiently particular and backed by probable cause, so it does not ban geofence warrants outright. Commenters highlighted that a 2018 Supreme Court decision already required warrants for location-history access and that Chatrie’s own case showed a multi-step geofence process that narrowed 19 nearby devices to three named accounts before identifying him, yielding a robbery conviction based on associated evidence. Google, the parties, and experts described broad “sweeps” that can pull in private residences and bystanders, with officials saying the tactic is often necessary after investigative dead ends. Critics argued that practical safeguards still depend on how courts apply particularity and good-faith standards, not the ruling alone. Others framed the decision as a meaningful constitutional step while warning it remains narrow, and some contrasted it with broader political rulings happening the same week.

South Korea announced a roughly $1 trillion package combining government funding and major technology-company investment aimed at expanding memory-chip manufacturing, building AI data-center capacity, and advancing humanoid-robot deployment by 2028. The plan is partly a response to the AI-driven surge in demand that has lifted Samsung and SK Hynix profits and raised DRAM prices, while also creating shortages in consumer electronics. The largest allocation, about $585 billion, is directed to new semiconductor fabs in southwestern regions and expanded capacity around Seoul, with officials targeting a doubling of DRAM output within five years. The policy framing emphasizes semiconductors, physical AI, and AI data centers as strategic priorities, while Hyundai and its robotics efforts are positioned as a path toward large-scale factory automation. The rollout is taking place amid broader public debate in South Korea over windfall gains from AI demand, proposals to redistribute these profits, and union concerns about job displacement from humanoid robots. The article’s message is therefore both a national industrial strategy and a social-policy tension point.

The article argues that the administration is using the new national security framework to treat possession of radical political materials as evidence of violent conspiracy. It centers on Daniel “Des” Sanchez Estrada’s 30-year sentence for transporting anti-government zines his wife allegedly asked him to hide, noting he was not alleged to have taken part in the July 4, 2025 shooting at the Prairieland immigration jail and was one of eight defendants given a combined 450 years. The prosecution’s theory linked his wife’s ideology to culpability, and the piece says this mirrors other government efforts to criminalize associations by analogy, citing requested subscriber lists for livestream reporters Don Lemon and Georgia Fort as an example. The text also cites prior claims that information or documents from whistleblowers and political media can be treated as contraband, and says NSPM-7’s broad “anti-fascist” targeting language now extends to anti-immigration, anti-state, and anti-establishment viewpoints rather than clear violent acts. It warns the logic could deter people from keeping or forwarding controversial material, while expanding watchlists and deportation targeting of speech-adjacent communities. The piece further argues U.S. District Judge Reed O’Connor signaled deterrence by sentence severity, and that the administration openly expects more cases of this type. Critics in comments agree on the seriousness of the prosecution theory but differ on whether 30 years is punishment for evidence concealment or punishment for politics, and they point to the judge’s conservative case history as a concern for appeal outcomes.

The submission presents a reverse-engineered overview of Apple’s Neural Engine on A11 through A18 and M1 through M5 chips, detailing the datapath, roofline limits, dispatch path beneath Core ML, compiler and on-disk program format, weight compression, and driver-level protocol design. It separates measured, decompile-derived, and predicted claims, includes per-chip target tables, and reports direct M1 and M5 measurements. The work documents where ANE sits beneath Core ML, describes a direct user-space access route for experimentation, and warns that route is undocumented, unsupported, and version-sensitive. It emphasizes Core ML as the supported production path and frames the contribution as research-focused rather than a shipping-ready API. It also includes methodology notes and unresolved questions to keep conclusions auditable and testable for hardware software practitioners.

The article presents a master's-thesis prototype for a local-first, hyper-relational knowledge base built around statements encoded as statement(Subject, Predicate, Object, Properties), where subjects and objects can themselves be statements for reification. It pairs content-addressable storage with a staged, SHA-256-hashed workflow so updates are committed atomically, deduplication is automatic, and history is preserved via replaces_id links that form version chains. The runtime is Prolog-first using Trealla Prolog, with SQLite and Raylib accessed through C FFI libraries, and it offers a Raylib-based GUI with graph visualization, image previews, search, and query input. It includes a reproducible build path with submodules and Make targets that compile CAS, GUI, and SQLite shared objects plus optional Nix-based setup, and it exposes CLI routes for loading contexts, asserting and searching statements, checking history, ingesting files, verifying consistency, and garbage collection. The architecture includes schema and module-level separation across Prolog and C layers, with recursive context loading via CTEs and in-memory working sets, suggesting a system designed for deterministic local reasoning workflows rather than centralized deployment.

WATaBoy’s author builds a proof-of-concept Game Boy emulator that emits WebAssembly bytecode at runtime, links it through JavaScript into a main Wasm module, and dispatches generated blocks with call_indirect so it can run under browser JIT engines despite iOS-native JIT restrictions. The implementation uses Rust nightly plus wasm-encoder, C-ABI imports, inline Wasm for dispatch, and a growable indirect function table exported from LLD so each compiled block can be appended and invoked dynamically. Benchmarks on an M2 MacBook Air compare a JIT-to-Wasm path, a Wasm interpreter, and a native interpreter over 10-second loops on three ROMs, with results reported as frames relative to the Game Boy refresh rate. The JIT-to-Wasm path is reported about 1.2x faster than the native interpreter and about 1.5x faster than Wasm interpretation, with Safari leading among the tested browsers despite profiling having been done largely in Firefox. The author frames success as modest but meaningful, noting that emulator optimizations remain incomplete, especially for PPU interrupts, and that further gains likely require less interpreter fallback and better branch block support. They also argue that the main gap for broader adoption is toolchain ergonomics: current projects rely on custom Wasm codegen and lack mature high-level emitters like DynASM-style systems for Wasm, while some low-level hardware optimizations used by larger emulators are impossible in current Wasm constraints. Final claims are cautious: this does not prove GameCube-class emulation speed, but suggests JIT-to-Wasm is a viable direction for CPU-bound cross-platform emulation and particularly attractive for iOS via browsers.

In this post, the author tests SQLite insert performance with unordered 20-byte random IDs from SecureRandom, using a table declared as event(id BLOB PRIMARY KEY, data BLOB) WITHOUT ROWID. Inserting unsorted random keys inside batched write transactions takes about 2,478 ms for the first million rows and 11,103 ms for 10 million, roughly 100,000 inserts per second, matching earlier UUID4-style behavior. The slowdown is attributed to B+Tree write patterns, where random key order causes page splits and rebalancing overhead. The post then proposes sorting each batch before insert and explains that SQLite compares BLOB values via memcmp-style ordering, so comparing just the first eight bytes as an unsigned long is used as a practical approximation. That comparison uses ByteBuffer and Long.compareUnsigned to emulate SQLite ordering while keeping sort cost low. A second benchmark with pre-sorted IDs reduces runtime to 1,987 ms for 1 million rows and 3,835 ms for 10 million, suggesting an approximate 2x to 3x improvement in this workload. The author frames this as a batching-enabled optimization for unordered primary keys and shares benchmark code separately, while noting the sort routine may not be optimal and inviting faster alternatives.

The post combines a hike-centered field report with a detailed build diary for Wallace, a 153mm f/2.8 ultra-wide-field telescope intended for deep-sky viewing in outdoor settings. The author describes carrying a backpack load of gear to preserve an unplanned cinematic mood, preferring ambient impressions over polished production and noting that the experience improved focus on surroundings rather than diminishing it. The telescope’s design goal is a fast, wide field in a portable format, with framing of large objects like NGC7000 in a single view highlighted as a key strength. Optical execution proved difficult: the primary ended at roughly f/2.84 after a misread shim thickness, fine-grinding was redone after a major scratch on the first attempt, and the final mirror leaves a central hole that is masked by the 59mm secondary. A 4-element GSO/Ceragioli corrector is required at this speed, and the author reports better results at about 79mm spacing than the stock 56mm, with less chromatic error than prior approaches and good agreement with published guidance despite low-cost expectations. Structural details include a 3D-printed deep-blue ASA two-module dovetail inspired by the Coulter CT-100 and six carbon rods, plus a simple six-point primary support. Performance is described as strong over about 66 percent of the field with acceptable edge falloff, and the design files are shared publicly on Printables. The builder links multiple astronomy forums for continued discussion and cites a future iteration plan for a thin meniscus mirror blank to reduce weight and shorten cooldown, while keeping a stricter minimum figure quality target.

Nearly one million passports and photo IDs from multiple European countries were reportedly accessible for months via public URLs used by cannabis-club systems linked to Nefos' PuffPal platform, with no authentication, encryption, or monitoring. A journalist found the files by searching obvious URL patterns, so no intrusion exploit was needed. The storage of full scans, photos, and identifying numbers for age verification was treated as routine despite the high sensitivity of the data and the fact that passports and driver’s licenses cannot be quickly revoked like passwords. Security guidance cited in reporting emphasizes the severity of identity document loss, including fraud and account takeover risk, and commenters in the thread reinforced this by citing similar incidents and warning that the exposed materials could be monetized quickly. The incident is framed as a systemic governance failure rather than a one-off technical bug, comparable to broader historical data-extraction scandals where broad collection was paired with weak protections. The article also raises unresolved questions about accountability and regulatory action, since no official statement from the operator or operators was included. Overall, the event underscores that “verification” systems create a duty to design secure retention and access controls from the outset rather than treating storage as secondary.

Different AI tools currently maintain separate, siloed context stores, so preferences and prior work are often lost when users switch between assistants or interfaces. The piece introduces Open Memory Protocol (OMP) as a vendor-neutral way to make memory objects portable through a shared specification, reference server, and API contracts. It positions OMP as a self-hosted service where tools can store, retrieve, and search semantic and structured memories via standard REST endpoints, with authentication and export/import support for moving data between servers. The write-up includes concrete deployment and usage guidance, including Node.js/Docker setup, health checks, examples for posting and querying memories, and a Claude MCP flow using recall, remember, list, and compress commands so context can continue automatically across conversations. It also details memory object fields such as content, type (episodic, semantic, procedural), source metadata, tags, and timestamps, and shows extension points through adapters for Claude, browser-based AI tools, and custom HTTP clients. A browser extension is presented as a low-friction path to inject the same memories into web chat experiences, while current adapter and SDK coverage remains partial. The project is described as Apache 2.0 and community-driven, with a roadmap from v0.1 core protocol to v1.0 with standardization, plus explicit calls for additional language SDKs and integrations.

The author describes a regression in hyperscript 0.9.91 where fetch ... as JSON began binding as as a conversion expression instead of a fetch modifier after a refactor shared parsing logic between fetch and go. They used Claude to identify the root cause quickly, then reviewed several AI-suggested fixes. The first was a narrow workaround that worked only for the reported string literal case, and the second introduced a context-sensitive parser flag that could be overbroad and harder to justify. The author then pointed to an existing parser feature, follows, which temporarily reserves tokens so expressions do not preempt command-level modifiers, and that produced a much better direction. During final review, they noticed that the broader AI patch also disabled valid as conversions in go, so they implemented a targeted change in FetchCommand#parse() to keep behavior correct for go while fixing fetch. They added focused tests and reported the corrected behavior as stable, crediting AI for rapid diagnosis and test generation but stressing that architectural filtering still required human judgment. The broader lesson is that AI helps with speed and routine tasks, yet it can nudge toward ad hoc designs unless a developer with parser knowledge steers it. In concluding reflections, the author links AI use to aging: it can offset memory and endurance limits, but may also weaken independent reasoning if relied on too heavily, framing human oversight as the real safeguard.

The article traces a full CUDA vector-add kernel execution, starting from host C code and following nvcc’s multi-stage compilation into PTX, then SASS, plus a fatbinary that embeds both device forms inside a normal executable. It explains how cudaLaunch replaces kernel syntax with a stub that packs arguments, registers mappings between host symbols and device entry points, and triggers runtime-driver handoff through libcuda. It describes first-use behavior: lazy module loading in modern CUDA releases, where the kernel image is uploaded on first launch, and the launch command is translated into methods written to a pushbuffer and indexed via GPFIFO entries. The GPU-side control flow then uses a doorbell, QMD descriptor, and compute distributor to schedule 4096 blocks of 256 threads across 128 SMs, with register and thread limits determining occupancy. The piece details warp execution mechanics, including per-warp program counters, static instruction scheduling hints, and scoreboard barriers that hide memory latency with low hardware overhead. It also shows how coalesced 32-thread accesses generate four 32-byte sector loads, how data flows through L1/L2 and DRAM, and why observed memory throughput dominates runtime in this low-intensity workload. Nsight Compute metrics back this with high DRAM utilization and low instruction-issue activity, matching the explanation that the kernel is bandwidth-bound. After completion, the GPU signals a semaphore, the copy engine pulls cached output (staying in L2) across PCIe, and the CPU resumes to print values. The appendix adds concrete reverse-engineering methods using mmap hooks, ioctls, method decoding, and QMD field mapping to verify claims not visible in open-source stacks.

Dark-sky lighting is presented as full-cutoff, mostly amber, and dimmed only when needed, directing light downward to reduce glare, wasted spill, and skyglow. The article argues that lowering brightness and using lower color temperatures improves visibility at night while reducing disability glare for drivers and pedestrians, and cites a 14-year study in England and Wales across 62 authorities that found no clear rise in traffic accidents or crime after reduced lighting. It also links excess blue-rich light to disrupted circadian rhythms and potential long-term health effects, while arguing that reduced blue wavelengths are more compatible with human sleep patterns. Ecological harms are framed as substantial, with claims that artificial night lighting disrupts plants and animals ranging from birds and insects to mammals and marine species. Financially, it notes that about 30% of U.S. outdoor lighting is wasted and that $3.3 billion is spent annually on that waste. The article emphasizes star visibility loss from modern blue-white LED adoption and calls for municipal choices that favor warm/amber options. It describes practical implementations such as amber LEDs, timer and motion-control strategies, and links advocacy to local action. Case examples include Davis, California's successful opposition to white streetlights and Flagstaff, Arizona, where extensive amber dark-sky practices are associated with Milky Way visibility and dark-sky designation. It closes with a call for affordable, practical replacement lighting and coordinated community pressure on cities to adopt these standards.

The post argues that AI serving is shifting from single-model dispatch to router-owned collaboration, where bounded micro-agent loops run inside the model API to improve reliability, cost, and safety without changing client contracts. It introduces vLLM Semantic Router as an open-serving primitive and contrasts commercial approaches that treat collaboration as an endpoint feature with a model-identity abstraction that stays OpenAI-compatible. The runtime, called a looper, selects among patterns such as Confidence, Ratings, ReMoM, Fusion, and Workflows based on signals like task risk, latency, and contract constraints, with explicit controls for budgets, concurrency, topology, failure policy, and traceability. Confidence escalates only difficult cases to stronger models; Ratings applies constrained ensemble voting; ReMoM gathers a quorum of reasoning attempts and then synthesizes; Fusion uses panel disagreement through judge/finalizer stages; Workflows executes bounded planner/worker/finalizer roles for SWE-like tasks. Auto routing on vllm-sr/auto is presented as task-shape optimization rather than “always bigger model,” with benchmark-specific recipe selection for GPQA-Diamond, LiveCodeBench, and Humanity's Last Exam. Scorecard results show closed-model routes matching or exceeding frontier baselines on those benchmarks, while hybrid variants are reported mainly for Humanity's Last Exam. The post closes by positioning routers as active infrastructure that decide when to route locally, escalate, enforce safety bands, and preserve one stable API surface. Commenters agree that this reframes the model API as a system boundary, but they also warn that the behavior may become harder to reason about and more opaque.

Sandia National Laboratory created internal IC design and manufacturing capability in the late 1970s to supply components unavailable commercially for weapons and space programs. The lab moved from a 10-micron 2-inch process in 1978 to 4-inch wafers with smaller geometries, then used that capacity to produce large quantities of spaceflight parts, including those for Galileo-era systems. Sandia converted the HMOS 8085 into a CMOS radiation-hardened SA3000, increasing transistor count from 6,500 to 18,000 and adding latchup control techniques, guard rings, and hardened processing on n-on-n+ epitaxial substrate. The resulting SA3000 and support chips operated from roughly 4.5 to 11 volts, retained compatibility for testing, and were rated for 1 million rads with about a 25 percent performance drop, and 3 million rads with about a 40 percent drop, above the 100,000-rad design goal. The family was paired with compatible controllers and memory-support parts and was used in mission-critical roles, including the W88 warhead altitude/fuze computing path on Trident II submarines. Ball Aerospace integrated versions in deep-space star tracking, and CRRES showed the rad-hard electronics survived environmental exposure even though mission life ended early due to battery failure. In 1984–85, government transfer of fab operations to Allied Signal introduced delays due to limited run experience. Harris commercialized the designs as HS1-80C85RH and HS9-80C85RH with lower speed and voltage classing, offering space and military-grade variants. Commenters note that modern hardened computing has shifted to multi-core POWER-based offerings such as MOOG and BAE RAD lines, signaling significant architectural change from this 8-bit generation.

Netflix replaced custom scheduling in its managed batch system, Compute Managed Batch (CMB), with Kueue to align its container platform Titus with newer Kubernetes-native abstractions and reduce bespoke maintenance burden. CMB had relied on a tenant hierarchy with reserved and shared capacity, priority queues, and non-preemptive fair-share behavior at admission time, which limited flexibility once workloads were admitted. The team selected Kueue because it could integrate without replacing Kubernetes scheduling, supported multi-tenant quotas across mixed hardware, and already provided features such as preemption, all-or-nothing placement, and topology-aware scheduling. During migration, called Netflix Batch, they preserved user-facing APIs, kept changes transparent, and avoided throughput regressions by first validating capacity behavior under high QPS, burst traffic, and group concurrency in production-like testing. Tenant migration was implemented by mapping internal and leaf tenants into Kueue cohorts, ClusterQueues, and LocalQueues, with quota and resource flavor conversion from existing capacity configuration, and rollout control was automated through a UI-based enablement flow with rollback support. The team started with the largest and most complex customer to de-risk edge cases, and completed production migration in about four weeks. Kueue is now fully deployed for millions of batch jobs, with added fair-sharing and preemption increasing utilization by letting unused reserved capacity be temporarily shared while allowing high-priority work to reclaim resources quickly.

Ornith-1.0 is presented as a family of open-source models for agentic coding, spanning 9B dense to 397B Mixture-of-Experts variants and built from Gemma and Qwen checkpoints. The release claims strong benchmark results, including 77.5 on Terminal-Bench 2.1 and 82.4 on SWE-Bench Verified for the 397B model, and reports that this model also exceeds the stated Claude Opus baselines on those two tests. The core method is a self-improving framework where the model jointly generates a task scaffold and solution rollout, then receives reward feedback for both, so it can evolve per-task orchestration strategies without fixed harness design. To reduce reward hacking, the authors describe a three-layer defense: a fixed trust boundary over tools and environment, deterministic monitoring with zero-reward exclusion for policy violations, and a frozen LLM judge as a verifier-level veto. Training also uses a pipeline-RL design with staleness-weighting to downweight older off-policy tokens in long rollouts. Evaluation spans Terminal-Bench variants, SWE-Bench (Verified, Pro, Multilingual), SWE Atlas tasks, NL2Repo, and ClawEval, with reported results showing the 35B and 9B variants outperforming or matching several much larger models on multiple tasks. The results imply gains for frontier-scale and smaller deployments, though coverage remains benchmark-specific and not directly validated on all real-world workloads. Comment feedback also reflects skepticism, emphasizing that benchmark dominance does not automatically prove broad operational reliability.

The post introduces JumpServer as an open-source privileged access management platform designed to centralize secure access for SSH, RDP, Kubernetes, database, and RemoteApp workloads through a browser. It is presented as a full stack with web UI, web terminal, multiple protocol connectors, database and remote application components, plus optional Grafana monitoring and enterprise connectors, and includes a quick-start script for 64-bit Linux servers with default admin credentials shown for initial access. The project is positioned as GPLv3-licensed, and contributors are invited to submit pull requests. Commenters broadly focused on security architecture rather than convenience, arguing that a single jump point can create a false sense of safety if perimeter controls, patching, and operating discipline do not improve. Several commenters compared it to traditional jump-box patterns and questioned whether browser-based access adds unnecessary abstraction for SSH workflows. They also questioned the perceived maturity of the stack, initial hardening defaults, and whether a broad component set could become a maintenance or trust liability.

EuroISPA submitted a new filing in the EU Copyright in the Digital Single Market review arguing that the current anti-piracy regime has not reduced infringement and that harm now comes mainly from enforcement failures, not a legal gap. The group says site-blocking practices in several member states have widened beyond ISPs to DNS resolvers and VPN providers, where technical limitations make overblocking more likely. It cites incidents including Piracy Shield in Italy blocking over 7,700 domains, a Portuguese hosting provider losing email for 16 days, and a LaLiga order in Spain allegedly affecting thousands of shared-IP services used by banking and developer platforms. EuroISPA also points to Cloudflare being fined 14 million euros for rejecting an Italian order, and notes OpenDNS being removed in France and Belgium after blocking demands, with Belgium reinstatement linked to appeal risk for future DNS-based precedent. The filing asks the Commission to apply EU enforcement law more strictly while requiring rightsholders to bear liability for collateral damage under existing IPRED mechanisms. It also opposes rapid-response blocking deadlines, saying 30-minute obligations in Italy burden small providers, and supports compensation mechanisms for overbroad blocks.