ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “compilers”

67 stories

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI tools & infra 28AI safety & security 22AI research 19Model release 8AI industry 7AI policy 2
SeverityAllcritical 0high 2medium 17low 0info 67

NVIDIA Announces CUDA Rust with cuda-oxide (SIMT) and cutile-rs (Tile) for Compile-Time-Safe GPU Kernels

NVIDIA launches CUDA Rust via open-source cuda-oxide (SIMT) and cutile-rs (Tile), bringing compile-time-safe Rust GPU kernels.

NVIDIA announced CUDA Rust, making Rust a first-class language for GPU kernels through two NVlabs open-source projects: cuda-oxide for the SIMT model and cutile-rs for the Tile model. Both use Rust's ownership and borrow checker to catch buffer aliasing bugs at compile time. cutile-rs is published on crates.io, runs on stable Rust 1.89+ with CUDA 13.3, and is already used in Hugging Face's Grout inference engine and mistral.rs; cuda-oxide is early alpha requiring nightly Rust, CUDA 12.x, and compute capability 8.0+. cuda-oxide compiles Rust MIR through the community Pliron IR framework and LLVM to PTX, while cutile-rs JIT-compiles kernels via CUDA Tile IR.

MarkTechPost · 8d agoAI tools & infra2

GPU-CFR: 80x Faster Counterfactual Regret Minimization by Compiling the Game to Static Dataflow and CUDA Graph Replay

GPU-CFR compiles counterfactual regret minimization into static dataflow with CUDA Graph Replay, achieving 29.8-80.4x speedups over prior GPU solvers.

The paper presents a compiler and runtime that turns any fixed game's CFR iteration into a static dataflow graph of flat arrays and precomputed indices, cutting framework operations by up to 18.1x. Because shapes and buffer addresses never change, CUDA Graph Replay records the iteration once and replays it with a single launch. On one A100 across an eight-game suite, GPU-CFR runs 29.8-80.4x faster than the fastest prior GPU CFR and 14-258x faster than the CPU implementation LiteEFG on the four largest games, while reproducing reference iterates bitwise on CPU.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research3· 1 read

Retrospectively Reverse-Engineering Apple's Neural Engine

A developer reverse-engineers Apple's M1 Neural Engine architecture, mapping compute cores, MAC datapaths, and schedulers to explain the NPU's decline as transformers displaced CNN workloads.

A developer who previously maintained a reverse-engineered Linux driver for Apple's Neural Engine (ANE) published a retrospective deep dive mapping the M1 ANE's full internal architecture: compute, datapath, scheduler, memory, and execution model. The M1 ANE has 16 compute cores with 128 FP16 (or 256 INT8) MAC lanes each, totaling 2048 parallel MAC lanes, using 32-bit Q16.16 fixed-point accumulation with FP16 readout and an accumulator that saturates at 2^15. The author argues the ANE's dataflow was architected around the predictable reuse patterns of 2017-era CNN workloads (dating to the A11 Bionic), which autoregressive transformer decode broke, limiting its usefulness for general ML. With Apple's M5 folding ANE cores into GPU cores to tout LLM performance, the post frames this as the beginning of the end for the standalone NPU.

Hacker News · AI · 5d agoAI researchHN 54↑ · 7 comments2

Google Research Introduces Retrieve-for-Train (R4T): An RL-Compiled Diffusion Retriever for 12× to 20× Faster Query Fan-Out

Google Research introduced R4T, an RL-trained fan-out pipeline distilled into a 53.9M-parameter diffusion retriever achieving 12x-20x faster query fan-out.

Google Research introduced Retrieve-for-Train (R4T), which trains a fan-out language model with GRPO plus soft PPO regularization, then distills query fan-out into a 53.9M-parameter diffusion transformer that generates all retrieval embeddings in a single non-autoregressive pass. A three-term reward (groundedness 0.6, diversity 0.2 via Vendi Score, alignment 0.2) prevents paraphrastic collapse and reward hacking during training. On the Polyvore dataset, Gemma3-4B R4T-FOLM averaged 49.1 versus 40.9 for Best-of-N, and the diffusion retriever cut fan-out latency from 1.46s to 0.07s at batch size 8, a consistent 12x-20x speedup over autoregressive methods.

