I am interested in the layering of escrow tech, Intel SGX is a good start.
After simple web swaps, the next protocol we saw was a mix of notaries, timeouts and SGX. SGX was used as a secure process, simply to hold a key and perform notary.
The next step is to compile to the cache, the protocol becomes a known, controlled operation of the Intel lookahead cache. Kernel exactly executes the protocol using the finite and closed set of kernel operations. This is coming, as the techies read this blog and get it. We got escrow routing in sandbox.
Closed and complete set of operations
The idea is simple. Only one instruction in the cache counts, the current selection. That instruction can only change the state of the system via one of a countable set of cache operations. For a whole class of contracts, trading sequences and protocols, this is a tedious, but explorable set of outcomes, cach pipeline control can be proved apriori.
Legally, this is great. It means that for any normal sequence of robotic trades, the contract has the clause: I understand all outcomes of this protocol. Legally this really greases the wheels, favoring the short protocols with simple ownership functions.
No comments:
Post a Comment