Cover Image

On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wright, Craig Steven
Format:	Preprint
Published:	2025
Subjects:	Cryptography and Security Artificial Intelligence Distributed, Parallel, and Cluster Computing 68Q70, 68P25, 68T37 68Q70, 68P25, 68T37 68Q70, 68P25, 68T37 68Q70, 68P25, 68T37 F.4.3; D.4.6; E.3; I.2.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A novel approach to multi-image quantum encryption/decryption using qudits
by: Levaillant, Claire
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

The Complexity of Resilience for Digraph Queries
by: Bodirsky, Manuel, et al.
Published: (2026)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

Noncommutative rational Pólya series
by: Bell, Jason, et al.
Published: (2019)

A Hybrid Deep Learning and Anomaly Detection Framework for Real-Time Malicious URL Classification
by: Khaled, Berkani, et al.
Published: (2025)

A Novel Kuhnian Ontology for Epistemic Classification of STM Scholarly Articles
by: Saqr, Khalid M.
Published: (2020)

Teaching and Learning under Deductive Errors
by: Telle, Jan Arne, et al.
Published: (2026)

Density of rational languages under shift invariant measures
by: Berthé, Valérie, et al.
Published: (2025)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
by: Marković, Petar, et al.
Published: (2026)

Multipass automata and group word problems
by: Ceccherini-Silberstein, Tullio, et al.
Published: (2014)

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
by: Mantovanelli, Marco
Published: (2026)

Computational Complexity of Preferred Subset Repairs on Data-Graphs
by: Pardal, Nina, et al.
Published: (2024)

Looking for all solutions of the Max Atom Problem (MAP)
by: Truffet, Laurent
Published: (2024)

A polynomial Time Algorithm to Solve The Max-atom Problem
by: Lahlou, Chams, et al.
Published: (2021)

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
by: Abawonse, Olakunle S., et al.
Published: (2025)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

Deterministic Quantum Search via Recursive Oracle Expansion
by: Burke, John, et al.
Published: (2025)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
by: Alpay, Faruk, et al.
Published: (2026)

Optimized circuits for windowed modular arithmetic with applications to quantum attacks against RSA
by: Luongo, Alessandro, et al.
Published: (2025)

Measurement-based uncomputation of quantum circuits for modular arithmetic
by: Luongo, Alessandro, et al.
Published: (2024)

Further Applications of the Generalised Phase Kick-Back
by: Ossorio-Castillo, Joaquín, et al.
Published: (2024)

PCA and t-SNE analysis in the study of QAOA entangled and non-entangled mixing operators
by: Sarmina, Brian García, et al.
Published: (2023)

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

Rational Functions on the Projective Line from a Computational Viewpoint
by: Badr, Eslam, et al.
Published: (2025)

Polynomial definability in constraint languages with few subpowers
by: Bulín, Jakub, et al.
Published: (2023)

Neural Network Approximation: A View from Polytope Decomposition
by: Li, ZeYu, et al.
Published: (2026)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Ergodic Generative Flows
by: Brunswic, Leo Maxime, et al.
Published: (2025)

Quantum Advantage in Computational Chemistry?
by: Gundlach, Hans, et al.
Published: (2025)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

On fine fluctuations of the complexity of the QuickSelect algorithm
by: Ischebeck, Jasper, et al.
Published: (2024)