Search: “Procedural Graphs”

4 stories

Searchkeyword smart Sortlatest hot importance relevance

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

CategoryAll Malware 27 Vulnerability 23 Ransomware 19 Threat actor 11 Exploit / PoC 9 Policy & legal 6 Phishing & fraud 5 Research 4 Data breach 4 Advisory 2 Industry 2 AI industry 2 AI research 2 Tools 2

SeverityAll critical 32 high 43 medium 23 low 13 info 8

Atlas: Efficient Verifiable Semantic Search

Atlas delivers zero-knowledge proofs for HNSW semantic search, verifying RAG retrieval in under a second on SIFT1M and 2.0 seconds at 100M vectors.

Atlas lets a search provider prove that a query was answered correctly against a committed HNSW index without revealing the index, addressing provider deviations like truncation or bias. It combines offline preprocessing, a fixed-size-state restructuring of HNSW with a correctness proof, and timestep-tagged batching of per-step arguments. The system proves queries in under a second on SIFT1M and 2.0 seconds at 100 million vectors while preserving plaintext HNSW recall, and proven retrieval maintains end-to-end RAG answer quality at lower cost than prior verifiable retrieval systems.

arXiv cs.CRSep 10, 17:30 UTC · 5d agoResearch1

Amazon HealthLake enables healthcare organizations to store, transform, and query health data in the cloud

Help Net SecurityApr 20, 08:47 UTC · Apr 20, 2026Research

Decentralized network congestion control for DAG-based distributed ledger system

Researchers propose node-specific variable proof-of-work to curb transaction spamming in DAG-based distributed ledgers, proving a Nash equilibrium enforces prescribed node behavior.

The paper proposes a variable, behavior-based node-specific proof-of-work model for DAG-based distributed ledger networks, where congestion is mainly driven by transaction spamming rather than user growth or token launches. The model grants equal opportunity to stakeholders regardless of computational resources and penalizes nodes issuing more than a prescribed number of transactions. System behavior is modeled as a non-cooperative game over finite network resources, and the authors prove existence of a Nash equilibrium enforcing the prescribed behavior.

arXiv cs.CRSep 9, 09:48 UTC · 7d agoResearch

Friday Squid Blogging: Ram's Horn Squid Shells

Schneier on SecuritySep 17, 21:14 UTC · Sep 17, 2021Research