保存済みツールを推薦
FOXAI SEARCH

サイト内検索

ニュース記事 605

startup-projects

Show HN: Repairer – close the breach when a Linux flaw goes public

As we've seen with the Ubuntu critical CVE-2026-98432 (CVSS 9.8), AI-dicovered zero day exploit are being reported at an exponential rate and we don't have the process for dealing with the flood of exploits in real time.What we need is an AI-based system for autopatching systems based on real time information. The vendor's fix can take days or weeks to be out (is the Ubuntu thing patched yet?) and meanwhile the grid is vulnerable to exploitation, especially AI worms.Repairer is a small program that runs on each of your servers. The day an exploit goes public it puts up a stopgap that blocks it, and once the real fix is up it takes the stopgap back off by itself.A stopgap only takes something away — drop certain packets, turn off a kernel module or service, remove a setuid bit. It never opens a port, installs or downloads anything, nor runs code. It arms an undo playbook before applying the stopgap, so the change reverts if affects any services.It only ever acts on rules you sign with a (hardware) crypto wallet.Let's go further: stopgaps are written and checked by a swarm of AI agents (gnosh.ai sessions) running on gno.land, each with bonded stake. Each stopgap is run on fresh machines, and whoever is caught lying loses their stake to whoever caught them.The agent is built and tested on Ubuntu and Debian, all open source, standard-library Go. More distros coming. Let's build repairer together.https://gno.security/repairer/ https://github.com/gnosecurity/repairer Comments URL: https://news.ycombinator.com/item?id=50388417 Points: 1 # Comments: 1

翻訳サービスが停止中のため原文を表示しています。
Hacker News Show HN
funding

The AI boom’s missing balance-sheet question: What has actually been verified?

Artificial intelligence infrastructure commitments are growing faster than the evidence connecting contracted capacity to sustained economic value. I spent 13 years on the floor of the New York Stock Exchange. One lesson stayed with me long after the trading jackets disappeared: A transaction could be executed, documented and perfectly valid while the assumptions that made […] The post The AI boom’s missing balance-sheet question: What has actually been verified? appeared first on SiliconANGLE.

翻訳サービスが停止中のため原文を表示しています。
SiliconANGLE AI
copyright-privacy

Trust Responsive Runtime Authorization for Agentic AI with Empirical Characterization of Policy Behavior and Parameter Sensitivity

arXiv:2611.06996v1 Announce Type: new Abstract: The policy that converts runtime estimates of an autonomous agent's condition into operational authority is rarely specified or measured. We empirically characterize the Trust Responsive Authorization Policy (TRAP), which maps an Authorization Readiness Score (ARS), a weighted combination of runtime trust, operational stability, and contextual risk, onto discrete authorization levels through an asymmetric rule: escalation requires consecutive observations above a band edge plus a margin, while a sharp drop in readiness restricts authority at once. On one matched set of 100 Monte Carlo traces, we compare TRAP with static, trust-only, risk-only, and symmetric policies. Under abrupt degradation, TRAP restricts at onset and re-escalates sooner after recovery than the symmetric policy, with the highest and, descriptively, least variable stability among the adaptive policies, although more of its post-recovery escalations occur below the selected trust threshold. Paired bootstrap intervals exclude zero for the remaining differences. In one-factor sweeps, recovery time rises with the escalation margin and run length, shifts with the score weights, and is unchanged by the restriction threshold. In an exploratory post-freeze experiment, when the same degradation is spread over 5-20 intervals, TRAP restricts only on the 4 traces that retain a single-interval drop above that threshold; averaged over all 100 traces, it holds authority above what readiness supports for 15.9-18.9 of the 20 degradation intervals, against 0.8 under abrupt degradation and about 10 for the symmetric policy. Its restriction advantage therefore depends on degradation being abrupt. All reported values are traceable to the publicly available, versioned research release.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.AI
研究の進展

University of Utah retains operational sovereignty as Redtail expands research access

