Trinity Protocol, a developer of off-chain scaling solutions for the NEO and Ethereum blockchains, has proposed a new “Interweave Routing” algorithm for its nodes. The proposed routing algorithm comes in the midst of other development progress covered in its early December progress report.
Trinity has proposed a new pathfinding algorithm for the nodes of its network in order to balance the considerations of reliability, speed, and cost in its network communications. Trinity says that its proposed solution, called “Interweave Routing”, offers certain advantages. One such advantage is identical forward and reverse routing paths between nodes, which Trinity claims will improve the “user experience” on its network.
Another advantage of the proposed routing mechanism is that the “network topology,” or the layout of the network and network connections, becomes known to each individual node. This distribution of knowledge is said to increase the decentralization of the network.
Details of Trinity’s search algorithm to identify optimal pathways between nodes (including the mathematical formula used to select routes), as well as its node synchronization algorithm that reacts to nodes coming online or going offline, can be found in its proposal.
Trinity has been developing and debugging Simple Payment Verification (SPV) techniques for both its NEO and its Ethereum products. Although originally described by Satoshi Nakamoto in the Bitcoin whitepaper as a technique to improve the security of Bitcoin light wallets, SPV is a technique that can also be used to move assets across blockchains. When SPV proves that assets such as TNC are locked in one blockchain, such as NEO, a smart contract can make them available on another blockchain, such as Ethereum.
Tokens locked on one blockchain are available to circulate on the other blockchain, and vice versa. Because of this, an asset with a fixed supply can exist on multiple blockchains at once, and also transact between the chains.
Trinity’s updates and proposal can be viewed in full at the following links: