Posts

Anthropic Launches OSS Scanner, a Free AI Vulnerability Scanner

Anthropic has launched OSS Scanner , a free, opt-in vulnerability scanner for critical open-source projects. The Anthropic OSS Scanner runs the company’s strongest models, including Claude Mythos , against enrolled codebases. Reports go straight to maintainers without human review. That trade delivers faster findings, but shifts triage work onto project teams. 11 days after the October 8 launch, Anthropic reported 77 critical and 803 high model-rated findings . TL;DR Scale: 114 projects accepted from about 650 applications, as of October 19. Runs on: Anthropic’s infrastructure, free. Maintainers supply a Dockerfile; audits run in an isolated VM with no Internet. Performance: 85 of 97 audited critical and high findings (88%) met Anthropic’s disclosure bar. Best: Only 1 of 97 audited findings was a false positive. wolfSSL says 72 of 74 reports were valid. Worst: No human review before delivery. 11 of 97 audited findings duplicated known iss...

Microsoft Open-Sources Agensh: A Multi-Agent Harness for 1,024 Agents

Microsoft Research has open-sourced Agensh , a decentralized harness for large teams of coding agents. The Agensh multi-agent harness removes the central orchestrator that most agent frameworks depend on. Every worker picks its own sub-task, shares findings and merges code into a common Git repo. On ProgramBench, the team scaled the setup from 1 agent to 1,024 agents. TL;DR A Harness : Tested from 1 to 1,024 agents. Each worker gets a 272,000-token input and 128,000-token output limit. Runs on: Linux with Docker Compose. Single node by default (8 workers). The 1,024-agent run used 16 nodes, 64 agents each. Workers have a 64 GiB memory ceiling. Performance: more agents raised scores on all 5 hardest ProgramBench tasks, and reached them sooner. Best: 79.59% pandoc pass rate with 32 agents on GPT-6.1-sol. GPT-5.6-sol hit 55.06% with 1,024 agents. Worst: the 5-task mean reached only 28.78% at 128 agents. Going from 1 to 8 agents added 1.37 points. What is...

How to Run Underdog Saluki 27B: 2-Bit Qwen3.8-27B Tool-Calling Guide

In this tutorial, we work with Underdog Saluki 27B , a 7.9 GB build of Qwen3.8-27B that its makers say keeps tool calling intact at about two bits per weight and even edges out the full 54 GB model on their own 120-task benchmark. Saluki is built on ISTA-DASLab’s GSQ-RCO quantization of the same model, so we put both files side by side in stock llama.cpp. We start with the files themselves: a tensor-by-tensor diff of the two GGUF headers, then a byte-level comparison that shows whether Saluki is a remix of ISTA’s bits or a changed model. We then serve each file on one GPU, read its memory and speed, and score both on the same seeded 120 tasks from the Berkeley Function Calling Leaderboard, using BFCL’s own checker with strict and lenient parsing. Copy Code Copied Use a different Browser import os import re import ast import sys import json import math import copy import enum import glob import time import types import random import shutil import struct import hash...