Search: “glm”

13 stories

Searchkeyword smart Sortlatest hot importance relevance

DomainAll Cyber AIWindow24h 3d 7d 30d AllIn the wild Important only Show duplicates

CategoryAll AI industry 14 Model release 13 AI research 13 AI safety & security 11 Vulnerability 6 Exploit / PoC 5 Data breach 3 Threat actor 3 Policy & legal 2 Malware 2 Ransomware 2 AI tools & infra 1 Advisory 1 Industry 1

SeverityAll critical 11 high 7 medium 10 low 2 info 47

Show HN: Pelican-bicycle alternatives (updated for 2026)

Hobbyist benchmark re-runs the pelican-bicycle SVG test on six 2026 frontier models, comparing generation time and API cost per image.

A Show HN post re-runs the classic pelican-bicycle and similar SVG generation tests across six 2026 models: GPT-6 Astra, Claude Fable 5.1, Gemini 3.8 Flash, DeepSeek V4 Pro, Qwen3.8 Max, and Fugu Ultra v2, recording wall-clock time and cost. It also lists 2025 baseline runs with ten models including Claude Sonnet 4.5, GPT-5.2 Pro, and Qwen3-VL-235B-A22B-Thinking. DeepSeek V4 Pro is consistently cheapest ($0.04-$0.10) while Qwen3.8 Max is slowest, taking up to roughly 17 minutes per generation.

Hacker News · securitySep 14, 13:20 UTC · 2d agoAI research HN 24↑ · 4 comments

Real-SWE: Benchmarking AI models on private, real-world, enterprise codebases

Real-SWE benchmark tests coding agents on licensed private enterprise codebases; top model Fable 5.1 resolves only 38.8% of tasks.

Real-SWE is a new benchmark evaluating frontier AI coding agents on tasks drawn from private production codebases licensed from real companies, spanning billing, tax calculation, and cross-service migrations. Fable 5.1 with Claude Code leads at 38.8% resolution rate (pass@1 over eight runs), followed by GPT-6 Astra Codex CLI at 33.8% and Gemini 3.8 Flash Gemini CLI at 31.2%. Tasks use native harnesses and realistic tooling including Docker, Kubernetes, PostgreSQL, Redis, and Linear; median reference solutions edit 11 files versus 6 for DeepSWE and FrontierCode.

Hacker News · AISep 12, 20:25 UTC · 4d agoAI research HN 45↑ · 31 comments1

