ZeroHour

Search: “c”

184 stories

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

Implementation of Machine Learning Workflows with NVIDIA cuML, RAPIDS, GPU Benchmarking, Explainability, Clustering, and Model Inference

Hands-on tutorial implements NVIDIA cuML and RAPIDS to GPU-accelerate scikit-learn-style ML workflows with benchmarking, clustering, and inference.

The tutorial demonstrates NVIDIA cuML as a GPU-accelerated machine learning framework, using cuml.accel to speed up unmodified scikit-learn scripts with zero code changes and the native cuML API for CuPy/cuDF interoperability. It benchmarks CPU versus GPU implementations of PCA, K-Means, nearest-neighbor search, logistic regression, random forests, and DBSCAN on datasets up to 200,000 samples with 64 features. It also builds GPU pipelines with UMAP, t-SNE, and HDBSCAN, validates GPU-generated SHAP explanations, uses the FIL library for forest inference, and covers model serialization and GPU/CPU portability.

MarkTechPost · 3d agoAI tools & infra

Cognition launches new SWE-2 model, Rivaling Fable 5.1 and GPT-Astra

Cognition released SWE-2, a coding model post-trained from Kimi K3 that scores 50.0% on FrontierCode 1.1 Main, near Fable 5.1 at 64% lower cost.

Cognition introduced SWE-2, its most advanced coding model, post-trained from the 2.8T-parameter Kimi K3 base model. It achieves 50.0% on FrontierCode 1.1 Main, 73.0% on DeepSWE 1.1, and 92.8% on Terminal-Bench 2.1, beating Grok 4.6 and SWE-1.7 while matching Fable 5.1 and GPT-5.6 Sol at a fraction of the price. The company says it scaled reinforcement learning to the multi-trillion-parameter regime for the first time, using Pareto-informed cost penalties that train all reasoning-effort levels in a single run, tripled RL environments, and NVFP4/FP8 quantization-aware training. SWE-2 is available today in Devin Desktop and CLI, with rollout on Devin Web and Fusion.

Hacker News · AIupdated · 4d agofirst · 6d agoModel release 11 sourcesHN 58↑ · 15 comments1

C*: Unifying Programming and Verification in C

Research paper C* (arXiv:2504.02246) proposes unifying programming and formal verification in C, discussed on Hacker News.

The arXiv paper 2504.02246, titled C*: Unifying Programming and Verification in C, presents an approach that combines C programming with built-in formal verification. The item surfaced via Hacker News, where it reached 28 points and 18 comments. Detailed abstract content was not included in the source text.

On APN Functions with Boomerang Uniformity One over $\mathbb F_{3^n}$: Differential and Boomerang Spectra and CCZ-Inequivalence

Cryptographic construction yields infinite APN function families with boomerang uniformity one over odd-characteristic fields, proving CCZ-inequivalence to power functions.

For q=3^n with odd n>1, every sign-switch of a perfect nonlinear Dembowski-Ostrom polynomial is proven APN with boomerang uniformity one or two, attaining uniformity one for (q-3)/2 parameters. This gives the first general construction of infinite APN families achieving boomerang uniformity one over odd-characteristic finite fields. The authors determine common differential and complete boomerang spectra, ruling out CCZ equivalence with power and Ness-Helleseth binomials, and exhibit three pairwise CCZ-inequivalent PN functions for infinitely many n, with the smallest degree n=45.

arXiv cs.CR · 8d agoResearch

Saving Jet Fuel

Tutorial optimizes flight paths to cut jet fuel costs using open-source Scikit-decide planning framework and OpenAP aircraft performance models.

A technical walkthrough demonstrates wind-aware flight path optimization using Scikit-decide, an open-source framework for reinforcement learning and automated planning, paired with OpenAP fuel-consumption models built by Dr. Junzi Sun at TU Delft and NOAA wind data. A Boeing 787-9 flying EWR to FCO can require roughly $68K in fuel, and adjusted routing could save thousands. The post uses Python 3.12, DuckDB with spatial extensions, and QGIS for map rendering.

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

DavidAU/Qwen3.8-27B-TURBO-Fable-Cold-Fusion-735-882-Heretic-Uncensored-NEO-CODER-MAX-MTP-GGUF — new model trending #8 on Hugging Face

A new Qwen3.8-27B GGUF fine-tune claims ARC-C 735 at 8-bit with thinking tokens cut 2x-10x versus the base model.

