Image de couverture de livre

PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Condrey, David L.
Format:	Preprint
Publié:	2026
Sujets:	Cryptography and Security Distributed, Parallel, and Cluster Computing 94A60, 68Q17, 68Q25, 05C20 E.3; F.2.2; B.3.3; D.4.6
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains
par: Wright, Craig Steven
Publié: (2025)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
par: Böhnlein, Toni, et autres
Publié: (2024)

The Impact of Partial Computations on the Red-Blue Pebble Game
par: Papp, Pál András, et autres
Publié: (2025)

Gathering Semi-Synchronously Scheduled Two-State Robots
par: Otaka, Kohei, et autres
Publié: (2024)

Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds
par: Wright, Craig S
Publié: (2025)

Detecting and Mitigating SQL Injection Vulnerabilities in Web Applications
par: Neupane, Sagar
Publié: (2025)

Stochastic well-structured transition systems
par: Aspnes, James
Publié: (2025)

A Study of Performance Portability in Plasma Physics Simulations
par: Ruzicka, Josef, et autres
Publié: (2024)

FedPhD: Federated Pruning with Hierarchical Learning of Diffusion Models
par: Long, Qianyu, et autres
Publié: (2025)

Keys in the Weights: Transformer Authentication Using Model-Bound Latent Representations
par: Okatan, Ayşe S., et autres
Publié: (2025)

PROV-AGENT: Unified Provenance for Tracking AI Agent Interactions in Agentic Workflows
par: Souza, Renan, et autres
Publié: (2025)

Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
par: Charalambides, Neophytos, et autres
Publié: (2026)

Characterising resource management performance in Kubernetes
par: Medel, Víctor, et autres
Publié: (2024)

AEG: A Baremetal Framework for AI Acceleration via Direct Hardware Access in Heterogeneous Accelerators
par: Jiang, Hua, et autres
Publié: (2026)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
par: Cicirello, Vincent A.
Publié: (2017)

Method for determining the acceleration of a parallel specialised computer system based on Amdahl's law
par: Filipchenko, Aleksandr S.
Publié: (2024)

Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems
par: Kitamura, Naoki, et autres
Publié: (2025)

Computing Inductive Invariants of Regular Abstraction Frameworks
par: Czerner, Philipp, et autres
Publié: (2024)

Federated Domain Generalization with Data-free On-server Matching Gradient
par: Nguyen, Trong-Binh, et autres
Publié: (2025)

Clone What You Can't Steal: Black-Box LLM Replication via Logit Leakage and Distillation
par: Gharami, Kanchon, et autres
Publié: (2025)

Dynamic Memory Management on GPUs with SYCL
par: Standish, Russell K.
Publié: (2025)

Query-Aware Flow Diffusion for Graph-Based RAG with Retrieval Guarantees
par: Zhou, Zhuoping, et autres
Publié: (2026)

Source Known Identifiers: A Three-Tier Identity System for Distributed Applications
par: Kılıç, Duran Serkan
Publié: (2026)

Light Cone Consistency: Toward a Unified Theory of Consistency in Message-Passing Systems
par: Landers, Rob, et autres
Publié: (2026)

Improved Bounds for Coin Flipping, Leader Election, and Random Selection
par: Chattopadhyay, Eshan, et autres
Publié: (2025)

Emulation-Completeness of Programming Languages
par: Morse, Gregory, et autres
Publié: (2026)

CRDT-Based Game State Synchronization in Peer-to-Peer VR
par: Dantas, Abel, et autres
Publié: (2025)

Verifiable Fine-Tuning for LLMs: Zero-Knowledge Training Proofs Bound to Data Provenance and Policy
par: Akgul, Hasan, et autres
Publié: (2025)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
par: Opris, Andre, et autres
Publié: (2024)

From CRUD to Autonomous Agents: Formal Validation and Zero-Trust Security for Semantic Gateways in AI-Native Enterprise Systems
par: Peyrano, Ignacio
Publié: (2026)

Explicit separations between randomized and deterministic Number-on-Forehead communication
par: Kelley, Zander, et autres
Publié: (2023)

Scaling and Load-Balancing Equi-Joins
par: Metwally, Ahmed
Publié: (2022)

PIM-STM: Software Transactional Memory for Processing-In-Memory Systems
par: Lopes, André, et autres
Publié: (2024)

Differential Privacy: Gradient Leakage Attacks in Federated Learning Environments
par: Fernandez-de-Retana, Miguel, et autres
Publié: (2025)

Billion-scale Similarity Search Using a Hybrid Indexing Approach with Advanced Filtering
par: Emanuilov, Simeon, et autres
Publié: (2025)

On Channel Simulation with Causal Rejection Samplers
par: Goc, Daniel, et autres
Publié: (2024)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
par: van der Meyden, Ron
Publié: (2025)

zk-Agreements: A Privacy-Preserving Way to Establish Deterministic Trust in Confidential Agreements
par: Liu, To-Wen, et autres
Publié: (2025)

Quoridor is PSPACE-Complete
par: Drop, Marius, et autres
Publié: (2026)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
par: Shalunov, Yakov
Publié: (2023)