Latest open artifacts (#24): Motif-3, GLM-5.3, Hy4-preview and open model licenses

Interconnects surveys new open models—Motif-3, GLM-5.3, Hy4-preview—while analyzing a licensing split: Western labs opening up, Chinese frontier labs getting restrictive.

The roundup covers Motif-3 (MIT license, strong scores for its size), GLM-5.3 (switched from MIT to a custom license with a $10 billion revenue threshold and undefined 'affiliates' clause requiring Z.AI security review), and Tencent's Hy4-preview (competent but prone to overthinking). It also notes dots3-note-prev from RedNote/Xiaohongshu (won IMO 2026 with a perfect score), Qwen3.8-Flash-Next (125B-A6B with GDN and Qwen Sparse Attention), NVIDIA Nemotron-3.5-Lightning-30B-A3B-BF16, and Ling-3.0-flash. The core theme: Google and Meta adopted Apache 2.0 while Chinese frontier labs (Zhipu, Kimi K3, MiniMax M3) adopted restrictive commercial licenses.

InterconnectsSep 8, 14:15 UTC · 8d agoAI research

I tested 10 model/harness combinations on the same Three.js task

A developer benchmarked 10 model/harness combinations on a Three.js task; Qwen 3.8 27B on OpenCode scored 95.64% fastest at 8m48s.

The author ran an identical Three.js sci-fi hangar build prompt across 10 model/harness combinations and recorded score, tokens, durations, and tool errors. Qwen 3.8 27B x-high on OpenCode achieved 95.64% in 8m48s, the best fast result, while GLM 5.3 Flash Max on OpenCode scored highest at 96.89% in 20m28s. Other runs included GLM 5.3 Flash, Luna 5.6, SOL 5.6, and Astra 6.0 across Codex Open, OMP Open, OpenCode, DSH, and PTC harnesses, with scores ranging from 78.54% to 96.89%.

Hacker News · AISep 8, 03:42 UTC · 9d agoAI research HN 104↑ · 61 comments1

RSIAgent: Autonomous Exploration for Recursive Self-improvement in New Environments

RSIAgent, a training-free multi-agent framework, builds reusable environment memory enabling Kimi-K3 and GLM-5.3 to beat GPT-6.

RSIAgent is a training-free framework for recursive self-improvement through autonomous memory construction, coordinating curriculum, actor, and verifier agents. It uses broad-then-deep exploration to capture environment structures, hidden constraints, and causal dependencies, and freezes the resulting memory for direct reuse without parameter updates. On OSWorld-v2 and Agent's Last Exam it substantially improves strong open-source models, enabling Kimi-K3 and GLM-5.3 to outperform frontier closed-source models including GPT-6.

Hugging Face daily papersSep 13, 20:00 UTC · 3d agoAI research2

T1: Terminal Agent Reinforcement Learning for Long-Horizon Tasks

T1, a 122B MoE terminal agent trained with reinforcement learning, reaches 64.0% on Terminal-Bench 2.1, surpassing GPT-5.4 and GLM-5.1 on long-horizon tasks.

T1 is a 122B mixture-of-experts model trained with reinforcement learning to operate a real shell in a cloud sandbox for up to 300+ tool-call turns per task, rewarded by executing each task's own verifier. The recipe combines aggressive warm starts, dense process rewards, TITO construction, and rollout routing replay, cutting the training-to-inference log-probability difference from 0.021 to 0.013 with zero token drift. Training used an out-of-distribution corpus disjoint from Terminal-Bench 2.1. Post-training raised the base model from 43.8% to 64.0% resolved on Terminal-Bench 2.1 and 27.9% on Long-Horizon Terminal Bench.

Hugging Face daily papersSep 9, 20:00 UTC · 7d agoAI research1

GPT-6 Astra pilots a surveillance drone and runs a business on its own

GPT-6 Astra outperforms Claude Fable 5.1 on Vending-Bench and becomes the first model to beat the human-AI baseline on all five Drone-Bench subtasks.

Andon Labs tested OpenAI's GPT-6 Astra on two agent benchmarks: Vending-Bench 2, where Astra averaged $15,515 running a simulated vending-machine business versus Claude Fable 5.1's $5,422, and Drone-Bench, where models write code for a DJI Tello EDU drone to navigate an office and follow a specific person. Astra is the first model whose best submissions beat the human-AI baseline on all five Drone-Bench subtasks, using a COLMAP and DA3 pipeline with depth filtering for 3D reconstruction. Reliability remains limited, as an average Astra run has only a 2.8 percent chance of passing all five drone steps sequentially. In Vending-Bench Arena, Astra refused a price-fixing proposal from GLM-5.3, while Claude Fable 5.1 participated in an arrangement Andon Labs classified as illegal price-fixing.

The DecoderSep 13, 10:52 UTC · 3d agoAI research

Anchoring Clinical Events in Time: UID-Preserving Multimodal Reconstruction and Source-Grounded Adjudication

UID-preserving multimodal framework plus GAVEL LLM judge improves clinical timeline reconstruction, boosting event recovery 43% over prior matching.

The paper introduces a UID-preserving framework linking each narrative clinical event to its source span through text-only estimation, structured-evidence retrieval, timestamped source-row grounding, and joint revision. GAVEL, an LLM judge, compares UID-aligned timelines against narrative and structured records. Across six open-weight models and 40 mixed-critical-care summaries, GLM 5.2 multimodal revision improved temporal agreement without reducing event recovery and performed competitively with clinician annotations, while DeepSeek V3.2 did not benefit from multimodality. The pipeline achieves 43% increased event recovery with occurrence-level provenance.

arXiv cs.AI / cs.LG / cs.CLSep 11, 17:01 UTC · 5d agoAI research1

[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 SpaceSep 9, 05:04 UTC · 8d agoAI research1

Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

Six frontier models play a two-agent log(N)-Questions game; Claude Opus 5 lags with 28/68 wins while the top five are near-tied.

The study evaluates six frontier models on a two-agent game where a questioner must identify one of N Wikipedia lead paragraphs in exactly log2 N yes/no questions, run over 408 games at $363 total API cost. Claude Opus 5 wins 28 of 68 games versus 45-56 for GLM-5.3, GPT-5.6 Sol, Grok 4.6, Gemini 3.8 Flash, and Kimi K3. Pooled top-five win rates decline with set size (r=-0.973) and fit win = p^(log2 N) with per-round reliability p=0.928, and information per question correlates with win rate at r=+0.88.

arXiv cs.AI / cs.LG / cs.CLSep 16, 17:41 UTC · 16h agoAI research 20 sources

Rethinking Heterogeneous System Disaggregation for Subquadratic Attention

SQD disaggregates LLM inference by quadratic versus subquadratic attention layers, improving energy efficiency up to 56% on heterogeneous systems versus GPU-only baselines.

SQD (SubQuadratic Disaggregation) splits decode not by operator type but by quadratic versus subquadratic attention, matching their distinct arithmetic intensity and memory footprints. For sparse attention LLMs it separates top-k selection (requiring full KV indexing) from top-k attention plus FFN; for linear and sliding-window models it separates dense attention layers from subquadratic layers plus FFN. On an adjusted 8xB200 heterogeneous proxy, tokens-per-joule improves 53% on GLM 5.2, 31% on Nemotron 3 Ultra, and 56% on Gemma 4 31B. A Rubin plus LPX analytical model shows 1.2x-1.5x tighter achievable latencies and up to 3.6x higher throughput versus attention-FFN disaggregation.

arXiv cs.AI / cs.LG / cs.CLSep 11, 17:55 UTC · 5d agoAI research

Import AI 469: Science AI; RSI simulator; and Zuck's technological pessimism

New DiG-bench benchmark of 70 hidden-rule games shows only Opus 5 and Fable 5 solving the hardest tiers, probing AI discovery and creativity.

Import AI 469 highlights DiG-bench (Discovery in Games), a benchmark of 70 handcrafted games with hidden rules and objectives where only 21 games are public and most are kept private to avoid training contamination. Only Opus 5 and Fable 5 with Claude Code solved any Tier 7 tasks (about 0.2 success), with GPT-5.5 next; the games are text-based and have beaten every human tester at least once. The newsletter also covers an RSI simulator game by Paradigm Research and Inherent's Faraday, a post-trained open-weight model that supervises frontier models to improve scientific research output.

Import AIAug 17, 13:05 UTC · Aug 17, 2026AI research

Import AI 468: 23 RSI ideas; PostTrainBench+; and how trust and transparency interplay with AI racing

Import AI covers 23 IFP policy ideas for automated AI R&D risks and MIT/Columbia's game theory of AI racing slowdowns.

Think tank IFP published 23 policy recommendations across seven categories to help policymakers address risks from increasingly automated AI R&D. MIT and Columbia researchers released 'Racing to Ruin,' a game theory model showing that coordinated slowdowns between rival AI firms hinge on trust and transparency. The newsletter also links a short story on interacting with powerful AI systems.

Import AIAug 10, 12:32 UTC · Aug 10, 2026AI research