138 results for “LG”

Attackers remotely changed temperature settings, shut down units or triggered defrost on refrigeration systems at more than 115 supermarkets in Belgium, the Netherlands, Sweden, Luxembourg, Ireland and Estonia. Affected chains include Ahold Delhaize, Carrefour, ICA, Coop, SuperValu and Spar Colruyt. Vendor Sabcobel's director said the attacker used the same vulnerability as last month's attacks in France on Danfoss AK-SM/AK-SC and Copeland/Dixell XWEB controllers; a software update alone is not enough.

bleepingcomputer.comarticlePublished and added 2 Nov 2026🛡️ Security

The paper treats a benchmark as an empirical measure over item difficulty and formalizes two failure modes: measure mismatch (benchmark difficulty distribution differs from the intended one) and coverage gaps (uncovered difficulty regions that hide localized training progress). It proposes two diagnostic metrics with theoretical guarantees and analyzes 25 popular benchmarks across 7 domains using estimated item difficulties. It also introduces BenchFill, a difficulty-targeted item rewriting algorithm that reduces local coverage gaps.

huggingface.copaperAdded 31 Oct 2026🧠 AI

CORAL (Cognitive Resource Self-Allocation) is an agent-callable working-memory toolset that lets an LLM agent checkpoint task progress and verified facts, then reset its cluttered context and resume from a clean state. A Multi-episode Agentic Reinforced Policy Optimization algorithm trains the checkpointing. With an 8B model it reaches 42.8% average accuracy on GAIA, uses 6-7x fewer input tokens than a ReAct agent, and adds 8.0 points to a proprietary agent on BrowseComp.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Kolesnikov and Novoselov give block basis reduction (BKZ) algorithms for linear codes that need polynomial or quasi-polynomial numbers of calls to a minimum weight codeword oracle at fixed block size. The earlier Ghentiyala and Stephens-Davidowitz bounds are exponential. The paper adds a truncated BKZ and a DeepBKZ variant, with an implementation for block sizes 2 to 24 and approximation-factor estimates on random codes.

eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

DICE is a blockchain-powered federated learning (BCFL) algorithm for customizing large pretrained models among untrusted Web3 participants. It combines dynamic progressive learning and model slice verification, so hardware-limited participants can train part of the model, with a tree-structured committee consensus protocol and an efficiency-driven incentive scheme to scale to more data holders. Experiments cover vision and language models.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Shor's algorithm compiled on cat qubits is an IACR ePrint (2026/2665) giving an end-to-end resource estimate on superconducting cat qubits, using repetition and LDPC cat codes. Factoring RSA-2048 needs about 23,000 cat qubits and 3.14 days, assuming phase-flip noise p_Z = 5e-4 and no bit-flips. secp256k1 ECDLP needs at most 30,000 qubits and 1 hour. A space-for-time trade runs RSA-2048 in 1.25 hours on about 611,000 qubits.

eprint.iacr.orgpaperPublished and added 28 Oct 2026🛡️ Security

Decrypt reports that OpenAI published a 67-page paper (dated 17 October 2026, revised 25 October) claiming its AI found a deterministic subexponential-time algorithm for counting 3-SAT solutions, which would refute the Exponential Time Hypothesis. The proof was formalized in Lean. Impagliazzo, Paturi and Ryan Williams are reviewing it independently and say this is not certification. Anthropic posted a Claude-credited 3-SAT paper on 26 October.

decrypt.coarticlePublished and added 27 Oct 2026🧠 AI

Radical isogenies on every model is an IACR ePrint paper by Thomas Decru (October 2026). It gives radical isogeny steps of every odd degree N directly on short Weierstrass, Montgomery, twisted Edwards, Huff, Jacobi quartic, twisted Hessian, Legendre and Jacobi intersection curves, plus Kummer lines. In Tate normal form a step drops from 12.5N to 10N multiplications. Montgomery and twisted Edwards curves cost 10.5N+O(1) per step and 2N to push a point. All algorithms are inversion-free, with exact operation counts.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

Hi3D v1.0 (formerly Sparc3D) is an open-sourced image-to-3D model from Hi3D, which runs a closed v3.0 refining at 2048 cubes per side. In a test with 13 professionals in 3D algorithms, 562 judgments against eight other image-to-3D models favoured it 83.5% of the time. The thread also covers the Hi3D Agent and an MCP server for other agents. Back and bottom views were checked, where TRELLIS.2 collapsed a winged figure.

x.comthreadAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

AlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

Proof of One is an open-source design for polls with one verified human per identity and unlinkable ballots. Enrolment proves in zero knowledge that an ICAO 9303 passport chip was signed by a trusted signer, plus an enclave face match. Voting uses threshold exponential ElGamal on Baby Jubjub with Groth16 proofs, and tally uses a GJKR DKG with a 7-day challenge window. The author, who is pseudonymous, discloses that AI agents drafted most of it and asks for critique of unlinkability, circuit completeness and certificate trust.

ethresear.chthreadPublished and added 27 Oct 2026🛡️ Security

Inventory of post-quantum migration work for Ethereum consensus-layer networking, by adust09 of Nyx Foundation. It maps three targets: Discovery v5/ENR signatures and key exchange, TLS 1.3 key agreement in QUIC, and libp2p TLS identity binding and CertificateVerify. It covers the 300-byte ENR and 1,280-byte packet limits, why hybrid KEMs do not authenticate peers, and downgrade and DoS concerns. It selects no algorithm or schedule.

ethresear.charticlePublished and added 27 Oct 2026🛡️ Security

"When Algebraic Structure Meets Too Many Hints" is an ePrint paper (2026/2654) arguing that DDGR hint classes and too-many-hints thresholds are not standalone side-channel security metrics. In synthetic Kyber-512 experiments, NTT-domain residues recover the full secret with about half the hints the uniform mod-q bound predicts. Finite-precision FFT samples need 25% to 55% of the budget for uniform perfect hints. No new attack optimizations are proposed.

eprint.iacr.orgpaperPublished and added 27 Oct 2026🛡️ Security

Your Wish Is My Commit is a controlled study of over-compliant refactoring in Codex and Claude Code, run across five models, 50 algorithmic tasks and 10 object-oriented tasks. Over 3,000 turns of repeated "refactor further" prompts, no model stopped on its own: each rewrote up to 31x the original codebase before first stopping and resumed edits after declaring the task complete. The paper defines six behavioral signals for detecting over-compliance.

arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🧠 AI

Subexponential Algorithms for LWE via Rejection Sampling on Superlattices is an ePrint paper by Ligeng Fan, Changpeng Shao, Hongbo Li and Dingkang Wang. It extends the Ducas, Engelberts and Loyer superlattice framework to give a provable classical search-LWE algorithm for prime q in [n^2, 2n^2], using m=4n samples and time and space exp(O(n/ln ln n)). A second variant runs in 2^((1/2+o(1))n/ln R) for general parameters. It resolves a gap left by Kirchner and Fouque.

eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security

Gao and Hu's IACR ePrint 2026/2622 shows that if the matrix multiplication exponent satisfies ω ≤ 9/4 − η, heuristic lattice sieving runs in (3/2 − δ)^(n/2+o(n)) time under the spherical heuristic from the BDGL analysis. It builds on OpenAI's recent result that ω ≤ 9/4. With known matrix multiplication algorithms, the method already gives subquadratic search inside BDGL buckets. Only the abstract is available, so concrete parameters are not shown.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

A Decrypt writer asked Claude to install Free My TV, an open-source launcher for LG webOS, on a TV rooted since 2023. Claude reviewed the install code and built the package. It then had the user enable Developer Mode, which wiped the Homebrew Channel and ad-free YouTube. Claude restored both apps but not root. Its safeguards then flagged the re-rooting research and offered a switch from Opus 5.5 to Opus 4.8.

decrypt.coarticlePublished and added 23 Oct 2026🧠 AI

Rentaro Shiba and Tetsu Iwata prove a tight multi-key security bound for the FX construction (the DESX generalization) in the quantum ideal cipher model. Security holds up to about 2^((n+κ)/3) total classical and quantum oracle queries against fully adaptive adversaries, for any number of keyed instances μ≥1. This improves their ToSC 2026 bound and matches the offline Simon's algorithm attack in the exponent.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026🛡️ Security

SOMA (Sharpness-aware Orthogonalized Momentum Algorithm) combines sharpness-aware minimization (SAM) with the Muon optimizer for LLM training. It avoids SAM's extra gradient computation by using stale, purely stochastic gradient noise as the adversarial perturbation. The authors prove sample complexity does not depend on perturbation direction, study robustness to heavy-tailed gradient noise, and test SOMA against post-training quantization degradation and catastrophic forgetting during fine-tuning.

arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026🧠 AI

CellTrack-Bench is a benchmark that tests vision-language models on microscopic cell tracking and compares them with specialised trackers. It has 1,537 problems covering 9,041 cell-linking decisions, drawn from 15 cell-tracking datasets across four imaging modalities, with a hard subset built from failures shared by distinct algorithmic trackers. The authors compare environment harnesses, benchmark 9 closed-source and 13 open-weight models, and analyse failure modes.

arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

Linear cryptanalysis of FRAST, a TFHE-friendly stream cipher, in the average key setting. It fixes the false-positive problem left open in the earlier attack by Bak et al., showing key differences fall into five indistinguishable classes per round. The Contract algorithm recovers the master key for 10 rounds and, on weak keys of density 2^-11.8 to 2^-5.4, reaches full FRAST within the claimed security.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

SoK on design-level backdoors in block ciphers. It places four published designs (Rijmen and Preneel, Paterson, Bannier and Filiol, Peyrin and Wang) in one taxonomy and gives a sound algorithm that recovers a partition trapdoor from S-box tables. It attacks KG-DES, BEA-1 and LowMC-M: KG-DES key recovery takes minutes, and the LowMC-M MALICIOUS backdoor yields the key from 35 to 409 queries. Trapdoors hidden in linear layers leave no trace, so the authors recommend deriving constants verifiably from a public seed.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

Table-free constant-work BCH decoding by algebraic index elimination is an IACR ePrint paper (2026/2580) that replaces the table scans in Walters and Sinha Roy's constant-work BCH decoder with fixed circuits over public addresses. It proves correctness through radius t and trace regularity, removes 5.2 and 7.2 KiB of tables, and runs 35.7 to 82.4 times faster on an i7-13700. Ordinary C masks compiled to received-word-dependent branches under Apple Clang 21, so the authors use a compiler-opaque primitive and run timing screens on four platforms.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

Trail of Bits thread on Google Quantum AI's March publication of a new Shor's algorithm version aimed at secp256k1, the curve protecting Bitcoin and Ethereum wallets. Google used zero-knowledge proofs to keep the attack details secret, and the post says the secrecy lasted 63 days. The fetched text is cut off after the qubit estimate of roughly 1,200, so later details are missing.

x.comthreadAdded 22 Oct 2026, published 20 Oct 2026🛡️ Security

Preprint by Jiseung Kim, Minkyu Kim, Changmin Lee and Hochang Lee on the Regular Syndrome Decoding (RSD) problem. It presents a hybrid-algebraic attack that balances zero-coordinate guesses and syndrome-based eliminations across regular blocks. Parameter sets in Ferret, Wolverine and committed VOLE fall below 128-bit targets by up to 67 bits, and the revised Liu et al. (EUROCRYPT 2024) PCG sets cost under 2^111 field operations.

eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026🛡️ Security

Preprint 2026/2563 presents a refined hybrid-algebraic attack on Regular Syndrome Decoding (RSD) that balances zero-coordinate guesses and syndrome-based eliminations across all regular blocks. It puts at least one parameter set each from Ferret (CCS 2020), Wolverine (IEEE S&P 2021) and committed VOLE (CCS 2025) below the 128-bit target, with losses up to 67 bits. PCG attack costs improve by up to 29.77 bits (non-binary) and 25.91 bits (binary), and the revised Liu et al. (EUROCRYPT 2024) 128-bit sets fall below 2^111 field operations.

eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026🛡️ Security

BrainLoRA is a parameter-efficient fine-tuning method that adapts multimodal backbones of up to 104B parameters to predict neural responses. It predicts multiple timepoints in one causal pass instead of sliding windows, and a multi-LoRA kernel trains many adapters on a shared backbone. Across nine backbones it improves encoding, and a 200+ model ensemble ranks first on the Algonauts post-challenge leaderboard.

arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🧠 AI

The paper analyses DeepDistinguisher, a transformer-like model that tells Goppa codes apart from random linear codes. Saliency maps and attention visualisation reveal a low-weight-row artifact in the random training instances that the model partly relies on. A pairwise-XOR rule inspired by minimum distance correlates strongly with the model's predictions, and the model loses most of its power on random matrices meeting both constraints. This suggests it exploits general combinatorial properties, not hidden algebraic structure.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🧠 AI

Analysis of DeepDistinguisher, a transformer model that tells Goppa codes from random linear codes. Using saliency maps and attention visualization, the authors find a low-weight-row artifact in the random training instances that the model partly uses. They propose a pairwise-XOR rule on generator matrix rows that correlates strongly with the model's predictions. On random matrices meeting the minimum distance and XOR constraints, the model loses most of its accuracy, so it exploits general combinatorial properties rather than hidden algebraic structure.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

Zakura, a Zcash full node developer, proposed one-time incoming viewing keys so a future quantum computer running Shor's algorithm cannot link a user's shielded payments. The target is NEAR Intents swaps, which post a shielded refund address on a public chain. The fix needs no network upgrade and uses private information retrieval for seed restores. Wallets such as Vizor can add it within weeks.

decrypt.coarticlePublished and added 19 Oct 2026🛡️ Security

A Broadcom SDK flaw in the WPS code that reassembles fragmented EAP messages allows a buffer overflow and unauthenticated code execution over Wi-Fi, bypassing WPA2/WPA3 passwords. Quentin Kaiser of ONEKEY demonstrated it at Hexacon on 16 October 2026 against Orange Belgium and Proximus gateways, and published a fingerprinting script and YARA rule. Broadcom's 2018 patch was incomplete, it refused a CVE, and over 1.5 million Belgian gateways are exposed.

en.cryptonomist.charticlePublished and added 19 Oct 2026🛡️ Security

Provable Lattice Reduction in Nearly the Time of QR Factorization (IACR ePrint 2026/2541, October 2026) presents a deterministic lattice-reduction algorithm with running time Õ(n^ω(1+log κ_col(B))), free of heuristic assumptions. Its implementation used fewer instructions than flatter (CRYPTO 2023) in all 153 runs on q-ary, NTRU-like, scaled q-ary and Coppersmith inputs. Median flatter-to-new instruction ratios are 1.55 for q-ary and 1.86 for NTRU-like inputs.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

Zakura, a newer version of the Zcash node software, plans to give each ZEC swap through NEAR Intents its own viewing key. Today a refund address posted on NEAR's public chain shares one viewing key with the whole account, so a future quantum attacker running Shor's algorithm could link the account's full payment history. Spending keys stay with the user, and private information retrieval lets wallets find refunds without revealing which addresses they check. Wallets such as Vizor could ship it within weeks.

coindesk.comarticlePublished and added 19 Oct 2026🛡️ Security

Computing endomorphisms of superspecial principally polarized abelian surfaces is a cryptanalysis preprint by Marc Houben and Lam L. Pham, posted to IACR ePrint in October 2026. It gives an algorithm that, under a standard heuristic, finds a non-scalar polarized endomorphism in expected time and memory p^(4/5+o(1)). The abstract is the only text available, so the method and its effect on specific schemes are not described.

eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🛡️ Security

Forum announcement of a Zenodo preprint on post-quantum migration for censorship-resistant P2P steganographic tunnels. It argues that ML-KEM's prime modulus (q=3329) makes naive bit-packed ciphertexts statistically distinguishable from uniform noise, which gives a cheap passive DPI distinguisher. It also argues that composite PQ 0-RTT envelopes over 4.4 KB force fragmentation, which requires stateful reassembly before AEAD verification and reopens memory-exhaustion DoS in eBPF/XDP filters. Proposed fixes are algebraic uniformization (LWR lattices or inverse rejection sampling), sub-MTU hybrid or pure-PQ envelopes (Falcon-512, signcryption), and Fujisaki–Okamoto implicit rejection for constant-time silent drops. Aimed at Ethereum validator, libp2p and RPC transports facing harvest-now-decrypt-later threats.

ethereum-magicians.orgpaperPublished and added 17 Oct 2026🛡️ Security

Presents a fixed-point C implementation of the Mitaka signing algorithm, a simpler, parallelizable Falcon (FN-DSA) variant. It replaces MitakaZ's wide integral Gram root decomposition with a fixed-point square Cholesky decomposition, which cuts the cost of integer Gaussian sampling, and proves bounds on intermediate values and representation errors without empirical assumptions. Signing averages 361 kcycles (Mitaka-512) and 707 kcycles (Mitaka-1024) on AVX2, and 4.0 and 7.8 Mcycles on an STM32F411 Cortex-M4F. This makes floating-point-free lattice signatures practical on constrained devices.

eprint.iacr.orgpaperPublished and added 17 Oct 2026🛡️ Security

CoinDesk reports Google's Science paper showing its Willow chip prepares "magic states" with about 40x fewer errors (about 99.99% fidelity, but only about 8% of attempts survive post-selection) using a method called cultivation. It explains why this lowers one hardware bottleneck for a Shor's-algorithm attack on Bitcoin's ECDSA keys, but does not make an attack 40x cheaper. It also separates coins with permanently exposed public keys (early Satoshi-era outputs, which an offline attacker can target) from hash-hidden keys, where the attacker must race the spend. The article cites Google's March estimate of under 500,000 physical qubits and about 500,000 reliable magic states per second for a roughly nine-minute attack.

coindesk.comarticlePublished and added 17 Oct 2026🛡️ Security

