Chain of trust is based on a truly decentralized DAG data structure without a coordinator, without centralized advice, without any other centralized management. It consists of complete nodes, Double Spending Prevention Nodes (DSPs), trust evaluation records and history nodes. This allows for infinite scale, while at the same time encouraging users to complete transactions. The trust chain works by creating a level of trust on a DAG that is linked to a ranking mechanism to track the behavioral data of network clients. The block system in a DAG is replaced by sequential transactions, each referring to a previous one. Since DAGs don't have miners that can slow down or stop a transaction, there is nothing stopping a transaction from occurring, the speed at which transactions are executed is almost instantaneous. DAG users are ranked according to trust and receive a trust rating. The commission decreases the more reliable the user is, and the transaction processing speed increases, and a reverse reaction occurs if the user is not trusted. The same node infrastructure allows multiple DAGs to be created for different originators and purposes. Multiple projects can be run simultaneously on the same infrastructure while maintaining a fully configured token and application system. Unlike most other high-performance projects, where smart contracts are performed off-chain using specialized servers or nodes in a quasi-decentralized way, smart contracts in Noda Pay are performed internally and decentralized. All stages of smart contract execution are recorded in Multi DAG Noda Pay and checked several times until full confirmation is received. The use of DAG in payment systems is fundamentally different from building block chains. While larger scale in blockchain networks leads to adverse effects on network usage speed, in DAG-based networks growth and intensive usage only improves system efficiency. It is now possible to interconnect the transactions themselves without intermediaries. Each participant can perform the required action and add their action to the registry without intermediaries. Each transaction refers to the previous ones, which ensures order in the chains. The security of this system is much higher than blockage based operations.