Independent creator DavidAU released a GGUF fine-tune of Qwen3.8-27B built with Unsloth, claiming ARC-C of 735 at 8-bit and 719 at 4-bit, trending #8 on Hugging Face. The 'TURBO' variant cuts thinking tokens by one half to as much as one tenth while retaining output quality and detail. The repo ships both regular and MTP quants and claims gains over the base model across seven benchmarks, using 'Cold Fusion (GAIN + Unsloth)' and 'Fable Fusion 711' training methods.

Hugging Face trending models · 15d agoModel release

Hillingar - MirageOS Unikernels on NixOS

A technical write-up details Hillingar, enabling reproducible Nix-based builds and NixOS deployment of MirageOS OCaml unikernels such as authoritative DNS servers.

This blog post (published December 2022, updated February 2025) describes Hillingar, work from the author's master's thesis enabling reproducible builds and deployments of MirageOS OCaml unikernels using Nix and a custom NixOS module, demonstrated with an authoritative DNS server. MirageOS unikernels embed application and low-level OS code in a single kernel, allowing dead-code elimination that reduces attack surface and improves efficiency. The post covers challenges such as solving opam dependency version constraints when linking a single dependency set.

Lobsters · security · 12d agoTools1

Compiler Can Undo Your Security Checks

Chris Domas explains at Black Hat how legal compiler optimizations can strip security checks and memory-clearing operations, turning secure C source into vulnerable binaries.

David Bombal interviews researcher Chris Domas at Black Hat USA 2026 about how the C abstract machine permits compilers to legally transform code in ways that remove security protections, delete memory-clearing operations, and introduce time-of-check to time-of-use vulnerabilities. Factors like register pressure, structure layout, and data size affect vulnerability, with examples where 17 or 33 byte buffers are safe while nearby sizes produce vulnerable code. An AI-assisted analysis of 500 million lines of open-source code identified 300 potentially dangerous patterns. Recommended mitigations include enabling compiler warnings, using sanitizers, analyzing optimized builds, and testing the exact binary that ships.

When the Whole Company Adopts AI: What It Does to Your SOC

Analysis of 16.9 million SOC alerts finds AI-related alerts at 0.43%, growing 685% since February, with 94.1% noise and 0.02% real attacks.

A review of roughly 16.9 million SOC alerts found about 73,000 (0.43%) were AI-related, a share that grew 685% between February and June 2026. Of AI-related alerts, 94.1% were noise, 5.8% genuine risks, and 0.02% real attacks; 79.8% received benign verdicts, 81.7% were automatically suppressed, and only 5.4% reached a human analyst. The only confirmed attacks were phishing campaigns that weaponized AI brand names as lures, while developer coding agents spawning shells and reading credential stores routinely tripped detections written before AI agents existed.

The Hacker News · 4d agoResearch1

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

[AINews] Andrew Ng gets into AI Engineering

Andrew Ng relaunches DeepLearning.AI around AI Engineering, defining four core skills from an analysis of 10,000+ job postings and expert interviews.

Andrew Ng, cofounder of Google Brain and Coursera, relaunched DeepLearning.AI with a focus on AI Engineering, basing the curriculum direction on an analysis of over 10,000 job postings plus interviews and surveys. He identifies four key skills: building and deploying AI applications, software engineering fundamentals, effective use of coding agents, and shaping the build with product sense. The Latent Space AI News issue also recaps agent ecosystem developments, including NVIDIA's 'Skill Lift' evaluation proposal showing skill scan scores correlate only weakly (Spearman rho = 0.14) with judged quality, and Konwinski's open-source persistent-agent 'microharness' Headlong, which achieved an unattended self-debugging repair in 48 minutes.

Latent Space · 22d agoAI industry1

Unmasking Cloud Identities: From Behavioral Clustering to Automated Detection

Unit 42 clusters behavior of 40,000+ AWS identities from 125 cloud environments to map functional roles and enable lightweight SQL-based detection.

Palo Alto Unit 42 built an unsupervised behavioral clustering model using UMAP and HDBSCAN on AWS CloudTrail logs to map cloud identities to functional roles such as administrators, backup services, security tooling and DevOps. The study analyzed over 40,000 identities across 125 cloud environments over two months. The researchers show that heuristics extracted from the clustering map can be implemented in standard SQL, enabling role classification at scale without running a continuous ML pipeline. The methodology extends to audit logs from other cloud providers, SaaS and Kubernetes.

Palo Alto Unit 42 · 2d agoResearch

How well do agents use test/verification techniques?