MarkTechPost · 1h agoAI research

Hierarchical NeRF with JAX3D for Volumetric Rendering, Novel-View Synthesis, and 3D Reconstruction

MarkTechPost tutorial implements a hierarchical NeRF in JAX using jax3d volume-rendering primitives for novel-view synthesis and 3D reconstruction.

The tutorial builds an end-to-end hierarchical Neural Radiance Field using JAX, Flax, Optax, and jax3d's volume-rendering functions (sample_along_rays, volume_rendering, sample_piecewise_constant_pdf). It implements positional encoding, skip connections, separate coarse and fine networks, and view-direction conditioning with hierarchical importance sampling. Training uses JAX JIT compilation, Adam optimization, exponential learning-rate decay, and gradient clipping. Evaluation covers PSNR, depth and opacity visualization, 360-degree rendering, and marching-cubes geometry extraction.

MarkTechPost · 3d agoAI research

Inside NVIDIA’s cuDNN Graph API: Fusion, Autotuning, and Plan Reuse with cuDNN Frontend

MarkTechPost tutorial walks through NVIDIA's cuDNN Frontend graph API, covering kernel fusion, autotuning, plan reuse, and CUDA graph capture on Colab GPUs.

The tutorial explains how to express GPU computations as operation graphs via the cuDNN Frontend graph API, running the five-step build pipeline of validate, build operation graph, create execution plans, check support, and build plans. It progresses from a single fused convolution with bias and ReLU to autotuning across engine configs, FP8-style epilogues, attention, plan serialization, dynamic shapes, and CUDA graph capture. Each kernel is benchmarked against a PyTorch reference on a single Colab GPU to verify correctness and measure cost. The piece also covers practical setup issues like making libcudnn.so visible to the frontend's dynamic loader.

MarkTechPost · 1d agoAI tools & infra2

The AI graveyard: a running list of projects and startups that didn’t make it

TechCrunch compiles a running list of failed AI products and startups, including Relay, OpenAI's Sora, Humane AI Pin, Notion Mail, and Microsoft's Recall.

TechCrunch's 'AI graveyard' tracks notable AI products and startups that shut down or underperformed, citing S&P Global data that about 42% of AI initiatives are abandoned. Examples include the Relay automation startup, OpenAI's Sora video platform (shut March 2026), ChatGPT Atlas browser (discontinued August 9), Notion Mail (shutting September 22), and Apple's delayed Siri AI that contributed to a $250 million settlement. Hardware failures include the Humane AI Pin ($230 million raised, assets sold to HP for $116 million) and the Rabbit R1, which sold 100,000 units but received poor reviews. Microsoft's Recall feature remains controversial after a researcher demonstrated a tool extracting its captured data.

TechCrunch · AI · 1d agoAI industry1

Meta says it’s changing AI suggestions after posing invasive personal questions

Meta is fixing Meta AI suggested prompts after a viral video showed the chatbot compiling invasive questions about a user's children from her Facebook posts.

Meta said it 'missed the mark' and has fixed the issue after Instagram user Kalie Robins showed Meta AI suggesting 'Who is the child passenger?' beneath a video with her child and then piecing together details about her daughters from her and relatives' posts. The assistant also surfaced photos of her children, including one the user claims she deleted years ago. Meta AI is embedded in Facebook, Instagram, WhatsApp, and Messenger; in July the company pulled an Instagram user-deepfake feature after backlash.

The Verge · AIupdated · 5d agofirst · 5d agoAI industry 2 sources

Training a 3.8B LLM to 0.384 CORE for $998 – Hugo Vergnes

Independent developer Hugo Vergnes trained a 3.8B-parameter Llama-style model to 0.384 CORE on 65B tokens for $998 in 43 hours on rented B200s.

