Backend
CoordX Types: A Trustless, Swappable Type System for Shared Records
arXiv cs.CR0 views
arXiv:2611.16128v2 Announce Type: replace Abstract: The CoordX Protocol carries signed and encrypted entries between parties. It proves who wrote each entry and who had permission to write it. It does not say what an entry means. That task belongs above the protocol layer. This paper describes the CoordX type system, the layer that gives entries a meaning. A type is a short document that says how to read one part of a shared record: which entries count, what each position means, what a party may do there, and what a party must do next. The type system has two key properties. It is trustless: a type is an ordinary signed object fixed by its digest, and every party evaluates it for itself over entries that the CoordX Protocol has already verified. No party has to trust a server, a registry or another party's software. It is swappable: a type names the interpreter it is written for, so many interpreters, of different capabilities and designs, can be used side by side in one record. We describe how to write type schemas, and we define the expressive power of the schema language. Payloads form a regular language. Entry structure forms a regular tree language. Every rule and every computed value is a total function in the primitive recursive class, so evaluation always halts. We compare this with KQML, FIPA-ACL and CBCL, and we relate it to language-theoretic security.
Source:https://arxiv.org/abs/2611.16128PreviousVerfGraph: Efficient Zero-Knowledge Verifiable Graph Query Evaluation SystemNextAdversarial Attacks on Downstream Weather Forecasting Models: Application to Tropical Cyclone Trajectory Prediction
Related posts
PRISM: Preference-based Reward and Uncertainty-Integrated Synthesis Minimization for RTL PPA Optimization
0arXiv cs.SE
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA
Watch Your Step: Adam's Margin Maximization Bias Depends on the Learning Rate Schedule
0arXiv stat.ML
Minimizing classical resources in variational measurement-based quantum computation for generative modeling
0arXiv stat.ML
Deep Multivariate Models with Parametric Conditionals
0arXiv stat.ML