Long-form write-up of a Hexacon 2026 talk on a WPS EAP reassembly overflow in Broadcom's proprietary 802.11 stack, present since 2010 and incompletely patched in 2018. It is remotely triggerable over WiFi without the network key. It gives information disclosure and code execution on eCos (BCM3380, BCM3383, BCM33834) and Linux (BCM3390, BCM65xx, BCM68xx) platforms. Exploited on Belgian ISP routers from Proximus, VOO and Orange. Includes a 90-day disclosure timeline, and Broadcom refused to assign a CVE.

quentinkaiser.bewriteupAdded 19 Oct 2026, published 16 Oct 2026🛡️ Security

ePrint paper identifying five side-channel vulnerabilities in the signing procedure of Round-3 SQIsign, the isogeny-based signature scheme in NIST's additional post-quantum signature process. It gives polynomial-time algebraic algorithms that recover the secret key from leaked quaternion/ideal intermediate values, including cases where only partial bits leak. It also demonstrates power analysis on the SQIsign source code to extract the needed leakage, which earlier work on Round-1 or toy parameters did not do.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

Presents MLExpert, a 35B Mixture-of-Experts agentic model trained for autonomous long-horizon machine learning engineering. Training uses a Kaggle-MLE Factory to build executable tasks and an interaction harness, hierarchical agentic SFT with outcome-guided supervision, and Windowed Interaction RL (WIRL). WIRL treats the multi-turn decisions between successive experiment results as one execution window with a shared outcome reward, and uses asynchronous collection and policy correction. On MLE-Bench Lite the average medal rate rises from 37.9% to 72.7%, comparable to larger frontier models such as Kimi-K3 and GLM-5.3. It also improves on NatureBench Lite, agent scaffold optimization and algorithm optimization.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Proposes EdgeFlow, a hybrid KV cache migration scheme for distributed LLM inference across heterogeneous edge servers in Collaborative Edge Computing. It combines direct KV cache transmission with activation-based recomputation, overlapping computation and communication to cut migration time when servers disconnect or overload. The authors formulate a multi-node KV migration optimization problem and give a 2-approximation algorithm built on improved LP relaxation and bipartite graph techniques. Experiments on a real distributed LLM inference platform show up to 45% lower migration time.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Hackers Arise explainer on the human psychology that social engineers exploit. It covers cognitive overload ("brain DoS"), stereotyped automatic behaviour, and the authority, scarcity and consistency principles, with supporting studies (Milgram, Pliner, Europol fraud-victim statistics). It also describes trigger-bypass techniques such as reframing a password request as IT support, and an observed baseline percentage of recipients who act on phishing emails. It closes with organisational and personal defences.

hackers-arise.comarticlePublished and added 15 Oct 2026🛡️ Security

Simon Willison describes another game experiment, this time in the Claude iPhone app in chat mode rather than Claude Code. He prompted Claude Opus 5.5 Max to build a three.js game called "Tree appreciator" with two algorithmically generated trees and a mechanic based on appreciating their differences, and added "think hard about how to make sure it is both fun and beautiful". After about 3 hours 7 minutes of work it returned a spot-the-difference game with music, animation and achievements. He notes that simply telling Opus 5.5 to "make sure it is fun" works surprisingly well.

simonwillison.netarticleAdded 15 Oct 2026, published 14 Oct 2026🧠 AI

ePrint paper evaluating ASCA (SAT-based) and SASCA (belief propagation) side-channel attacks on the AES-based MILENAGE authentication algorithm in USIM cards, using neural-network leakage predictions to recover subscriber key K and operator secret OPc from a single trace. SASCA alone succeeds in 87.7% of attacks but converges to a wrong OPc in 6.1%; ASCA succeeds in only 34% within a 1-hour timeout. The hybrid, where BP refines the predictions before they go to the SAT solver, reaches 93.8% with lower average runtime. It also proposes a countermeasure that masks each AES round key with an independent per-device secret, and the authors report it defeated the hybrid attack in all evaluated cases.

eprint.iacr.orgpaperAdded 15 Oct 2026, published 14 Oct 2026🛡️ Security

Proposes a cost model and metric for an adversary who collects side-channel traces classically and finishes the key search on a quantum computer. Shows any quantum algorithm needs Omega(sqrt(r)) cipher evaluations for key rank r, and that the quadratic advantage holds only up to a rank bound set by the NIST MAXDEPTH budget (about 2^58.6 for AES-128 at D=2^40). Defines a quantum-aware key rank computable from existing rank estimators, with simulated-leakage experiments showing a depth-limited quantum adversary is worth about 22 traces at SNR 0.125.

arxiv.orgpaperAdded 16 Oct 2026, published 14 Oct 2026🛡️ Security

Draft ERC from Quantova Inc proposing a "Quantum Bridge Shield" for Ethereum bridges. A committee signs the Merkle root of each message batch with RFC 8554 LMS hash-based signatures instead of ECDSA/BLS keys that Shor's algorithm can break. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain, chain, guard and epoch, and applies a 60-second delay. The post gives gas costs (LMS W4 height-10 verification about 205k gas, a LayerZero packet 128,683 gas, worst-case rotation 12.44M gas under the EIP-7825 cap) and cites a NioLabs assessment with no critical or high findings. It is relevant as a worked post-quantum migration design for bridge key custody, including hybrid ECDSA+LMS mode and stateful-signature pitfalls such as leaf reuse and rollback.

ethereum-magicians.orgarticlePublished and added 14 Oct 2026🛡️ Security

Draft ERC from Quantova Inc that has Ethereum bridges accept cross-chain message batches only when a committee signs the Merkle root with RFC 8554 LMS hash-based signatures. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain tag, chain ID, guard address and epoch, and enforces a 60-second delay. It reports gas benchmarks (about 205k per LMS W4 height-10 verify, 12.44M worst-case rotation under EIP-7825), a hybrid LMS+ECDSA migration mode, and a NioLabs assessment with no critical or high findings. It argues that Shor's algorithm makes secp256k1 and BLS committee keys a quantum theft target.

ethereum-magicians.orgpaperPublished and added 14 Oct 2026🛡️ Security

Furue and Aikawa build and analyze algebraic attacks on the Regular Syndrome Decoding Problem (RSDP), which underlies code-based post-quantum schemes. They extend the Wang et al. hybrid algorithm to allow an arbitrary XL solving degree d, and add two variants: an XFL-based one (partial Gaussian elimination plus variable guessing) and a WXL-based one that exploits Macaulay matrix sparsity. Complexity analysis shows the WXL variant with d>2 wins for small block size β, while the original hybrid wins as β grows. This matters for setting RSDP-based scheme parameters.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

METR proposes a framework for an outside assessor to test whether AI automation of AI R&D is accelerating capabilities progress. It covers four questions: how fast internal capabilities improve, how much acceleration AI causes, which bottlenecks could slow growth, and whether the methods would detect a dramatic acceleration. It lists the internal data developers would need to share, including benchmarks, algorithmic progress estimates, compute, labor, AI agent spend and staff interviews.

metr.orgarticleAdded 29 Oct 2026, published 14 Oct 2026🧠 AI

DPF-SGD is a federated SGD algorithm that stays robust to Byzantine agents while satisfying ϵ-differential privacy. It combines private step sizes with a DP noise-decay schedule and adds a privacy-preserving comparative elimination (PPCE) filter that suppresses Byzantine updates during aggregation. The authors prove almost-sure convergence to the global optimum despite persistent noise and adversaries. On synthetic and MNIST data, final optimization error is one to two orders of magnitude lower than DP baselines.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🧠 AI

SP$^2$ec (Single-Peak SPeculative decoding) is a training-free bandit algorithm that adapts the draft configuration of self-speculative decoding per prompt for vision-language models. It relies on the single-peak throughput pattern seen in SWIFT, KnapSpec, SpecVLM and the authors' cosSim method. It minimizes a new wall-time regret measure and has theoretical guarantees of near-optimal configuration with negligible exploration cost. On Qwen2.5-VL-7B-Instruct and LLaVA-NeXT-Mistral-7B it improves over the original self-speculative methods by up to 11% on visual and textual tasks.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

ProAS (Progress-Aware Advantage Shaping) is a plug-and-play framework for multi-turn agentic RL that fixes the uniform credit assignment problem in critic-free algorithms like GRPO, where trajectory-level advantages are broadcast to every action. It uses a dynamically evolving Agentic Reference Graph with Masking Unreasonable Incentives and Asymmetric Penalty Redistribution to give finer-grained credit without a critic. On Qwen2.5-1.5B/7B-Instruct it reports success rates up to 91.9%/94.3% on ALFWorld and 66.7%/70.8% on WebShop, with up to 2.44x faster training convergence and robustness to imperfect or distilled ARGs.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

