The model is a neutral Spectre compliant, unknown core. The provable contract can show the core thread nets to zero liability over all exits. All exits are accounted for with net liabilities determined by the path from root, which is uncovered by a public key of the participating counter party.
We have a name for this in old compiler theory, it is about assigning registers to minimize memory bandwidth. We know how to do it ex ante and run time. The trick is securing those paths, mostly by minimizing the risk of bunching with congestion markets, using pre-approved signatures. In compiler terms,those congestion market are the memory shufflers that tracks used and unused memory.
No comments:
Post a Comment