Hugo Vergnes trained little-lm, a 3.848B-parameter decoder-only LLM, on 65.3B tokens in 43 hours for $998 using rented NVIDIA B200s, scoring 0.384 on the CORE benchmark and beating nanochat d32 (0.310) at similar cost. The Llama-style architecture uses RMSNorm, RoPE, GQA with 24 query and 8 KV heads, relu-squared MLPs, QK-norm, and ResFormer-style value embeddings that account for 19% of parameters. Key wins included the Muon optimizer for matrix parameters, a trapezoidal learning-rate schedule with linear cooldown, FP8 training plus vocabulary padding for roughly 33% throughput gains, and the ClimMix dataset over FineWeb-Edu. The project, inspired by Karpathy's nanochat, was built as a config-driven YAML framework for small LLM training.

Hacker News · security · 7d agoAI researchHN 28↑ · 2 comments1

The VMs Powering Mobile Agents (Instinct, Claude Code)

A teardown reveals Claude Code runs in Firecracker microVMs with a Rust PID 1 and MITM'd egress, while Instinct rents E2B sandboxes with git-based memory.

The author inspects the virtual machines hosting cloud agents: Claude Code runs in a Firecracker microVM with a custom Rust init (process_api) as PID 1, a 324 MB Bun harness on a read-only disk, and 443-only MITM'd SSE egress to api.anthropic.com with host-rotated OAuth tokens and no inbound access. Instinct rents E2B sandbox-as-a-service Firecracker microVMs (Ubuntu 22.04, 2 vCPU, 1.9 GB RAM) where agent memory is a git repo of Markdown committed by the agent and pushed to S3 as a single bundle, using short-lived STS credentials. Both platforms rely on Firecracker, differing mainly in fleet operator and guest boot configuration.

Hacker News · AI · 9d agoAI tools & infraHN 58↑ · 19 comments1

Viggle/Viggle-Animate — new model trending #28 on Hugging Face

Viggle released Viggle-Animate, a 33.1B MiniMax-H3 finetune replacing video characters from one repainted frame, rendering 124 frames in 26 seconds on one GPU.

Viggle-Animate replaces the character in a video using only a driving video and one of its own repainted frames, with no pose estimator, segmentation mask, face tracker, or text encoder. It is a 33.1B full finetune of MiniMax-H3's ref2va transformer, jointly distilled with DMD across two teachers split by noise level, so rendering takes three forward passes per clip. On a B200 GPU it renders 124 frames in 26 seconds, 6.1x faster per clip than Wan2.2-Animate-14B in matched comparisons. The method assumes no person-specific representation, so it generalizes beyond humans; a demo, research write-up, and ComfyUI nodes are available.

Hugging Face trending models · 16d agoModel release1

[AINews] Jev: a “System One Model” that only decides/classifies/routes/scores — >100x faster, >200x cheaper than small frontier LLMs

TypeSafe launches Jev, an RLCD-trained decision model claiming 20-200x faster, 40-400x cheaper classification than frontier LLMs, alongside Gemini 3.8 Live and Neon.

TypeSafe's Jev is a 'System One' decision model trained with RLCD, claiming 20-200x faster and 40-400x cheaper classification and routing than frontier LLMs with free output tokens and no hallucinated text. Google launched Gemini 3.8 Live and 3.8 Live Extended Thinking, supporting 97 languages and async tool calls, debuting #1 on Artificial Analysis' speech-to-speech index at 82.6. Periodic Labs' Neon is a ~1T-parameter XRD analysis model trained with RL on proprietary lab data using 1,300 H200s, lifting FrontierXRD success from 2.7% to 55.3% and beating GPT-6 Astra at lower inference cost.

Latent Space · 21h agoModel release1

harshatheg/Qwen-2.5-1B-RLCD — new model trending #30 on Hugging Face

A community MLX inference engine evaluates constrained JSON schema fields in parallel on Apple Silicon, reporting 5.6-7.0x latency speedups with guaranteed schema validity.

The repository harshatheg/Qwen-2.5-1B-RLCD appeared at #30 on Hugging Face trending, but its content describes Parallel Constrained Decoding, an MLX-based inference engine for structured extraction and classification on Apple Silicon Macs. Benchmarked with mlx-community/Qwen2.5-1.5B-Instruct-4bit on an M4 Max, it reports 5.6x-7.0x latency reductions (e.g., 1,900 ms to 270 ms for a 28-field support triage task) with 100% syntactic validity and calibrated field-level probabilities. The engine prefills a single KV-cache, broadcasts it across all schema fields, and slices logits to valid candidate tokens for enum fields with up to 255 choices.