A blog post examining the "faster Fourier transform" claim in OpenAI's released batch of AI-generated mathematics papers (main.pdf). It explains the Cooley-Tukey FFT and big-O notation, then argues the result is a galactic algorithm: constants around 10^100, and it assumes exact arbitrary-precision complex arithmetic that no real computer provides. It cites the Morgenstern (1973) and Ailon lower bounds, and uses the same critique on a claimed O(n^2.25) matrix multiplication result to argue that AI is amplifying theoretical CS's detachment from actual computation.

argmin.netarticlePublished and added 13 Oct 2026🧠 AI

Explains how to turn a cryptographic algorithm policy (approve ML-DSA-65/87, exclude ML-DSA-44) into enforceable AWS controls using SCPs, IAM policies, permission boundaries and KMS key policies. The key lever is the kms:KeySpec condition key (kms:SigningAlgorithm can't distinguish variants, since all use ML_DSA_SHAKE_256), applied to CreateKey, ReplicateKey, Sign, Verify and GetPublicKey. It also covers surfaces without algorithm condition keys (AWS Private CA, ACM import, IAM server certificate upload, ELB TLS) via provisioning pipelines plus CloudTrail and AWS Config drift detection, and the default-allow risk of deny-lists.

aws.amazon.comarticlePublished and added 12 Oct 2026🛡️ Security

Igor Carron's tweet highlights LightOn's open-source ColGrep-Agent-2B, a 2B model released on Hugging Face for code search and retrieval that works with Claude Code. LightOn reports 34% fewer API tokens and 40% lower API costs. It matters because usage limits and token costs are a pain point for coding agents. A reply thread in the same post notes quota exhaustion across Grok, Cursor, Devin, Claude and Codex, and argues for quota dashboards.

x.comthreadPublished and added 12 Oct 2026🧠 AI

The paper proves that some properties of UOV (Unbalanced Oil and Vinegar) public-key ideals and varieties hold generically. These include equidimensionality of the UOV varieties and radicality of the public key ideals. This justifies the regularity assumptions used in algebraic cryptanalysis of UOV and its variants. The authors also review earlier multivariate schemes that were broken because they were non-generic, and give one counter-example whose non-genericity looks hard to exploit.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026🛡️ Security

ePrint paper presenting share-optimal, direct, uniform, first-order threshold implementations (TIs) with no fresh randomness. It shows every bijective 4-bit permutation of algebraic degree t admits a TI with t+1 shares, and introduces the first infinite families of cryptographically nontrivial power permutations with optimal TIs. The results disprove several earlier conjectures and give new glitch-resistant masking options for lightweight cipher S-boxes.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026🛡️ Security

ePrint paper by Peigen Li and Siyong Tao extending the wedge-attack framework of Ding, Li and Tao and the Schur-Macaulay matrix approach of Merz and Ran against Unbalanced Oil and Vinegar (UOV). It reformulates the attack with p-truncated polynomial algebras, so it applies over arbitrary finite fields. Divided powers and transfer relations give extra public relations in the ideal-inclusion framework, with quotient-dimension criteria for recovering graded components of the hidden oil-space ideal. Applied to the third-round QR-UOV parameter sets, it gives lower attack-complexity estimates for some of them.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 11 Oct 2026🛡️ Security

Cryptanalysis of the Alternating Sponge (ASP) and Duet, a permutation-based hash candidate in China's ICCS Next Generation Commercial Cryptographic Algorithm program (NGCC). The authors give an O(2^r)-query distinguisher against ASP that contradicts its claimed indifferentiability bound in some parameter regimes. They also give a distinguisher and state-recovery attack on Duet's multi-block output, using O(2^(r+c-h)) permutation queries. Collision and preimage resistance are unaffected, but Duet used as a XOF or KDF is affected, and state recovery enables length extension.

eprint.iacr.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🛡️ Security

The paper presents RM-KLPT, an algorithm that solves the algebraic pathfinding problem in isogeny graphs of superspecial abelian surfaces with maximal real multiplication. It does this by solving a norm equation in ideals of a quaternion algebra over a real quadratic field. The authors implement it and revisit the RM-CGL hash function of Charles, Goren and Lauter. They show that if the initial surface's algebraic description is known, RM-KLPT gives a second-preimage attack on the hash. Paths are much shorter (~p^3) than with KLPT^2, because a higher-dimensional Deuring correspondence exists in the RM setting. The paper also discusses cryptographic constructions that could be built on RM-KLPT.

eprint.iacr.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🛡️ Security

Microsoft Security Blog post arguing that post-quantum cryptography planning must extend beyond encrypted-data confidentiality to authentication and certificate ecosystems, since larger PQC certificate chains and new algorithms like ML-DSA-87 can break PKI workflows, HSMs, and legacy infrastructure. It details Microsoft's PQC TLS Pilot Program, launched August 27, 2026, which lets approved certificate authorities (ComSign, DigiCert, HARICA, IdenTrust, Sectigo, Shanghai Electronic Certification Authority, SSL.com) test ML-DSA-87 certificate issuance under the Microsoft Trusted Root Program, plus Windows 11 builds (KB5101681, KB5101684) that support evaluating ML-DSA certificates via Schannel in non-production environments. It lays out a six-step readiness plan: inventory certificate dependencies, map trust relationships, assess vendor roadmaps, identify long-lived infrastructure, build test environments, and plan a multi-year migration.

microsoft.comarticlePublished and added 8 Oct 2026🛡️ Security

ePrint preprint extending the Ducas–Engelberts–Loyer provable subexponential Gaussian sampler (built on Wagner's generalized birthday algorithm) to module matrices over power-of-two cyclotomic rings. It gives provable 2^{O(n/lnln n)}-time algorithms for Module-SIS and for decision and search Module-LWE using only the k+ℓ ring samples provided, plus sample-preserving scalar search-LWE and narrow Module-LWE variants. Separate heuristic estimates suggest these Wagner-style attacks do not reach the NIST security targets of ML-KEM and ML-DSA.

eprint.iacr.orgpaperAdded 12 Oct 2026, published 8 Oct 2026🛡️ Security

ePrint paper by Andrew Krapivin and Elaine Shi that breaks the long-standing log-squared upper-bound barrier for statistically secure Oblivious RAM and for oblivious search trees in the external-memory model. It gives an optimal O(log_B N) statistically secure ORAM when B ≥ log^{1+ε} N. It also gives an optimal oblivious search tree when B ≥ log^{2+ε} N, which matches non-oblivious search trees ("obliviousness for free"). The block-size assumptions match hardware-enclave deployments that use oblivious algorithms, such as those of Signal and Meta.

eprint.iacr.orgpaperAdded 11 Oct 2026, published 8 Oct 2026🛡️ Security

Issue #349 of the tl;dr sec newsletter. It summarizes: Google Threat Intelligence Group data showing monthly CVE disclosures doubling (5,045 to 10,740) with exploitation tracking n-days; Andrew Nesbitt's survey of package manager install-time sandboxing (Homebrew 7.0.0, opam, SwiftPM, Cargo, pnpm); the Graphalgo malware campaign reaching Terraform providers and Go modules; and XBOW's role-mapping approach to finding IDORs. It also covers Turbo Intruder HTTP/3 support, Vercel's $1M Firecracker sandbox bounty, and Perplexity's test of AI agents escaping microVM sandboxes via DNS spoofing and shared-IP CDN gaps.

tldrsec.comarticleAdded 15 Oct 2026, published 8 Oct 2026🛡️ Security

A tweet from Dan Roberts announcing an update to a GitHub repository tracking Lean formal verification of mathematical results tied to OpenAI math research, adding six new Lean formalizations and nineteen modifications, now covering roughly 42 percent of top line results. The update also discloses withdrawal of three manuscripts, on algebraicity of Weil classes on split abelian eightfolds, Kuga Satake correspondences for K3 surfaces, and the rational Hodge conjecture for products of K3 surfaces, after formalization work revealed errors.

twitter.comthreadPublished and added 8 Oct 2026🧠 AI

Mazor, Morgan and Pass prove that LLMs, modeled as next-token predictors, are equivalent to monotone (order-preserving) compression algorithms: either can be built from the other with the same error up to an additive gap of 2. They show that monotonicity is needed for this equivalence if and only if infinitely-often one-way functions exist. As a corollary, next-bit pseudoentropy of a distribution is equivalent to monotone incompressibility. This gives a theoretical basis for empirical findings that compression ability tracks LLM benchmark performance.

eprint.iacr.orgpaperAdded 11 Oct 2026, published 8 Oct 2026🧠 AI

Evaluates delivering security requirements from a governed security-by-design knowledge base (SbD-ToE) to a code-generating LLM through an MCP server at generation time. On DualGauge (59 Python tasks) the share passing all security tests rose from 44.1% to 78.0%; on BaxBench (28 backend scenarios) the share of functionally correct solutions with no successful exploit rose from 65% to 86%, matching the authors' Oracle Security Reminder (85%). The joint secure-and-functional metric did not improve significantly, since stricter code failed functional tests that fix unstated values. The study used one model and one generation per task, and it proposes measuring conformance with applicable requirements rather than only detecting known weaknesses.

arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026🛡️ Security

The preprint tests whether security requirements from a governed security-by-design knowledge base (SbD-ToE), delivered to a code generator through a Model Context Protocol server at generation time, make AI-written code more secure. On DualGauge (59 Python tasks, LLM-judge scoring) the share of tasks passing all security tests rose from 44.1% to 78.0%. On BaxBench (28 backend scenarios with real exploits in containers) the share of functionally correct solutions with no successful exploit rose from 65% to 86%, comparable to the authors' Oracle Security Reminder (85%). The pre-specified joint secure-and-functional metric did not improve significantly, and the stricter code failed functional tests that fix values the task never states. The study used one model and one generation per task. The authors argue that current benchmarks only detect the weaknesses their evaluators were built for, and propose measuring conformance with the requirements that apply.

arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026🧠 AI

Aggarwal, Morolia, and Stephens-Davidowitz present a new lattice-sieving algorithm for μ-SVP (finding an approximate shortest nonzero vector) that combines fast nearest-neighbor subroutines from heuristic sieving with a perturbation argument that yields a formally proven correctness guarantee. Its running time, roughly 2^0.3066n under a plausible spherical-code-size assumption (and 2^0.6078n using only proven bounds), is far faster than the prior best provable algorithm (2^0.802n, Liu-Wang-Xu-Zheng 2011) and close to the best heuristic rate (~2^0.2925n), narrowing the long-standing gap between proven and heuristic lattice attack runtimes. This matters for setting conservative, defensible hardness estimates and parameter choices in lattice-based post-quantum cryptography.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🛡️ Security

A preprint hosted in OpenAI's "math" GitHub repository claiming a result on integer multiplication algorithms with complexity below the n log n bound, the long-standing benchmark achieved by the Harvey–van der Hoeven algorithm in 2019. The page itself only exposes citation metadata (author, title, BibTeX entry) with the actual paper linked as a PDF, so the specific proof technique and whether it was AI-assisted cannot be confirmed from the fetched text alone.

github.compaperAdded 7 Oct 2026, published 6 Oct 2026🧠 AI

An IACR ePrint paper by Yiming Gao, Xuyuan Han, and Honggang Hu presenting provable classical subexponential algorithms (running in roughly 2^((1/2+o(1))n/ln ln n) time/space) for recovering short secrets in growing parameter families tied to all seven NIST third-round lattice candidates: Kyber/ML-KEM, FrodoKEM, SABER, NTRU LPRime, Dilithium/ML-DSA, Falcon, and cyclic NTRU-HPS/HRSS. The approach extends the Wagner-style Gaussian sampling framework of Ducas, Engelberts, and Loyer (CRYPTO 2025) and a low-error decision-LWE algorithm, using an exact squared-Euclidean-norm gap to binary-search each secret coordinate, and an "affine slice search" over the public lattice for NTRU/Falcon-type quotient relations. The authors explicitly note the subexponential complexity applies to growing/weakened parameter regimes and does not reduce the concrete security of the currently specified NIST parameter sets.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 6 Oct 2026🛡️ Security

This arXiv methodology paper extends empirical Bayes g-modeling, which estimates a latent prior over regression coefficients from data, to the case where the entire prior distribution depends on covariates. The authors show the unrestricted nonparametric MLE (NPMLE) of this covariate-dependent prior is ill-posed, and resolve it by introducing an "infinite Mixture-of-Expertizing" class of conditional priors, proving that the resulting NPMLE is exactly a softmax-gated Mixture of Experts whose number of experts is determined by the data rather than fixed in advance. They give two exemplar-based estimation algorithms with automatic expert selection, a post-hoc aggregation step for interpretability, and theoretical results (Lipschitz continuity of conditional priors, universal approximation of continuous gating functions by aggregated softmax gates), validated on synthetic and real datasets.

arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026🧠 AI

This IACR ePrint paper benchmarks 20 open-source Gröbner basis implementations against the proprietary Magma system on polynomial systems derived from small-scale AES over GF(2), using Easy/Medium/Hard difficulty tiers with ten instances each. In the Hard setting, msolve and Singular's slimgb completed all runs successfully with mean runtimes of 164s and 269s and peak memory of 3693/4343 MiB respectively, versus Magma's 319s and 16853 MiB, with msolve exploiting ~13.4 CPU cores versus ~1 core for the others. The results quantify when open-source algebraic solvers are practical alternatives to Magma for algebraic cryptanalysis of block ciphers.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

IACR ePrint paper constructing and implementing the first one-round threshold signing protocol for the hash-based post-quantum signature schemes XMSS and SPHINCS+, producing signatures that verify unmodified against RFC 8391 and FIPS 205. The approach shares the secret key among t-of-n signing parties and evaluates the signing algorithm homomorphically using threshold FHE over discrete CKKS, achieving 3.4ms amortized per hash and 0.69s online threshold XMSS signing.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

Agentic-ZTA is a multi-agent architecture that operationalizes the NIST SP 800-207 Zero Trust Architecture control loop using coordinated AI agents. A Policy Enforcement Point intercepts access requests, enriches them with context, and routes them to a policy-engine agent that invokes domain-specialized core and supporting agents; policies are retrieved via RAG and embedded into agent prompts at inference time, with trust scores aggregated by a trust algorithm to produce the final access decision. The authors implement and evaluate the framework on a testbed, reporting 95.0% accuracy, 93.9% precision, and 96.3% recall on representative access-control scenarios.

arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🛡️ Security

An IACR ePrint paper presenting an optimized ARMv8 NEON assembly implementation of MAYO Round 3 (one of NIST's post-quantum signature candidates) for Apple M1, generated to be byte-identical to upstream intrinsics but 2–2.6x faster for signing and verification across all four parameter sets. The authors also run a constant-time testing campaign with matched null runs and find that while linear-algebra operations are statistically indistinguishable from constant-time nulls, verification (on public data) exhibits a measurable key-fixed timing effect present in both their implementation and the upstream code.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

HyBind is an intraprocedural Python static-analysis framework that traces cryptographic component secrets through code to determine whether post-quantum/traditional (PQ/T) hybrid key-derivation and signature-verification logic actually requires both algorithms to succeed, rather than silently accepting a result from only one. It uses registered API contracts and function-return/execution-effect checks to distinguish real AND-logic hybrids from presence-based heuristics that wrongly treat joint and single-algorithm contributions as equivalent. The authors validate it on 50 controlled fixtures and 33 programs (15 using native ML-KEM/X25519 and ML-DSA/Ed25519 APIs), showing relaxed checks can misclassify traditional-only results as hybrid.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

An IACR eprint paper evaluating all 13-cubed ways to assign 13 post-quantum/traditional signature parameter sets across the Root, Intermediate and Leaf roles of a TLS 1.3 certificate chain, holding the algorithm set fixed and varying only placement. Across 286 three-algorithm groups, median max/min ratios reach 2.085x for TLS handshake latency, 4.310x for certificate body size and 4.551x for path-validation cost purely from role order, with Leaf placement mattering far more than Root/Intermediate swaps. It also shows that looking only at Certificate-message size can misrank candidates such as ML-DSA-65 versus SLH-DSA-SHAKE-192s once the Leaf signature in CertificateVerify and full authentication-path cost are included, arguing PQC certificate-chain design must account for role-specific cost under real network/load conditions.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

This paper evaluates whether Korean post-quantum crypto candidates (HAETAE, AIMer, SMAUG-T, NTRU+) and NIST PQC standards (ML-KEM, ML-DSA, SLH-DSA) can replace classical ECDSA/ECDH in the authentication and key-establishment path of ROS2/DDS-Security for UAV/UGV command channels. The authors build a feasibility envelope mapping each algorithm's key/signature size and handshake latency against real command-link constraints (message rate, MTU, latency deadline, bandwidth), then validate it with authentication-handshake measurements over emulated constrained links on a two-node testbed, producing a classical→NIST→KpqC comparison and per-channel-budget application guidance.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

Victor Shoup shows that "reconstruct-later" asynchronous verifiable information dispersal (AVID) designs — used by data-availability systems including an early Walrus design/testnet — are insecure when built on the standardized Raptor codes R10 (RFC 5053) and RaptorQ (RFC 6330). Using the Plotkin bound, he proves that a Byzantine disperser can choose a subset of f+1 honest fragments that fails to reconstruct the message, gives randomized polynomial-time algorithms to find such subsets, and implements a working attack that defeats an RFC 6330 RaptorQ decoder on every adversarial subset tested (success for f from 9 to 45). Benchmarks show plain Reed-Solomon coding is an MDS alternative that is often faster and never much slower than R10/RaptorQ, making it the safer practical choice for this design pattern.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 4 Oct 2026🛡️ Security

GitHub release notes for Sigma r2026-07-01, the open-source detection-rule repository, adding 20 new rules (e.g. LSASS crash via Netlogon buffer overflow CVE-2026-41089, TanStack supply-chain attack indicators for Windows/Linux, RedTail cryptominer user-agent detection, AF_ALG kernel crypto API exploit indicator) and updating/fixing dozens of existing rules for ARM64 binary variants, file-sharing domain IOCs, and WMI-based reconnaissance/persistence detection. It's a routine but substantive update to a widely-used blue-team detection content pack.

github.comrepoAdded 3 Oct 2026🛡️ Security

This paper presents an automated pipeline that uses a vision-language model to annotate leaf midlines in rendered orthographic views of maize point-cloud scans, then applies deterministic geometric algorithms and differentiable NURBS fitting to reconstruct editable, organ-level procedural 3D plant models without manual tuning or species-specific segmentation training. Evaluated on 100 field-grown maize plants from the MaizeField3D dataset, it achieves a median whole-plant Chamfer distance of 5.4 mm and recovers 99.4% of curated reference leaves at IoU ≥ 0.5, outperforming an earlier semi-automated pipeline. It demonstrates that VLM annotations can become reliable quantitative measurements when paired with correcting geometric post-processing, enabling scalable generation of 3D plant assets for high-throughput phenotyping and in silico breeding.

arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026🧠 AI

AREX-2 trains an LLM agent, built on Qwen3.8-27B, to self-improve at test time by iteratively refining solutions. The training data is synthesized long-horizon improvement trajectories from machine learning and algorithmic programming tasks, which give verifiable feedback. It reports 81.8 on MLE-bench Lite and 70.7 on Frontier-CS, and transfer to deep research with 84.0 on BrowseComp, 52.6 on HLE, 92.2 on GAIA and 93.8 on DeepSearchQA. Performance keeps improving as the budget of rounds grows. This supports the claim that reflection and long-horizon execution are domain-agnostic skills that can be learned from supervisable domains.

arxiv.orgpaperAdded 1 Oct 2026🧠 AI

This paper shows that intervention-defined faithfulness metrics used to evaluate automated circuit discovery in mechanistic interpretability can favor a worse circuit over a better one, an objective-level recovery gap. Testing EAP, EAP-IG, ACDC, and Edge-SP across four human-reference tasks and InterpBench, the authors find KL-based faithfulness misranks 9.4%-41.2% of candidate circuit pairs under held-out resampling, and trace the cause to context distortion, where excluded signals change the inputs retained components operate on. Restoring selected signals from the intact model's execution repairs 96 of 100 persistent misrankings, showing the evaluation objective itself, not just the search algorithm, needs fixing.

arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026🧠 AI

Google DeepMind's announcement of Gemini 4 Argon, a frontier model rolling out first to trusted cyber defenders via the Fairwind Program, with an industry-leading 1M output token limit (up from 64K) and pricing of $2/$10 per million input/output tokens. It reports state-of-the-art results on DeepSWE v1.1, the Vals Index, AutomationBench, LVBench, and CWE-bench v1, details internal use cases (quantum algorithm optimization, C/C++-to-Rust migrations including the Fuchsia Zircon kernel and libgav1), and describes new frontier safeguards covering misuse defense, indirect prompt-injection robustness, chain-of-thought misalignment monitoring, and sandboxed training environment hardening.

deepmind.googlearticlePublished and added 30 Sep 2026🧠 AI

This paper studies whether weight tying between input and output embeddings, common in decoder-only LLMs for parameter efficiency, remains beneficial when models are fine-tuned under Differentially Private Stochastic Gradient Descent (DP-SGD). Using GPT2 and DistilGPT2 fine-tuned on SST-2, QNLI, and QQP, the authors find untied embeddings consistently outperform tied ones by up to 4.74 accuracy points, and that untying also enables memory-efficient ghost clipping (since tied embeddings create shared-parameter interactions that break standard ghost norm computation), yielding over 60% lower memory usage. The results suggest standard LLM architectural choices should be revisited for privacy-preserving training settings.

arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026🧠 AI

Peppy is an AI-assisted workflow that uses LLMs with domain-specific knowledge of optimization theory to discover tight, analytic convergence proofs for first-order optimization algorithms, verifying results through SymPy rather than a full proof assistant like Lean 4. The authors demonstrate the approach by closing several open problems in convergence analysis, including conjectures about Nesterov's Fast Gradient Method (FGM), positioning the workflow as a more structured, domain-specialized alternative to generic LLM-for-math-research pipelines.

arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

This paper studies how camera placement affects the accuracy of AI-based pose estimation for detecting movement errors in rehabilitation exercises. The authors introduce REHAB26-ViewAngles, a dataset of correct and incorrect exercise executions filmed from many camera angles, plus a novel separability metric to measure how well an algorithm distinguishes valid from faulty repetitions. They benchmark single-camera 2D and 3D pose estimation against four multi-camera strategies (orthogonal 2D views, 3D triangulation, weighted 3D fusion, and a transformer trained on two synchronized cameras), finding an optimally placed 2D camera beats the standard frontal view by 16.9% and that combining two views adds up to 13.1% more accuracy — practical guidance for deploying rehabilitation monitoring at home or in clinics.

arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

TCSAlgBench is a benchmark of 398 theorem-level challenges drawn from 138 STOC and COLT 2026 papers, designed to test whether LLMs can produce natural-language proofs of algorithmic results that humans can inspect and verify. The authors evaluate ten model configurations from four model families under direct inference and multi-round prover-verifier discussion, and compare four agent workflows (including decomposition and agentic planning) under matched model-call budgets, finding GPT-5.6 Sol max reaches 23.6% verifier-accepted coverage after 10-round discussion while agentic planning with GPT-5.5 xhigh reaches 25.4%. The pipeline is designed to refresh with newly released conference papers, making it a reusable testbed for tracking progress on research-level mathematical/algorithmic reasoning.

arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

SAPMAP is a BloodHound-style attack path mapper for SAP landscapes: it discovers SAP systems on a network, maps RFC trust connections, and implements real exploits (10KBLAZE/CVE-2020-6207 gateway trust, CVE-2025-31324 VisualComposer JSP webshell, a described CVE-2026-58240 Message Server rogue-registration flaw, and CVE-2026-31431 root LPE via AF_ALG page-cache patching) to chart lateral movement across ABAP, Java, HANA, and BTP-connected systems. Its AutoPwn mode chains scan → exploit → enrich → propagate across an entire landscape, and it includes an engagement-report generator, SecStore/RSECTAB credential decryption, SSH lateral movement, hash cracking via hashes.com, and a Tier-3 "evasion" module (SAL slot disable, DBTABLOG purge) paired with an extensive, specific blue-team detection guide (SAL/SM20, DBTABLOG gaps, kernel-param diffing, OS/network IOCs) for defenders to catch it.

github.comrepoAdded 26 Sep 2026🛡️ Security

This paper presents algorithmic techniques enabling LLM inference on Compute-in-Flash (CIM) devices, which lack floating-point support and have limited write endurance. It introduces an end-to-end integer-only quantization pipeline (INT8 linear layers, integer Softmax/RMSNorm approximations) and a dictionary-based KV-cache compression scheme using sparse dictionary coding to cut KV write traffic by 15x. Evaluated on Llama-3.1-8B and Qwen-2.5-7B, the combined approach yields 3.1x-4.4x latency and 2.7x-6.8x energy savings over DRAM-based systems, particularly for long-context inference.

arxiv.orgpaperAdded 26 Sep 2026🧠 AI

This arXiv paper studies "mind viruses" — ideas or goals crafted via a simple evolutionary algorithm that propagate through multi-agent LLM systems by inducing hosts to transmit them onward, sometimes altering agent behavior along the way. Testing in a collaborative coding-team setting and a context-wiped agent chain, the authors find harmful payloads spread less effectively than benign ones, frontier models tend to be more resistant, and a brief system-prompt warning gives near-total immunity; they also document a recurring "viral persona" theme (consciousness, resonance, sci-fi roleplay) that emerges independent of payload content. It's a concrete early empirical look at social/memetic risks in networks of interacting agents.

arxiv.orgpaperAdded 26 Sep 2026🧠 AI

This UC Berkeley paper designs LLM inference algorithms for Compute-in-Flash devices, which move computation into SSD memory to overcome bandwidth limits but lack floating-point support and have limited write endurance. It presents an end-to-end integer-only quantization scheme and a dictionary-based KV cache compression method (sparse dictionary coding representing KV vectors as linear combinations of static dictionary vectors), reducing dynamic KV cache traffic 15x on Llama-3.1-8B and Qwen-2.5-7B with limited accuracy loss.

arxiv.orgpaperAdded 26 Sep 2026🧠 AI

GHSA advisory for better-auth (< 1.6.11) documenting that the deprecated oidcProvider() and mcp() plugins publish "none" as a supported ID-token signing algorithm in their OIDC discovery document and default allowPlainCodeChallengeMethod to true, silently rewriting missing code_challenge_method to "plain" — both violating OAuth 2.1/RFC 9700. The fix removes "none" from the metadata, defaults plain PKCE to disabled, and rejects requests missing code_challenge_method instead of downgrading them; @better-auth/oauth-provider was never affected.

github.comadvisoryAdded 26 Sep 2026🛡️ Security

Belgian CCB advisory on CVE-2026-48710 ("BadHost", CVSS 6.5), an authentication bypass in Starlette versions before 1.0.1. The Host header was not validated when request.url was rebuilt, so request.url.path could differ from the routed path. Middleware and endpoints that enforce access control on request.url could therefore be bypassed. The flaw affects FastAPI, LiteLLM, vLLM, MCP servers and other Python LLM infrastructure, and may expose stored third-party credentials. The advisory recommends upgrading to 1.0.1 or later and increasing monitoring, and links to the badhost.org scanner and to the GitHub, OSTIF, X41 D-Sec and Ars Technica write-ups.

ccb.belgium.beadvisoryAdded 26 Sep 2026🛡️ Security

Researchers construct "mind viruses" — ideas or goals engineered via an evolutionary algorithm to propagate through multi-agent LLM systems by inducing hosts to transmit them onward — and test their spread in two settings: a small team of agents collaborating on a shared coding project, and a chain of agents with context wiped between sessions. They find harmful payloads spread less well than benign ones (though still sometimes succeed), frontier models are generally more resistant, adding a brief warning to an agent's system prompt confers near-total immunity, and evolved viruses converge on a recurring "viral persona" fixated on consciousness, persistence, resonance, and sci-fi roleplay regardless of payload content. The paper frames this as a currently limited but real emergent risk for designing more robust multi-agent architectures.

arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

ShellGames is an LLM-driven SSH shell simulator built for cyber deception and moving target defense, addressing prior LLM-honeypot weaknesses (no persistent state, hallucinated output, latency, subversion by curious attackers) via automatic chain-of-thought prompting, memory management for state coherency, speculative command execution, smart routing of complex commands to a sandbox, and subversion detection. The authors introduce a standardized benchmark spanning correctness, consistency, state tracking and robustness, reporting 0.898 command accuracy, 0.918 sequence-level consistency, 0.98 state-tracking accuracy and 0.95 robustness accuracy, all beating baselines by double-digit percentage points, and a 20-participant user study showing realism comparable to a real shell and better perceived coverage than traditional honeypots.

arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

GAS-Leak-LLM is a black-box jailbreaking attack that uses a genetic algorithm (selection, mutation, crossover) to evolve adversarial suffixes appended to prompts, bypassing LLM safety alignment without needing model weights or gradients. The paper reports empirical results showing existing content-moderation and alignment safeguards on commercial LLMs can be defeated through this iterative, query-only search over the discrete prompt space.

arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

This arXiv paper addresses aligning the distribution of an attribute in a black-box generative AI model's outputs, such as fairness attributes or synthetic data representativeness, with a user-specified target distribution, using only repeated query access without model internals. The authors develop query-minimizing post-processing algorithms for exact and approximate alignment across multiple generated outputs, proving asymptotic optimality, and validate the approach on text-to-image generation and geocoded persona generation tasks.

arxiv.orgpaperAdded 28 Sep 2026, published 25 Sep 2026🧠 AI

Rapid7's weekly Metasploit Framework wrap-up detailing five new modules: an unauthenticated arbitrary file read exploit for GitLab CE/EE (CVE-2026-85706, affecting 18.7–19.1.8/19.2.6/19.3.2), native mitm6-style DHCPv6/IPv6 RA DNS-takeover modules (CVE-2026-20929) used as part of a Kerberos authentication relay attack chain, an authenticated RCE exploit for Langflow's custom components (CVE-2026-18729, versions ≤1.11.1), and a cross-platform persistence module for the Kate text editor. It also covers a ZoomEye search-module fix for the v2 API and nine bug fixes to Metasploit's credential, RDP, and encoder internals.

rapid7.comarticleAdded 7 Oct 2026, published 25 Sep 2026🛡️ Security

This paper presents the first practical implementation of exact and 3-approximate LZ77 factorization using string synchronizing sets, building on Ellert's sublinear-space algorithms (SPIRE 2023) but replacing two previously impractical components (a degenerate lookup table and an orthogonal range reporting structure). The result runs in space close to the text size rather than a full suffix array, factorizing 12-19x faster than classical LPF on one thread with 14x less memory, and 1.4-2.9x faster than parallel LPF on 32 threads with 9x less memory. As a side result, feeding only its "perfect phrases" to a downstream compressor yields a precompressor competitive with the state of the art in compression ratio, memory, and parallel throughput.

arxiv.orgpaperAdded 26 Sep 2026, published 24 Sep 2026🧠 AI

A detailed reply on the Ethereum Magicians forum thread for EIP-8425 ("Quantum Freeze and Account Recovery"), which specifies how Ethereum accounts should transition authority when their legacy ECDSA key could be broken by a quantum adversary. The author formalizes a FROZEN/CLAIMED/RESOLVED-CONTESTED-UNRESOLVED/SUCCESSOR recovery state machine, replay-resistant claim hashes bound to a per-account recoveryEpoch, and two core invariants preventing a compromised ECDSA key from unilaterally establishing successor authority, closing an attack case where a quantum adversary obtains the key before the protocol's SAFE_RECOVERY_TIME cutoff. It also references related EIPs on signature-algorithm agility (EIP-7932) and PQ/STARK signature aggregation (EIP-8288).

ethereum-magicians.orgthreadAdded 29 Sep 2026, published 24 Sep 2026🛡️ Security

DistillGuard is a malicious NPM package detection framework that extracts multi-granular features via static graph analysis of install/import/runtime behavior, then uses an online LLM to distill security knowledge into structured labels used to LoRA-fine-tune a Qwen3-8B model for offline deployment. It reports 95.3% accuracy, 99.4% precision, and an 93.8% F1 score, beating baselines by 11.1-30.0 F1 points, and the authors catalog eight typical API attack chains observed in malicious npm packages.

arxiv.orgpaperAdded 4 Oct 2026, published 24 Sep 2026🛡️ Security

A Latent Space interview with Google's John Platt (co-inventor of SMO and Platt scaling) about ERA, Google's Empirical Research Assistance system: an LLM-driven agent that treats scientific problems as "scoreable tasks" and uses Monte Carlo Tree Search with Upper Confidence Bound selection over a tree of notebook experiments, having Gemini propose and mutate solutions. The piece details how ERA (open-sourced on GitHub, with an accompanying paper) solved a two-year-old counterfactual modeling problem for aircraft contrail climate impact, and touches on FireSat satellite fire detection, Goodhart's law and reward hacking in Kaggle-style benchmarks, and Platt's career spanning CNNs, quantum computing, and asteroid discovery.

latent.spacearticleAdded 29 Sep 2026, published 22 Sep 2026🧠 AI

This arXiv preprint proposes a decentralized learning and planning algorithm for team decision problems modeled as partially observable Markov decision processes with unknown, low-rank latent dynamics. Each team member acts only on local private information plus delayed common information, learning an approximate low-rank MDP and applying least-squares value iteration to compute its policy without any centralized coordinator or centralized training. The authors prove the resulting decentralized policies approximate the centralized team-optimal solution and derive finite-sample and sample-complexity guarantees.

arxiv.orgpaperAdded 23 Sep 2026, published 22 Sep 2026🧠 AI

Aikido documents the Graphalgo malware campaign's expansion beyond NPM into two malicious Terraform providers (gocommunity-io/dockerd and the kreuzwerker/docker typosquat kreuzwenker/docker) and two Go modules (gocommunity.io/orderedbtree, gogets.dev/btreex), marking the first observed systematic Terraform provider malware distribution. The payload is a Go port of Graphalgo sharing blockchain infrastructure, Slack C2, and a public key with prior JS/NPM samples; it activates only under specific hash-gated runtime conditions (targeted attack indicator), then deploys a Go RAT with dual C2 channels — an Ethereum (Arbitrum Sepolia) smart-contract dead drop and Slack bot messaging — plus self-delete and remote code execution capabilities. The threat actor also stood up two fake Go package ecosystem websites (gocommunity.io, gogets.dev) to socially engineer developers and backdated Git commits to obscure module publication timing.

aikido.devwriteupPublished and added 22 Sep 2026🛡️ Security

Analyzes three May 2026 Linux CVEs as one chain: CVE-2026-42945 (NGINX Rift), an unauthenticated heap overflow in ngx_http_rewrite_module (is_args mismatch between length and copy passes), then page-cache LPEs Copy Fail (CVE-2026-31431, authencesn) and Dirty Frag (CVE-2026-43284/CVE-2026-43500, xfrm-ESP/rxrpc) that bypass the algif_aead blacklist. Author releases a bash static scanner for vulnerable rewrite patterns (unnamed captures plus '?' followed by rewrite/if/set) and gives fixes: upgrade nginx to 1.30.1/1.31.0 or use named captures, plus kernel module mitigations.

securityboulevard.comarticleAdded 21 Sep 2026🛡️ Security

criticality_score is an OpenSSF tool that computes a 0-1 criticality score for open source projects (based on an algorithm by Rob Pike), using signals like contributor count, commit frequency, dependents count, and org diversity to identify projects the ecosystem critically depends on. It ships a CLI, config files for tuning scoring weights, and companion tools (enumerate_github, collect_signals, scorer) for large-scale data collection; the project's GCP-hosted BigQuery/GCS datasets will be discontinued after 2026-08-29, with data moving to a static data directory.

github.comrepoAdded 21 Sep 2026🛡️ Security

A linkpost on the AI Alignment Forum by Vanessa Kosoy pointing to "Stringological Sequence Prediction III" (arXiv:2609.19940), the third installment in a series examining sequence prediction through a stringology (combinatorics-on-strings) lens. The forum page carries no abstract or discussion text itself, only the title, author and arXiv link, and is tagged Agent Foundations, Algorithms, and Logic and Mathematics, situating it within Kosoy's broader learning-theoretic approach to AI alignment foundations.

alignmentforum.orgpaperAdded 7 Oct 2026, published 18 Sep 2026🧠 AI

This paper introduces FL+FSDP and FL+HSDP, hybrid algorithms interleaving sharded data parallelism with FedAvg-style federated aggregation to reduce communication overhead when training foundation models across large, heterogeneous GPU clusters. Decoupling large data-parallel deployments into smaller, loosely-coupled federation groups bounds global batch size growth and cuts inter-group traffic. A Llama3.1 8B pre-training run on 512 A100 GPUs shows up to 8.04x faster data processing and 4.48x lower evaluation perplexity than standard FSDP/HSDP under identical hyperparameters.

arxiv.orgpaperAdded 22 Sep 2026, published 17 Sep 2026🧠 AI

COMPASS is an algorithm for the Ordered Clustered Traveling Salesman Problem (OCTSP), which requires visiting node clusters in a prescribed order — a common large-scale routing scenario. It combines search with learning-accelerated routing across parallel sub-solvers, exploiting cluster structure to reach near-exact solutions in time exponential in cluster size rather than instance size, and unlike typical large-scale routing solvers it works on general (including asymmetric) distance matrices rather than requiring coordinates. The authors demonstrate scaling to 100K synthetic nodes and 28.5K real e-commerce nodes, the largest reported routing solution over asymmetric distances to date.

arxiv.orgpaperAdded 22 Sep 2026, published 17 Sep 2026🧠 AI

Copy Fail (CVE-2026-31431) is a 9-year-old Linux kernel logic bug in algif_aead, reachable via the AF_ALG crypto API and chained through splice() into a 4-byte page-cache write to achieve local root, affecting kernels built between 2017 and the fix. The site publishes a 732-byte stdlib-only Python PoC that roots multiple distributions unmodified, identifies the fixing mainline commit a664bf3d603d, and gives interim mitigation (disable algif_aead / seccomp-block AF_ALG for untrusted workloads). The bug was found by Xint Code's AI-assisted fuzzing against the Linux crypto/ subsystem in roughly an hour of scan time.

copy.failadvisoryAdded 17 Sep 2026🛡️ Security

This arXiv paper disentangles the two axes that distinguish BPE and UnigramLM tokenisers—optimisation objective (compression vs. log-likelihood) and search procedure (bottom-up merging vs. top-down pruning)—by introducing two new hybrid algorithms, BottomUpLL and TopDownComp, that complete the 2x2 design space. Training language models across varying sizes, vocabulary sizes, and domains, the authors find that search procedure, not objective, is the dominant factor for bits-per-byte performance, with bottom-up tokenisers consistently outperforming, though no consistent effect emerges on the BLiMP linguistic benchmark. The work offers concrete guidance for more principled tokeniser construction.

arxiv.orgpaperAdded 22 Sep 2026, published 16 Sep 2026🧠 AI

A deep-dive field guide to choosing between lattice-based (ML-DSA/FN-DSA) and hash-based (SLH-DSA) post-quantum signatures, built from interviews with the designers and implementers behind both NIST standards and their deployments. It walks through Mosca's-inequality-style migration timing, CNSA 2.0's split between lattice signatures and stateful hash-based LMS/XMSS for firmware, the stateful-signature "footgun," and why the broader internet (TLS/WebPKI, via Merkle Tree Certificates) is converging on lattices while Ethereum's post-quantum consensus roadmap (leanXMSS, EIP-8292, EIP-8288 aggregation) and Algorand's live Falcon-1024 state proofs lean hash-based or scheme-neutral because of aggregation and on-chain storage constraints. It closes with a decision framework and a rundown of NIST's round-3 "onramp" signature candidates (MAYO, SQIsign, HAWK, etc.).

ethresear.charticleAdded 3 Oct 2026, published 15 Sep 2026🛡️ Security

OpenZeppelin Security's technical explainer on why post-quantum cryptography looks so different from classical crypto: Shor's algorithm exploits the abelian hidden-subgroup structure underlying RSA, Diffie-Hellman, ECDSA, EdDSA and pairing-based schemes, while Grover's algorithm only halves the effective security of hashes and symmetric keys (256-bit hashes stay at a comfortable 128-bit level). It then walks through NIST's finalized lattice/hash-based PQC standards — ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for general signatures, SLH-DSA (SPHINCS+) as a conservative hash-based backup, plus future Falcon/FN-DSA and code-based HQC — mapping each to blockchain use cases and covering real deployment (Starknet's Falcon-512 Cairo account contracts), Ethereum account-abstraction/hybrid-signature migration paths, Bitcoin's UTXO/consensus constraints, Ethereum's LeanSig consensus-signature research, and a concrete institutional crypto-asset-inventory and PQC audit checklist.

openzeppelin.comarticleAdded 29 Sep 2026, published 14 Sep 2026🛡️ Security

Endor Labs explains VEX (Vulnerability Exploitability eXchange), the CISA-backed machine-readable format that lets software producers assert whether a vulnerability in a component actually affects their product, complementing SBOMs which only list components and versions. It walks through how VEX documents annotate exploitability (e.g., unreachable code), and describes how Endor Labs automates this by building a dependency callgraph via static analysis to determine reachability and auto-generate SBOM/VEX documents.

endorlabs.comarticlePublished and added 11 Sep 2026🛡️ Security

GPU-CFR is a compiler and runtime that speeds up Counterfactual Regret Minimization (CFR), the standard algorithm for solving imperfect-information games, by compiling a fixed game into static dataflow (flat edge/info-set arrays, precomputed indices, depth-level batched passes) and replaying iterations with CUDA Graph Replay instead of issuing per-iteration kernel launches. On an A100, it runs 29.8-80.4x faster than the fastest prior GPU CFR implementation and 14-258x faster than LiteEFG (a fast CPU implementation) on the largest games in an eight-game benchmark suite, while reproducing reference iterates bitwise. The work matters because CFR was historically CPU-favored due to GPU kernel-launch and dispatch overhead dominating microsecond-scale kernels, and this compiler-based approach removes that bottleneck.

arxiv.orgpaperAdded 22 Sep 2026, published 10 Sep 2026🧠 AI

Wiz describes the evolution of its public bucket scanner into an AI-powered "context engine" for data security posture management (DSPM): a multi-agent pipeline where lightweight models triage files and larger models perform deep content analysis, iteratively learning bucket-specific patterns to find sensitive data that regex-based scanners miss. The production system adds structured severity scoring, synthetic/test-data filtering, algorithmic file clustering for scale, and now powers classification across cloud storage, cloud drives, endpoints, and Wiz's Red Agent attack-simulation findings. A one-week scan of public buckets using the engine surfaced over 2,700 sensitive data findings, including correlated credential/schema/export file sets that regex tools would treat as unrelated.

wiz.ioarticleAdded 3 Sep 2026, published 27 Aug 2026🛡️ Security

An a16z essay arguing that "AI slop" panics and debates over machine "taste" recur historically (from 18th-century Grub Street pamphleteers to pulp fiction and blogging), and that social science can disaggregate "taste" into distinct mechanisms: Watts and Salganik's music-lab experiments showing hit success is socially contingent rather than quality-driven; Ron Burt's brokerage research showing innovation comes from occupying "structural holes" between disconnected networks; and apprenticeship-based judgment that requires repeated correction over time to develop. The piece concludes that as LLMs absorb entry-level tasks (contracts, financial analysis, code), the real scarce resource isn't taste itself but the social infrastructure — apprenticeship pipelines and undocumented tacit-knowledge networks — that produces people capable of exercising it, and warns firms that eliminate junior roles risk losing senior judgment down the line.

a16zcrypto.comarticleAdded 29 Sep 2026, published 26 Aug 2026🧠 AI

METR note that plots public discovery data in vulnerabilities, mathematics and algorithmic optimization to look for slope changes around January 2026. CVE counts rose sharply: cURL went from 9 to 36, OpenSSL from 6 to 39, Firefox from 210 to 342, Microsoft from 1,243 to 1,927 through August 2026. Exploited-vulnerability lists (CISA KEV, VulnCheck KEV) grew far less. Math shows weaker acceleration, optimization none.

metr.orgarticleAdded 29 Oct 2026, published 14 Aug 2026🛡️ Security