To help consumers quickly build, operate, and use scalable off-chain decentralized applications, #KDAG innovates on higher levels of abstraction: Application development framework (SDK) and runtime system. A set of king directed acyclic graphs (KDAGs) that conditionally depend on the state, and describe how the graph integrates with the state channel network. In order to support scenarios other than simple P2P communication, we establish a conditionally-dependent directed acyclic graph (DAG) state, where edges represent the dependency relationship between them.
The figure illustrates the system model, which is generalized data exchange. The channel in this network is the only protocol contract consistent with the state on the chain. The result of these on-chain state calculations depends on one or more conditional DAG node objects (for example, conditional object 2), which operate completely continuously and are enforced on-chain. What we want to emphasize is that these conditional data objects are not just simple time-hash lock transactions, but can be applied as conditions off-chain.
The contract generated by the contract can be relayed through multiple hope to achieve the final transmission result. In summary, the first layer is a simple time hash lock to ensure that the relay chain resolves the transmission bottleneck in a reasonable time. The second layer locks down the conditions that affect the results. Through these two layers of relay, the value transfer of information between application 1 and 2 is realized.