Dan Luu's eval finds coding-agent testing instructions (TDD, formal methods, PBT, skills) mostly fail to beat defaults on Zstd implementation correctness.

The author ran 26 prompt conditions plus 4 skills on a Zstd-in-Rust implementation eval using codex with GPT-5.6, testing TDD, fuzzing, property-based testing, formal methods (Lean 4, TLA+, Verus, Kani, SMT solvers) and community skills. Nothing dramatically outperformed the default no-instruction condition, which did above average; at xhigh effort, fuzzing and PBT conditions did slightly better than formal methods. Pre-registered predictions included TDD underperforming and popular test skills (ECC, Hegel, Trail of Bits) not outperforming. Results are averages of 80 runs per condition plotted against cost.

AMD security advisory (AV26-879)

Canadian Centre for Cyber Security advisory AV26-879 lists vulnerabilities across AMD EPYC, Ryzen, Threadripper, Instinct, and embedded processors, urging updates.

The September 3, 2026 advisory states AMD is affected by processor vulnerabilities as of September 2, 2026, spanning 2nd-4th Gen EPYC, Ryzen 3000-7045 series, Athlon, Threadripper, Radeon PRO V620, Instinct MI300A, and embedded product lines. It specifies required microcode package versions for each affected family and encourages users and administrators to review AMD's links and apply updates as they become available.

Canadian Centre for Cyber Security · 13d agoAdvisory

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

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

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Thelio Mira AI Linux Workstation: 192 GB GPU Memory

System76 launches the Thelio Mira AI Linux workstation from $3,299 with dual NVIDIA RTX Pro 6000 GPUs and 192 GB GPU memory for local AI workloads.

System76's Thelio Mira AI is a locally built (Denver, Colorado) Linux workstation for AI training, fine-tuning, and inference, starting at $3,299. Configurations go up to a 16-core AMD Ryzen 9000 CPU, 192 GB DDR5 RAM, and dual NVIDIA RTX Pro 6000 Blackwell GPUs delivering 192 GB of (ECC) GPU memory with liquid cooling, dual PCIe 5.0 x16 slots, and up to three M.2 NVMe drives. It ships with Pop!_OS 24.04 LTS or Ubuntu and is positioned as a way to avoid recurring cloud GPU costs.

AI research startup Listen Labs scrubbed a $1.5B funding round for Salesforce talks

Listen Labs abandoned a signed $125M Series C term sheet at a $1.5B valuation amid acquisition talks with Salesforce at roughly $2 billion.

Listen Labs, a three-year-old voice AI market research startup with about $30 million in annualized revenue, signed a term sheet for a $125 million Series C led by Menlo Ventures at a $1.5 billion valuation but walked away before closing. The financing likely collapsed due to acquisition talks with Salesforce at around $2 billion, though no deal is finalized. Competitor Simile recently closed a $200 million Series B at a $2 billion valuation, resetting benchmarks for the sector. Listen Labs' customers include Microsoft, Canva, Anthropic, and Sweetgreen.

TechCrunch · AI · 7d agoAI industry

Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification

Mathematical paper constructs counterexamples on c0 and l1 disproving Rockafellar's conjecture that sums of maximally monotone operators remain maximally monotone.

The authors build counterexamples where two maximally monotone operators satisfy the interior-domain condition yet their sum is not maximally monotone, refuting Rockafellar's sum conjecture. One counterexample is constructed on c0 and another on l1 with its usual norm. A general construction theorem computes the monotone polar of a class of graphs, gives necessary and sufficient conditions for maximal monotonicity, and shows how a positive rank-one perturbation yields a nonmaximal sum.

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

Proximity Gaps for Gabidulin Codes and Applications

Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.

The paper proves every linear rank-metric code admits a proximity gap for deltas up to (d-1)/(3n) with error at most q^(e+1)/q^m, and improves the gap to (d-1)/(2n) for Gabidulin codes with error at most 10q^(n-1)/q^m, matching bounds for Reed-Solomon codes. A constructed infinite family of constant-rate Gabidulin codes shows the (d-1)/(2n) bound is tight, and a counterexample establishes a lower bound on the error at the d/(3n) gap. Applications include an IOPP for interleaved Gabidulin codes adapted from the Ligero IOPP and a q-linearized polynomial commitment scheme adapted from Ligero-based PCS, reportedly the first PCS framework based on rank-metric codes.

arXiv cs.CR · 7d agoResearch