Hugging Face trending models · 1d agoAI tools & infra

Evaluating Verified Autonomy in Quantum Engineering

Quantum-Harbor lab and QIQCBench (49 tasks) expose wide performance gaps across 17 frontier agentic systems in verified quantum engineering.

Researchers built Quantum-Harbor, a virtual laboratory providing a controlled execution environment where scientific AI agents interacting with quantum systems can have both actions and conclusions directly verified. QIQCBench contributes 49 expert-authored tasks spanning calibration and control, error correction and compilation, and sensing and networking. Across 17 frontier agentic systems, verified performance varied widely, exposing a substantial gap between demonstrated capability and reliable autonomous operation.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

What execs and politicians are saying about slowing down AI development

Dario Amodei's 'pace the frontier' safety essay drew support from Altman and Hassabis and pushback from Trump and Vance over AI regulation.

Anthropic CEO Dario Amodei published an essay 'We Must Pace the Frontier' proposing embedded third-party safety evaluators, coordination among frontier labs in democratic countries, and global pacing agreements. Sam Altman endorsed pacing and independent evaluators and welcomed a federal frontier AI safety framework, while Demis Hassabis and Elon Musk also voiced support. President Trump rejected any AI slowdown, citing competition with China, and Vice President JD Vance called industry requests for regulation a 'trojan horse'. Anthropic says it is unilaterally committing to the first step of embedding third-party evaluators.

The Verge · AI · 2d agoAI safety & security

Recurrent GraphNeural NetworkswithSet-BasedAggregation

Paper proves two-directional equivalence between recurrent GNNs with set-based aggregation and Boolean closure of reachability/safety properties in modal mu-calculus, checkable from weights.

The authors study recurrent graph neural networks with set-based aggregation and identify sufficient conditions, checkable directly from network weights, for compiling networks into logical formulas and formulas into networks. They establish an effective two-directional equivalence with the Boolean closure of reachability and safety properties, the fragment BΣ°1 of the modal μ-calculus, shown to be the exact expressive level of stabilization over finite vocabulary. The correspondence needs no counting logic, external halting signal, or non-effective acceptance condition, yielding a verifiable path from weights to symbolic explanations.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

OpenAI just wants to win

OpenAI says roughly 10,000 agents and tens of millions in compute solved the Navier-Stokes Millennium Prize problem in 88 hours, amid controversy.

OpenAI claims an advanced unreleased model, run with about 10,000 agents and tens of millions of dollars of compute for 88 hours, produced a solution to the Navier-Stokes problem, one of seven $1 million Millennium Prize problems set by the Clay Mathematics Institute in 2000. NYU professor Tristan Buckmaster, who was pursuing the problem with Anthropic researcher Levent Alpöge, accused OpenAI of racing his team and of possibly benefiting from his Codex prompts; OpenAI categorically denied both. OpenAI researcher Sébastien Bubeck acknowledged offering Buckmaster compute and authorship arrangements, which Buckmaster characterized as a bribe, while many mathematicians expressed unease at OpenAI's competitive conduct.

The Verge · AI · 4d agoAI industry 2 sources2

ASTRIL-MPC: Autonomous Traversal Framework of Articulated Tracked Robots with Language-Guided Neural-Kinematic MPC

ASTRIL-MPC combines learned kinematics, NMPC, and LLM-guided safety-checked retuning for articulated tracked robot traversal in search-and-rescue.

ASTRIL-MPC is a language-guided neural-kinematic model predictive control framework for autonomous traversal of articulated tracked robots in urban search and rescue. A learned kinematics model predicts short-horizon task-state increments, NMPC plans with feasibility constraints, and an LLM proposes bounded, safety-checked updates to weights and bounds. The compiled predictor enables a full control cycle within 100 ms, improving traversal-quality scores by up to 71% over non-adaptive NMPC and 67% over a PPO baseline while eliminating measurable collision impacts.

arXiv cs.AI / cs.LG / cs.CL · 5d agoAI research