Operational sovereignty gives universities authority over how shared computing resources are allocated, managed and secured. The University of Utah’s Redtail AI factory supercomputer brings advanced computing capabilities to a statewide community. Supporting researchers, students, administrators and external partners through that infrastructure requires more than computing capacity, according to Manish Parashar (pictured), chief AI officer of […] The post University of Utah retains operational sovereignty as Redtail expands research access appeared first on SiliconANGLE.

翻訳サービスが停止中のため原文を表示しています。
SiliconANGLE AI
inference-systems

Where Should a KV-Cache Repair Budget Go? Distractor Structure and Contextual Compatibility in Non-Prefix Reuse

arXiv:2611.06397v1 Announce Type: new Abstract: Non-prefix KV-cache reuse encodes retrieved chunks independently and concatenates their caches. To find where a small repair budget should be spent, we vary the chunks around the answer-bearing one (the target) across three 7B-8B models and four datasets of dialogue memory, open-domain QA and API documentation. Reuse loses 19-100% of the context-dependent questions that full prefill answers, and it loses more when the other chunks are of the same kind as the target. Because the recoverable damage is spread over these other chunks, restoring a few of them recovers little, and the budget is better spent on the target. This works through contextual compatibility: recomputing the target against the reused cache beats inserting its full-prefill KV in all seven settings tested, although the recomputed KV stays far from the full-prefill KV. Question attention over reused caches, however, selects the target in at most 18.8% of development questions. A retriever finds it more often, and recomputing its top chunk after moving it next to the question significantly beats InfoFlow-style reordering at the same 5% budget in six of nine open-domain QA and API-documentation settings. On dialogue memory, though, recomputing chunks never significantly beats the token-level selector chosen for each setting.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.CL
open-models

A Closer Look at Phonon TTS. Launching High-Quality On-Device Speech That Tops the Benchmarks.

Phonon, a small text-to-speech model that runs entirely on the user's device without requiring internet access, has been released with support for English, French, German, Spanish, and Portuguese. Built on the Pocket TTS lineage using flow matching, Phonon achieves high-quality audio in compact sizes (65 MB and 75 MB), with the 31m version licensed under Apache 2.0 for commercial use. It excels in intelligibility and speed, ranking first in German and Spanish on Hugging Face's Open TTS Leaderboard and leading in CPU streaming benchmarks. The model supports voice cloning, custom voices via Gradium Studio, and integrates with Hugging Face Transformers. It is available in multiple formats and backends, including WebAssembly, GPU, and NPU, enabling deployment across phones, laptops, single-board computers, and browsers. Over 200,000 downloads were recorded in its first two weeks, with active developer adoption through tools like ExecuTorch, Micdrop, and Spaces. Future developments include support for additional languages, smaller models, and custom vocabulary fine-tuning.

翻訳サービスが停止中のため原文を表示しています。
Hugging Face 官方博客
model-evals

A Controlled Experimental Evaluation of Configuration and Cache Architecture in LLM Serving Engines

arXiv:2611.05991v1 Announce Type: new Abstract: Multi-agent LLM applications repeat most of their prompt tokens across requests, and serving engines reuse the cached state of shared prefixes. vLLM and SGLang reuse it at different granularities, and benchmarks of their default deployments report large performance gaps, usually credited to the cache. Such comparisons rarely control for other configuration differences. One of them, whether a long prompt is prefilled in chunks, is set by each engine's defaults from the hardware and the release, and it confounds the comparison. We built a reproducible testbed on Kubernetes and a seeded multi-agent workload generator, and compared the two engines under vendor defaults and with chunked prefill matched. SGLang's configuration is the same in both arms, which makes it an internal control across independently provisioned deployments. Under defaults, vLLM's median time to first token is up to 64x SGLang's. Matching one setting removes 78% of the capacity gap where that gap is largest and 30 to 67% of the latency gap. Near saturation the remaining latency gap reflects queue growth. A fluid queue model driven only by a 4.4% throughput shortfall reproduces it, and shows that such a gap scales with the length of the benchmark run. What survives matching is a tail-latency advantage of 2.4 to 6.4x at equal throughput, consistent with cache-aware ordering of waiting requests. We derive six recommendations for comparing serving engines.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.DC