Lovable CTO: The Future of SaaS Is Apps That Agents Can Use

Lovable pivots from app building to exposing app functions as agent-callable capabilities via hosted MCP servers, raising a $400M Series C at a $13.3B valuation.

Lovable CTO Fabian Hedin outlined a strategy of turning published applications into agent-accessible capabilities by exposing selected functions as tools through a hosted MCP server, usable from ChatGPT, Claude, and other MCP-compatible clients. The company reports surpassing a $500M annualized revenue run rate, more than 60 million projects created, over 900 million monthly visits to Lovable-built apps, and usage by employees at nearly two-thirds of the Fortune 500. Menlo Ventures led a $400M Series C this month alongside EQT's Scaleup Europe Fund, valuing the company at $13.3 billion. Lovable evolved from the open-source GPT Engineer tool, became a commercial product in November 2024, and now competes with platforms like Vercel in AI-generated software hosting.

Latent Space · 21d agoAI industry

You don’t have to join the hack-back program to inherit its risk

A new US presidential memorandum creates a vetted private hack-back program, leaving participating vendors and their customers with untested legal liability and collateral risks.

The August 12 National Security Presidential Memorandum directs the National Coordination Center, run jointly by DOJ and DHS, to approve covert surveillance and disruptive Cyber Effects Operations by vetted private companies, with a forfeitable bond of at least $1 million required as a contract condition. The analysis argues the criminal shield rests on an untested reading of the CFAA exemption at 18 U.S.C. 1030(f), with no civil safe harbor, no state-law preemption and no foreign-law protection. Non-participating organizations can still inherit risk through shared infrastructure collateral damage, lack of customer disclosure, Lloyd's bulletin Y5381 state-backed attack exclusions, and threat-intelligence pipelines feeding offensive proposals.

CSO Online · 15h agoPolicy & legal

Agent Harness vs Agent Framework vs MCP: Which Layer Owns the Loop, State, Tools, Permissions, and Recovery

Architecture explainer separates agent harnesses, frameworks, and MCP by which layer owns the loop, state, permissions, and recovery.

The article distinguishes agent harnesses (OpenAI Codex, Claude Agent SDK), which own the execution loop, sandbox, permission model, and recovery; frameworks (LangGraph, OpenAI Agents SDK, Microsoft Agent Framework), which supply composable primitives; and MCP, a stateless JSON-RPC wire protocol governed by the Linux Foundation's Agentic AI Foundation since December 2025. An ownership matrix maps the execution loop, state, tool transport, permissions, recovery, sandboxing, and multi-agent orchestration to each layer. The 2026-07-28 MCP specification made the protocol fully stateless, retiring the initialize handshake and session headers.

MarkTechPost · 2d agoAI research1

Due to concerns about malicious applications, GPT2 will not be released (2019)

OpenAI's landmark 2019 GPT-2 post withheld the full 1.5B-parameter model over misuse concerns, releasing only a smaller variant and paper.

OpenAI announced GPT-2, a 1.5-billion-parameter transformer language model trained on 8 million web pages (40GB of text), achieving state-of-the-art zero-shot results including 70.70% on Winograd Schema and 63.24% on LAMBADA. Citing concerns about malicious applications such as scalable synthetic disinformation, OpenAI declined to release the trained model and instead published a smaller model and a technical paper as a 'responsible disclosure' experiment. The post, resurfaced on Hacker News in 2026, also documents failure modes like repetition and world-modeling errors, and discusses policy implications of controllable text generation.

Claude Fable 5.1 Solves the Cyphral Distich, a 370-year-old cipher

Claude Fable 5.1 solved Sir Thomas Urquhart's 370-year-old Cyphral Distich cipher, recovering a hidden royalist prayer for Charles II.

Vals AI reports that Claude Fable 5.1 solved the Cyphral Distich, a 64-number cryptogram from Sir Thomas Urquhart's Logopandecteision unsolved since 1653, in 44 minutes using 176k tokens with no human hints. The key insight was that the cipher's key was the book itself: each number indexes a word in the corresponding Proquiritation, taking the first letter, yielding 'O GOD UPHOLD KING CHARLS THE SECOND AND MAKE HIM THE SUPREME RULER OF THIS LAND'. The model also deciphered the larger Cyphral Octastich (285 numbers) from The Jewel (1652) using page-based word indexing, recovering all but nine letters of a royalist prayer. The puzzle had been listed among Klaus Schmeh's Top 50 unsolved encrypted messages.