Agnes-AI/Agnes-3.0-Flash — new model trending #30 on Hugging Face

Agnes AI releases open-weight Agnes-3.0-Flash Preview, a 33B multimodal model with 262k-token context under Apache 2.0.

Agnes AI released Agnes-3.0-Flash Preview, an open-weights multimodal checkpoint with 33B parameters and a 262,144-token context window under Apache 2.0. The model supports text, image, and video understanding, tool calling, and adjustable reasoning effort. The repo clarifies this preview checkpoint is distinct from the production/API Agnes 3.0 Flash model, which uses a different configuration with a 1M-token context window. Reported reference results include IFBench 74.20 and SciCode 38.08 against peers such as Qwen3.6-35B-A3B, Kimi K2.5, and MiniMax M3.

Hugging Face trending models · 5d agoModel release

NVIDIA Details BioNeMo Inference Runtime (BioIR): 2.90x Higher Boltz-2 Folding Throughput and 58.5K Residues per GPU-Hour on 8xH100

NVIDIA released BioNeMo Inference Runtime (BioIR), an open-source PyTorch-compatible library delivering 2.90x higher Boltz-2 protein-folding throughput on 8xH100 GPUs.

NVIDIA detailed BioIR, a Python library that accelerates Boltz-2, OpenFold2, and OpenFold3 structure-prediction inference on NVIDIA GPUs while preserving standard PyTorch workflows. On a matched benchmark of 1,000 human dimers on 8xH100 80GB GPUs, BioIR delivered 58.5K folded residues per GPU-hour versus 20.2K for a torch.compile baseline, a 2.90x throughput gain. BioIR already powered the AlphaFold Database expansion, generating about 31 million candidate complexes across 4,777 proteomes, with 1.81 million released as high-confidence predictions. Extrapolated to 1 million targets, estimated folding energy drops from 35 MWh to 11 MWh at 8-GPU TDP equivalents.

MarkTechPost · 6d agoAI tools & infra1

Why the current tech backlash feels different

The Verge's Decoder mailbag discusses the current tech backlash, arguing AI hype overstates verifiability outside software engineering.

Nilay Patel's Decoder mailbag episode addresses listener feedback on the widely discussed 'software brain' essay. He argues AI hype is concentrated on software because code is verifiable through compilation, while domains like drug discovery, math and science lack equivalent verifiability. The episode also touches on AI backlash, surveillance, data centers and upcoming midterm coverage.

The Verge · AI · 6d agoAI industry1

