This white paper provides an explanation of the WarRin protocol and related blockchain, point-to-point, network value, transport protocol, and encryption algorithms. The limited space will highlight the WRC allocation scheme and purpose of the WarRin Protocol Token, which is important for achieving the WRC’s stated objectives. This white paper is for informational purposes only and is not a promise of final implementation details. Some details may change during the development and testing phases.
Traditional centralized communication systems such as WeChat,WhatsApp, FacebookMessage,Google Allo,Skype face a range of problems, including government surveillance, privacy breaches, and inadequate security, and the WarRin protocol proposes apoint-to-pointencrypted communications system that leveragesblockchain technology, combined with Double Ratc het algorithms, pre-keys, and extended X3DH handshakes. The WarRin Protocol uses The Generalized Directional Acyclic Graph and Curve25519,AES-256, and HMAC-SHA256 as the pronamor, allowing each account to have its own unique account chain, providing unlimited instant communication between points and unlimited scalability, anonymity, integrity, consistency, and asynchronousness.
2. WarRin Protocol communication system
2.1 Two types of communication
The Waring Protocol communication system divides chat channels into two types.
Two modes of communication
- General Chat mode: Using point-to-point encrypted communication, the service side has access to the key and can log in via multiple devices.
- Secret Chat mode: Encrypted communication using point-to-point can only be accessed through two specific devices.
The design combines some of the advantages of raiBlocks multi-chain construction with IOTA/Byteball DAG, which we call the Waring protocol. With improvements, we have given the WarRin protocol greater throughput and faster processing power while ensuring the security of the ledger, and network nodes can store the ledger in less space and search their communications accounts quickly in the ledger. When two users communicate, third parties contain content that neither manager can access. When a user is chatting in secret, the message contains multimedia that can be designated as a self-destruct message, and when the message is read by the user, the message is automatically destroyed within the specified time. Once the message expires, it disappears on the user’s device.
2.2 How chat history is encrypted
2.2.1 MTProto Transport Protocol
MTProto transport protocol
The WarRin communication system draws on RaiBlocks’ multi-chain structure for point-to-point communication. Each account has its own chain that records the sending and receiving behavior of the account. For example, in Figure 1, there are 7 accounts, each with 7 chain records of the account sending and receiving communications. On the graph, horizontal coordinates represent the timeline, and portrait coordinates represent the index of the account.
Transferring information from one account to another requires two transactions: one to send a communication from the sender’s transfer content, and one to receive information to add that content to the content of the receiving account. Whether in a send-side account or a receiving account, a PoW proof of work with the previous communication content Hash is required to add new communications to the account. In the account chain, poWwork proves to be an anti-spam communication tool that can be done in seconds. In a single account chain, the Hash field of the previous block is known to pre-generate the PoW required for subsequent blocks. Therefore, as long as the time between the two communications is greater than the time required to generate the PoW, the user’s transaction will be completed instantaneously.
In such a design, only the receiving end of the communication is required for settlement. The receiving end places the received communication signature on the account chain, which is called accepted communication. Once accepted, the receiving end then broadcasts the communication to the ledger of the other nodes. However, there may be situations where the receiving end is not online or is subject to a DoS attack, which prevents the receiving end from putting the receiving side communication on the account chain, which we call uncommoted transactions. The X symbol in Figure 1 represents an open transaction sent from Account 2 to Account 5.
Obviously, because only the sending and receiving sides of the communication are required to settle, such communication is very lightweight, all traffic can be transmitted in a UDP package and processed very quickly. At the same time, all communications in an account are kept in one chain, with great integrity, and the ledger can be trimmed to a minimum. Some nodes are not interested in spending resources to store the full communication history of the account; They are only interested in the current communications for each account. When an account communicates, its accumulated information is encoded, and these nodes only need to keep track of the latest blocks so that historical data can be discarded while maintaining correctness. Such communication is only possible if the sending and receiving sides trust each other and are not the final settlement of the entire network consensus. There is a security risk in the absence of trust on the sending and receiving ends, or in situations where the receiving end is attacked by DoS without the sender’s knowledge.
We have observed that although each account has a separate chain, the entire ledger can be expressed in the form of a WarRin object. As shown in Figure 2, this is represented by the WarRin astros trading on all accounts in Figure 1.
The first unit in the WarRin object is the Genesis unit, the next six cells represent the allocation of the initial token, and the other units correspond to the communication transactions between the account chains. We use the symbol a/b to represent a communication transaction, where the sender is a andthe recipient is b. The last 4/1 unit in Figure 2 is the last communication corresponding to Figure 1 – sending communication from account 4 to account 1. A transaction in Figure 1 is a confirmation of the latest block or the latest communication on the account chains of both parties to the communication, reflected in Figure 2 as a reference to the latest units of the account chains of both parties to the communication. Take unit 4/1, for example, where the latest block on account 4 was the receiving block for 2/4 trades and the newest block on account 1 was the send block for 1/5 trade. So on the DAG, the 4/1 cell refers to the 2/4 cell and the 1/5 cell.
The WarRin protocol uses triangular shrapned storage technology to crack impossible triangles in the blockchain through the shrapghine technology, with extensive node engagement and decontalination while maintaining high throughput and security:
- Complete shraping of blockchain status;
- Secure and low-cost cross-synth trading;
- Completely random witness selection;
- Flexible and efficient configuration
Complete decentralization ensures absolute security and scalability of the standard chain.
(Figures above show seven Ling-shaped objects:2/1 one;3/2 one… ）
2.2.2 Curve25519 Elliptic Curve Encryption Algorithm
Curve25519, proposed by Daniel Bernstein, is anelliptic curve algorithm for the exchange of The Montgomery Curve’s Difi Herman keys.
Montgomery Curve Curve Mathematical Expression:
Curve25519 Curve Mathematical Expression:
Curve25519 encryption algorithms are used for standard private and public keys, and the private keys used for Curve25519 encryption algorithms are typically defined as secret indices, corresponding to public keys, coordinate points, which are usually sufficient to perform ECDH (elliptical) and symmetrical elliptic curve encryption algorithms. If one party wants to send information to the other party and the other party has the public and private keys, perform the following calculation:
Generate a one-time random secret index, calculated using Montgomery, because the message is a symmetrical password encrypted using 256-bit sharing, such as AES using a 256-bit integer one-time public key, as akey, and 256-bit integer is a prefix to encrypted information. Once a party to the public key receives this message, it can start by calculating , that is ,the receiver recovers the shared secret and is able to decrypt the rest of the information.
On the basis of the WarRin agreement, by adding the incentive layer, we can effectively avoid the whole network being attacked and eliminate spam. As long as honest nodes control most of the calculations, for an attacker, the network is robust because of its simplicity of structure, and nodes need little coordination to work at the same time. They do not need to be authenticated because information is not sent to a location.
3.1 WRC Certificate
WRC issued a total of 2,500,000 pieces and continued to increment according to the WoRin gain function.
3.1.1 WoRin Gain Function
3.1.2 WoRin gain function control table
|The WoRin gain function is compared to the table|
|Number of layers /F||Growth factor /I||WRC circulation|
According to the Gain function, the larger the number of layers, the greater the growth rate, the faster each layer is filled, and the greater the circulation.
WarRin protocol node distribution
3.2.1 Node allocation
Set the initial price to 0.02,the layer where the first node is located is , according to the equation of the iso-difference column, there is , so that the node token is assigned to the piece, for the price of the layer where the node is located, there is a set.
For example, the number of tiers in which the 98th node is located is Tier 13, and the price of Tier 13 is 0.214,the tokens assigned by Tier 98 are
3.2.2 Total number of address assignments
Each node occupies one address, and the total number of addresses is
4. The use
WRC is the native pass-through of the WarRin protocol, andWRC will assign to Genesis nodes according to the above allocation scheme, which together form the entire network, andWRC can be used in the following scenarios, including but not limited to:
Pay the network’s gas charges, i.e. for transferring money and invoking smart contracts;
System Staking tokens, used for node elections and token issues;
The capital is lent to the validator in exchange for the amount of the reward;
Voting rights for system proposals;
The means of payment for apps developed on WoRin Services;
WoRin Storage is a means of payment on the decentralization storage;
WoRin DNS domain name and WoRin WWW website means of payment;
WoRin Proxy agents hide the means of payment for body and IP addresses;
WoRin Proxy penetrates payment methods reviewed by local ISPs
Metcalfe’s Law states that thevalue of a network is equal to the square of the number of nodes within the network, and that the value of the network is directly related to the square of the number of connected users. That is ( the value factor, the number of users.) That is, the greater the number of users on a network, the greater the value of the entire network and each computer within that network. The WarRin protocol also follows this law, and when the number of nodes reaches a certain level, the entire network becomes more robust.
 K. Birman, Reliable Distributed Systems: Technologies, Web Services and
Applications, Springer, 2005.
 V. Buterin, Ethereum: A next-generation smart contract and de- centralized
application platform, https://github.com/ethereum/wiki/wiki/White-Paper, 2013.
 M. Ben-Or, B. Kelmer, T. Rabin, Asynchronous secure computa- tions with
optimal resilience, in Proceedings of the thirteenth annual ACM symposium on
Principles of distributed computing, p. 183–192. ACM, 1994.
 M. Castro, B. Liskov, et al., Practical byzantine fault tolerance, Proceedings of the
Third Symposium on Operating Systems Design and Implementation (1999), p. 173–
186, available at http://pmg.csail.mit.edu/papers/osdi99.pdf.
 EOS. IO, EOS. IO technical white paper,
 D. Goldschlag, M. Reed, P. Syverson, Onion Routing for Anony- mous and
Private Internet Connections, Communications of the ACM, 42, num. 2 (1999),
 L. Lamport, R. Shostak, M. Pease, The byzantine generals problem, ACM
Transactions on Programming Languages and Systems, 4/3 (1982), p. 382–401.
 S. Larimer, The history of BitShares,
 M. Luby, A. Shokrollahi, et al., RaptorQ forward error correction scheme for
object delivery, IETF RFC 6330, https://tools.ietf.org/html/rfc6330, 2011.
 P. Maymounkov, D. Mazières, Kademlia: A peer-to-peer infor- mation system
based on the XOR metric, in IPTPS ’01 revised pa- pers from the First International
Workshop on Peer-to-Peer Systems, p. 53–65, available at
http://pdos.csail.mit.edu/~petar/papers/ maymounkov-kademlia-lncs.pdf, 2002.
Disclaimer: The views, suggestions, and opinions expressed here are the sole responsibility of the experts. No Emerald Journal journalist was involved in the writing and production of this article.