Hacker News · AI · 3d agoAI researchHN 63↑ · 6 comments1· 1 read

A Princeton Researcher Proposes Recurrent Looped Transformer (RLT) that Carries Decoder State across Every Token, Fixing 96 Blocks per Token with Unbounded Temporal Depth

Princeton researcher Yifan Zhang proposes Recurrent Looped Transformer, carrying full decoder state across every token for unbounded temporal depth.

Yifan Zhang's technical report defines the Recurrent Looped Transformer (RLT), pairing a causal encoder with a recurrent decoder whose final output and layerwise sliding-window attention cache carry into every subsequent token with no prompt-response boundary reset. The reference configuration ties 48 encoder and 48 decoder layers, executing 96 logical blocks per token while the state path grows to 48t blocks after t tokens at fixed per-token compute. The report details RL replay contracts that rebuild all states under current parameters and exact prefix snapshots for multi-turn serving, but explicitly reports no measured efficiency, reasoning quality, or scaling results.

MarkTechPost · 3d agoAI research1

Cognition Releases SWE-2: A Kimi K3 Post-Trained Coding Model That Matches Fable 5.1 on FrontierCode at 64% Lower Cost

Cognition released SWE-2, an RL post-trained coding model from Kimi K3, scoring 50.0% on FrontierCode 1.1 Main and available only inside Devin.

Cognition released SWE-2, its most capable coding model, post-trained with reinforcement learning from Moonshot AI's 2.8T-parameter Kimi K3 base. It scores 50.0% on FrontierCode 1.1 Main, within 1 point of Fable 5.1 at 64% lower cost, and RL reportedly adds 5-6 points over the K3 base on many benchmarks. It is the first Cognition model with selectable reasoning-effort levels all trained in a single RL run using Pareto-slope-matched cost penalties. There are no open weights and no standalone API; it runs only inside Devin (Desktop, CLI, with Web and Fusion rolling out), free for paid tiers through October 10, 2026.

MarkTechPost · 4d agoModel release1

I spent $4,000 on a robot dog from China

Hands-on review finds the $4,017 Unitree Go2 Pro robot dog affordable but impractical, as Unitree reaches a $34 billion valuation after its IPO.

Ars Technica reviewed the Unitree Go2 Pro quadruped, purchased for $4,017, finding it astonishingly cheap but of limited practical use; it collapsed from battery drain and heat (84°C internal temperature) on an uphill walk at 87°F. Unitree democratized quadruped research, sells humanoid robots from $13,500, and debuted on the Shanghai stock exchange on August 19 with shares rising over fivefold on day one, valuing the company at $34 billion. Its robots now face legal restrictions in the United States, and it competes with Boston Dynamics, whose Spot starts around $75,000.

Ars Technica · AI · 4d agoAI industry

ukisai/Swift-Qwen3.8-27B-GGUF — new model trending #30 on Hugging Face

UkisAI released Swift-Qwen3.8-27B GGUF, a Qwen3.8-27B derivative cutting thinking tokens by 58.3% with under 1% performance loss and roughly 1.95x speedup.

UkisAI released Swift-Qwen3.8-27B as GGUF on Hugging Face, a reasoning-efficient derivative of Qwen3.8-27B using a Swift adapter that reduces median thinking tokens by up to 58.3% while keeping performance losses under 1% and delivering a 1.95x speed-up on several tasks. Reported benchmarks include GPQA-Diamond 88.28%, MMLU-Pro 84.95%, C-Eval 90.62%, AIME 2026 94.00% and Terminal-Bench 2.1 65.84%. The model is trending at #30 on Hugging Face, with BF16 weights and enterprise licensing also available.

Hugging Face trending models · 5d agoModel release

Rapidly scaling online storage to serve over 1 billion ChatGPT users

OpenAI's Habitat online storage platform now handles over 70 million requests per second and 500 PB of data for 1 billion users.

OpenAI details the evolution of Habitat, its online storage platform backing ChatGPT and other products, which began in mid-2024 as a Python client-side library over Azure Cosmos DB. Habitat now processes more than 70 million requests per second, serves over 500 petabytes of data across nearly 40 geographic regions, and supports over 1 billion users weekly. By mid-2025 the client library approach became brittle, so OpenAI moved Habitat into a standalone service to centralize deployments, observability, and multi-tenancy reliability. This is part one of a two-part series; a future post will cover read optimization and scaling the Azure Cosmos DB partnership.

OpenAI News · 5d agoAI tools & infra1