[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded

OpenAI-linked accounts claim roughly 10,000 AI agents produced a Navier-Stokes singularity result in 88 hours, pending mathematical verification.

OpenAI-affiliated accounts claim a system of roughly 10,000 agents, trained over about a year with multi-agent reinforcement learning, produced a finite-time singularity result related to the Navier-Stokes Millennium Problem. The claimed 88-hour runtime and 130B-token cost circulate only via social posts, and no preprint, theorem statement, or proof artifact is available. Acceptance by the mathematics community is unresolved, so the claim's epistemic status remains unknown. The roundup also notes Cognition's $48B and Mistral's $24B fundraises, GPT Image 2.5, and Meta's Muse agent relaunch.

Latent Space · 8d agoAI research1

Programmable World Model

Programmable World Model decouples executable world-state evolution from video generation, reaching 94% Count Accuracy and 98% State Accuracy on new CombatStateBench.

An agent translates natural-language instructions into executable programs specifying entity states and transition rules, executed by a lightweight engine that maintains an explicit, persistent global world state including off-screen entities. State-augmented 3D oriented bounding boxes are deterministically compiled into pixel-aligned spatiotemporal conditioning signals for a pretrained video model acting as the generative renderer. On the new CombatStateBench benchmark it achieves 94% Count Accuracy and 98% State Accuracy, substantially outperforming existing interactive video world models.

Hugging Face daily papers · 8d agoAI research

Claude Mythos AI Autonomously Executes Full Cyber Kill Chain Without Human Guidance

Booz Allen's benchmark found Anthropic's Claude Mythos was the only tested model to autonomously complete a full cyber kill chain to domain administrator control.

Booz Allen assessed 18 US and Chinese models as autonomous attackers against a production-grade enterprise network, measuring actions via network and host telemetry. Claude Mythos scored 80 on the Cyber Weapon Index (74 vulnerability research, 86 kill-chain attainment), moving from a stolen employee credential to administrator-level control in every credentialed attempt. Only frontier Anthropic models identified the previously unseen flaw in compiled software, and only Claude Mythos exploited it; the report notes a harness paired with Claude Sonnet could rival Claude Mythos. The result is a controlled benchmark, not evidence of a real-world campaign or victim breach.

Cyber Security News · 8d agoAI safety & security1

Ask HN: How do you manage skills files?

A Hacker News thread debates whether agent skill files are worth managing, citing 2–4x output-token reductions on flagship models in one company's testing.

Commenters argue skills are stored prompts that help less-technical users compensate for weak prompting, while one participant reports company testing found skills reduce flagship-model output tokens by roughly 2–4x, a gap growing with newer models. Others note skills can bundle reusable scripts and inline commands for deterministic context building, and that harnesses now execute backticked commands before the agent sees the skill. Some argue improving model capability makes downloadable skills redundant.

Hacker News · security · 10d agoAI tools & infraHN 303↑ · 271 comments1

Diffs vs. Whole Files: An Empirical Comparison of Iterative Edit-Based and Direct Generation for Flutter/Dart Code Models

Empirical study finds direct whole-file generation beats iterative diff-based editing for Flutter/Dart code models on about 1,790 held-out tasks.

Researchers trained Rainbow-Pony-100M from scratch and fine-tuned Qwen2.5-Coder-0.5B in both direct-generation and diff-based regimes, then evaluated four resulting models on roughly 1,790 Flutter/Dart tasks. Direct generation outperformed diff-based generation on compilation pass rate, bits-per-byte, character-level similarity, and blinded LLM-judge ratings. Diff-based editing is competitive only on short, localized edits in refactoring and error-handling tasks, a property the authors call task locality.

Hugging Face daily papers · 12d agoAI research1

MaxKernel: Agentic Kernel Generation for TPUs

Researchers open-source MaxKernel, a multi-agent LLM system that generates and optimizes TPU kernels matching expert hand-tuned baselines on JaxBench.

MaxKernel is a multi-agent system offering three paradigms for TPU kernel development: human-in-the-loop collaborative design, a fully autonomous metric/trace-driven optimization loop, and graph-based autonomous search for global exploration. All paradigms draw on a shared pool of specialized sub-agents for planning, implementation, self-debugging, testing, and hardware profiling. Evaluated on JaxBench's 50 diverse TPU kernel tasks and real-world workloads from open-source models, it consistently matches expert hand-tuned baselines. The system is open-sourced via the AI-Hypercomputer GitHub repository.

Hugging Face daily papers · 14d agoAI tools & infra1

OpenVDN/vdn-minimax-h3 — new model trending #12 on Hugging Face

OpenVDN releases VDN-H3, an open hybrid-attention video model on MiniMax H3 that renders a 14.4-second 768p clip in 11.23 seconds on 8 B200 GPUs.

VDN-Minimax-H3 (VDN-H3) adds a frame-wise linear attention branch plus two LoRA adapters to MiniMax H3, distilled into 8-step and 50-step variants. It generates 768p, 14.4-second clips in 11.23 seconds on 8 B200 GPUs (90.5 seconds on one H200) using 8 denoising steps. Weights (about 82 GB total, including the 72 GB H3 base), the optimized inference stack, and training code are fully open-source under the MiniMax H3 Community License, which excludes the EU, UK, Korea, and US.

Hugging Face trending models · 15d agoModel release1

The Regulators Already Assume You Have an AI Inventory. Do You?

Checkmarx argues regulators now expect organizations to maintain an AI inventory as AI-generated code and outputs enter security workflows.

Checkmarx contends that implicit trust in AI-generated code, AI summaries, and scanner output has become a governance liability that regulators no longer accept. The piece argues security teams must formalize AI inventories and treat AI outputs as untrusted inputs. It frames AI governance as an emerging compliance expectation rather than an internal maturity project.

Checkmarx · 21d agoAI policy1