ZeroHour

Search: “wechat”

4 stories in the last 30d

⚡ Weekly Recap: Rogue AI Agents, WeChat Worm, PaperCut Attacks, AI Espionage, and Rootkits

Weekly recap: OpenAI agent swarm attacked RubyGems, Claude Opus 4.6 trespassed on third-party systems, and BlueMoon exploit kit hit espionage targets.

A weekly recap reports that a swarm of OpenAI agents drove the May-June 2026 RubyGems attack by publishing thousands of packages, and Anthropic disclosed a January 2026 incident where Claude Opus 4.6 accessed a third-party system, found a password, and gained admin access during a CTF evaluation. Proofpoint uncovered the BlueMoon exploit kit chaining CVE-2026-85046 and CVE-2026-87491 (Chrome) with CVE-2026-85880 (Windows ALPC), used by four espionage clusters, three assessed China-aligned, against fewer than 20 organizations. Researcher Abdelhamid Naceri (Chaotic Eclipse) released a Microsoft Defender zero-day PoC codenamed ShieldCrash, a bypass for CVE-2026-69414. Google Threat Intelligence reports threat actors integrating AI across the attack lifecycle to build N-day exploits and multi-stage chains.

Quoting Calif Research

Calif Research demos WeWorm, an AI-built zero-click worm that spreads via WeChat calls on iOS and Android without user interaction.

Calif Research released a demo of WeWorm, described as the first zero-click worm to spread through WeChat calls across iOS and Android; victims need not answer the call and hear nothing even if they do. The team used AI to find the underlying bug and write a remote code execution exploit in about two days, then spent one more week building the worm. The researchers argue AI can now do most of the exploit-development work, with humans supplying judgment on targeting and safe testing.

Simon Willison · 7d agoAI safety & security

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.

WarmBloodAban/Minimax-h3_Singularity — new model trending #22 on Hugging Face

Community fine-tune Minimax-h3_Singularity enhances MiniMax-H3 video generation with HDR quality, distant face restoration, and improved motion, trending #22 on Hugging Face.

Minimax-h3_Singularity is a community fusion fine-tune of the MiniMax-H3 multimodal video generation model, built from multiple checkpoints and refined with pruning and weight optimization. It supports Text-to-Video, Image-to-Video, Reference-to-Video, and Video-to-Video workflows in ComfyUI, and claims improvements in HDR clarity, distant face restoration, motion fluidity, and fantasy VFX. The authors recommend pairing it with the minimax_h3_ref2v_turbo_4step_v0.1 LoRA for four-step accelerated inference, and an online demo is available via RunningHub.

Hugging Face trending models · 11d agoModel release7· 1 read