Hybrids
Software development kit (SDK) allows developers to add functionality to their applications and enable them to build the standard components of their apps more accessible and faster in the ByNodes network. SDKs are usually all-in-one products and do not need to be integrated with other components, which can slowdown the development process. At the top of the software, the stack is the developer libraries and SDKs through which application developers and users cooperate with the various components of the ByNodes network. For fast, language-specific access to the ByNodes API and its network services, there is SDK.
The Universal Distributed Ledger is built based on Zoe chain (DAG) instead of a blockchain. DAG stands for Directed Acyclic Graph. Zoe is a directed graph data structure that uses topological ordering. The scalability of distributed ledgers is a crucial adoption factor. As an alternative to blockchain-based protocols, a Direct- ed Acyclic Graph (DAG) provides flexibility to handle a higher volume of trans- actions. DAG technology is frequently placed together with blockchain; however, DAG is not technically similar to it. It should be seen as another form of Distributed Ledger Technology (DLT).
Zoe chain (DAG) is a network of individual transactions linked to multiple other transactions that do entirely away with blocks. Zoe also becomes a decentralized ledger distributed throughout the nodes in the network coming to the general agreement makes up a permanent valid proof for the transaction that happened. When a record is validated and entered into the Zoe chain, it cannot be retroactively altered or changed by anyone.
Asset
Zoe allows direct transfers of digital value or tokens between two counterparties and registers it in decentralized records, removing the need for an central authority to control the ledger.
Verifiability
Zoe provides an immutable and verifiable audit trail of transactions of any digital or physical asset recorded in DLT inform of a smart contract to excecute prewritten conditions through codes.
Transparency
All network members have their copy of the ledger among each other combined with the absence of a central authority, which has the potential to lessen fraud and eliminate reconciliation cost.
Speed
Zoe DAG offers the capability of speeding up by removing or reducing friction in transactions and settlement processes by evacuating intermediaries and automating processes.
Cyber
DLT has the potential to provide a more resilient and robust system than usual centralized server databases, which prevents from cyber-attacks on account of distributed nature.
Cost
Zoe extends the possibility for significant cost reductions due to removing the need for reconciliation as DLT-based systems, by definition, contain the “shared truth”.
The term “cloud system” describes a network-based computer system, which can be used for organizational and technological integration into decentralized in- formation systems, based on cloud computing technology. Nodes in the network store their file into unused disks space of a cloud machine offered by a node in exchange for incentives. Trinabl is a system of being able to store files without having to rely on large, centralized silos of data that do not undermine essential values such as privacy and freedom of information. Recording the hash of the file into a permanent ledger guarantees the obtainability of the file. Because of open interfaces and dynamic composition, a reconfiguration of the system is possible. Applications and data are loosely connected; they communicate via the network and translate organization- al distributed business processes.
In order to understand why it is much safer to store data in a decentralized repository, based on DAG chain technology, it is essential to consider what iteration of files held after download. To allow the data owner to own and control their data, a personal data management system based on DLT allows clients to control their data with security and privacy guaranteed. In the existing decentralized storage systems, it is elementary to implement encryption and storage of data, but how to address the secretly sharing of data is an urgent problem to be solved. In this section, we propose a framework that can achieve fine-grained access control over data in decentralized storage systems, and search the data based on the new keywords.
Encryption
Every iteration of any file changes its hash, thus it is possible to check files without having direct access.
Division
Encrypted files are divided into pieces (shards), or multiple files are combined to create a single shard.
Distribution
Files randomly distributed across the network and saved into a Trinabl Cloud machine.
Reference
A unique identifier of the file that allows clients to retrieve and access the content gets generated.
Manifest
Specifies paths and corresponding content hashes, allowing for URL-based content retrieval.
Ledger
The transaction between both parties gets recorded inside the Zoe ledger without any intermediary.
Domain Name Systems (DNS) are at the core of the present Internet, where they are used to map domain names to IP addresses. These DNS servers are regulated by governments and maintained by large private corporations; the issue is that they abuse their power to censor or spy on the Internet usage of the masses. A Zoe chain based DNS would allow the addresses to be stored in the storage space of node themselves without the possibility of any single node altering the data illegitimately. Distributed DNS would also improve privacy as there would be no traffic data between a user and the DNS lookup that could be monitored and re- duce lookup speeds and eliminate server downtimes.
DNS relies on DAG & DHT, built on top of the decentralized system, and hence, it may not hamper the redirection process. Furthermore, DLT based DNS may counter the censure and keep away from the issue of cache poisoning or DNS spoofing. With the DLT-based DNS, the registry operators have the flexibility and get more opportunities when they launch new DLT-based TLDs. It will empower them to tailor a TLD to a specific niche. In straightforward words, they will have the ability to redo the TLD adequately and effectively.
Privacy
Encryption combined with the digital signature ensures “Privacy by Design”. Attaching a digital signature to all trans- actions carried out by the user makes it foolproof as well.
Security
Zoe chain technology has been designed to maintain data in an encrypted manner that is secured through cryptography, thereby keeping the ID protected and traceable.
Trust
In Zoe chain-based systems, the metadata is maintained in the ledger. The authenticity of the data is verified by multiple nodes through a consensus mechanism.
Integrity
The benefits of this kind of identity system, is the ability to maintain each identity across the nodes in the network, the data is reconciled continuously and kept up to date.
Immutability
Your domain information is stored immutably on a distributed Ledger in the host and also with neighboring nodes and permanent smart contracts can power this connection.
PKI
PKI is supposed to store identities corresponding to domain holders in the DNS system, a name in our proposed naming system is simply a DNS domain name.
Developing synergistic P2P frameworks are going past the period of companions doing comparable things while sharing resources, and are searching for diverse peers that can bring in extraordinary resources and capabilities to a virtual community thereby empowering it to engage in increasingly huge errands beyond those that can be accomplished by individual peers, yet that are gainful to all the peers. In Zeno's P2P Peers are both suppliers and consumers of resources, in contrast to the traditional client-server model, the consumption and supply of resources are partitioned.
Peers make a portion of their resources, such as processing power, disk storage or network bandwidth, legitimately accessible to other network participants, without the requirement for central coordination by servers or stable hosts. The whole network operates through sections/fragments of shards from a couple of groups consisting of N - number of nodes. Every node from a group keeps up the correspondence between its parent and child nodes alongside with their neighbour nodes. A group may have several ring layers relying upon numbers of nodes associated with its space.
Data
The management and verification of the information along with data stream by the nodes in the network.
Architecture
Its the conceptual model that defines the structure, behaviour, and more views of a system.
Modules
There are components that handle one specific task in a system. A combination of the modules makes up the system.
Interface
It is the shared boundary across which the components of the system exchange information and relate.
Components
Provides a particular function or group of related functions to particular service or group of services.
Signature
A message encrypted with a particular public key can only be decoded with a corresponding private key and vice versa.
Protocol
The Open Source Interconnection (OSI) Model amends a client in host to inter- communicate with a comparing component at a similar layer in another host. The model gives usefulness to (N) layer & (N-1) layers, where N is one of the seven layers of protocols working. Layer N software on the destination computer must receive the exact message sent by layer N software on the sending computer.
Feature section
Data processing by two conveying OSI-compatible gadgets continues as follows :
1. The data to be transmitted is formed at the topmost layer of the transmitting device (layer N) into a protocol data unit (PDU) and gets passed to layer N-1 as service data unit (SDU).
2. With a header, a footer, or both, SDU now moves to layer N-2.
3. The process proceeds until reaching the lowermost level, from which the data gets transmitted to the receiving device.
4. Vice versa happens, the data is passed from the lowest to the highest layer on the receiving device.
5. As a progression of SDUs while being successively stripped from each layer’s header or footer until reaching the topmost layer, where the remainder data is expended.
Researchers deliberately developed the OSI model to support Client-Server archi- tecture over the Internet. However, OSI fizzled at gaining widespread acceptance; the present Internet uses the TCP/IP model. Be that as it may, for P2P decentral- ized WWW, it is critical to guarantee security and tamper-proof at each stage the data passes through; so, the equivalent can be applied to P2P architecture as well.
However, there is no expectation to rehash an already solved problem. By including missing necessary protocols functions in layers, and removing some OSI is re-engineered to fortify a new interoperable peer network, having each layer in the protocol stack provides a specific function. These protocols offer types of assistance to the layer directly above. Besides, each layer communicates to its peer layer in the system to which it is related.
Timestamp
Trusted timestamping is the procedure of safely monitoring the creation and adjustment time of a report. Security here implies that nobody—not even the proprietor of the archive—ought to have the option to transform it once it has been recorded, given that the timestamp's integrity is never undermined.
Immutable
When information has been registered on a blockchain, nobody, not so much as a framework executive, can transform it; this gives advantages to review. A transaction signed with the private key spread throughout the network can be decrypted using the public key, ensuring that the user himself indeed signed it.
Consensus
The goal of BFT is to be able to defend against failures, and imperfect information about the state of the failure. The consensus is reached immediately when a node initiates a transaction without any delay because of the shading of groups whose neighbor members sync their ledger with the transaction.
Integrity
In distributed system, the record of transactions is recorded by the whole network and is maintained by all the nodes resulting in immunity from Single Point of Failure. The data recorded stays forever inside the blocks and tamper proof due to the generated block hash which results to new if an entry gets changed.
Layers
The architecture of ByNodes is coherently separated into layers building up the entire structure: a service layer, a DAG-chain layer, and a network layer. Each layer offers support for the layer above to accomplish the necessities of ByNodes. The service layer focuses on how to support specific evidence-related services by using the DAG-chain. In this layer, multiple signature schemes get employed to ensure integrity, verifiability, privacy, and other necessary characteristics. To satisfy the scalability requirements and simplify the design, ByNodes adopts a loose coupling structure with two modules, a storage module (Trinabl), and a DAG- chain module (Zoe), to separate evidence storage and management. The storage module gets used to support evidence storage, and the DAG-chain module participates in evidence collection, verification, and retrieval.
The DAG-chain layer is responsible for constructing a Zoe chain for each node in the underlying network. The network environment is relatively safe, and block mining does not rely on an economic incentive. Thus, ByNodes can adopt a private or consortium network. This helps in distributing block bodies to different nodes. The main challenge in this layer is the DLT chain bloat. To overcome these challenges, we propose a mixed DLT rather than a full DAG-chain through Zoe.
The network layer is used to construct the network topology and support communication. Most blockchain schemes use the Peer-to-peer (P2P) network as the blockchain network. ByNodes also adopts a new P2P interface through Zeno to organize nodes and provides scalable P2P routing (Neith) and encryption communication to support the specific tasks for other layers layers, for example, broad- cast transactions, the encrypted transmission of evidence information, maintain the consensus of the DAG-chain.
Consensus
A Consensus algorithm is a procedure in computer science used to achieve agreement on a single data value among distributed systems. Open ledger that operates as decentralized, self-regulating systems work on a global scale without any single authority involves contributions from hundreds of thousands of participants who work on verification and authentication of transactions occurring these publicly shared Zoe ledgers need an efficient, real-time, fair, functional, reliable, and secure mechanism to guarantee that all the transactions occurring on the network are genuine. All participants agree on a consensus on the status of the ledger.
Fathoming the issue - known as the consensus problem — is important in distributed computing and multi-agent systems. This all-important task is performed by the PARSEC consensus mechanism, which is a set of rules that decides on the contributions by the various participants
Cards section
Security
A consensus protocol is determined to be secure if all nodes produce the same result (agreement) and the results produced by the nodes are valid according to the protocol rules (validity); this is also referred to as shared state consistency.
Liveliness
This guarantees the liveliness if all the nodes that follow the protocol, eventually, produce a value (termination); that is, if a node generates a transaction and sends it to all nodes of the network at some point a miner will include it in one block.
Fault Tolerance
Is the ability to continue to operate and reach consensus, correctly, even after the failure of some network nodes.
Besides a transaction submitted for endorsement and a period elapsed while it is confirmed, this structure allows for a transaction to spread across the network via gossip protocol. While not all nodes will have the exact version of new events at all times, they will eventually attain the same set of data by always gossiping amongst themselves until they all match. This mode of consensus fits in with our definition of an asynchronous network.
In the ByNodes network, this happens on a grand (and fast) scale, with nodes continually requesting information (sync requests) from other nodes and afterwards determining if any new blocks should get added. The self-parent and other-parent are what prevent tampering (because they are signed and related to other gossip events).
Encryption
In cryptography, encryption is the way towards encoding a message or information so that only authorized parties can access it, and the individuals who are not approved cannot. Encryption does not itself forestall interference but denies the intelligible content to a would-be interceptor. Encryption takes readable data and alters it so that it seems irregular. Encryption requires the use of an encryption key:a set of mathematical values that both the sender and the recipient of an encrypted message know.
To ensure that the content of a message remains confidential despite wiretapping, messages must be encrypted. In essence, encryption scrambles bits of the message in Such a way that only the intended recipient can unscramble them. Someone who intercepts a copy of an encrypted message will not be able to extract information.
Several technologies exist for encryption. In some technologies, a sender and receiver must both have a copy of an encryption key, which is kept secret. The sender uses the key to produce an encrypted message, which is then sent across a network.
The receiver uses the key to decode the encrypted message. That is, the encrypt function used by the sender takes two arguments: a key, K, and a message to be encrypted M. The function produces an encrypted version of the message, E.
E = encrypt ( K, M )
The decrypt function reverses the mapping to produce the original message:
M = decrypt ( K, E )
Mathematically, decrypt is the inverse of encrypt:
M = decrypt ( K, encrypt( K, M ))
Public Key Encryption
In many encryption schemes, the key must be kept secret to avoid compromising security. One particularly interesting encryption technique assigns each user a pair of keys. One of the user’s keys, called the private key is kept secret, while the other called the public key is published along with the name of the user, so everyone knows the value of the key. The encryption function has the mathematical property that a message encrypted with the public key cannot be easily decrypted except with the private key and a message encrypted with the private key cannot be decrypted except with the public key.
The relationships between encryption and decryption with the two keys can be expressed mathematically. Let M denote a message, public_u1 denote user’s 1’s public key, and private_u1 denote user 1’s private key.
The encryption functions are:
M = decrypt ( public_u1, encrypt ( private_u1, M ))
and
M = decrypt ( private_u1, encrypt ( public_u1, M ))
Revealing a public key is safe because the functions used for encryption and decryption have a one way property. That is, telling someone the public key does not allow the person to forge a message that appears to be encrypted with the private key. Public key encryption can be used to guarantee confidentiality. A sender who Wishes a message to remain confidential uses the receiver’s public key to encrypt the message. Obtaining a copy of the message as it passes across the network does not enable someone to read the contents because decryption requires the receiver’s private Key. Thus, the scheme ensures the data remains confidential because only the receiver can decrypt the message.
HASH Function
Hash functions are mathematical functions that create a synopsis, a data fingerprint. At that point, when applied to a given dataset, it generates an output, which is unique (there may be two data sets with the same hash, but the likelihood of occurrence is extremely low in Zeno network). One of the most incessant uses for the hash is checking data integrity. The hash output size depends on the web for execution is always the same size, regardless of input size.
Our hashing algorithm is KangarooTwelve made by Keekack group; it is based on sponge construction. KangarooTwelve is a quick and secure extendable-output function (XOF), the generalization of hash functions to arbitrary output lengths. Derived from Keccak, it aims at higher speeds than FIPS 202’s SHA-3 and SHAKE functions, while retaining their flexibility and basis of security. On high-end platforms, it can exploit a high degree of parallelism, whether using multiple cores or the single-instruction multiple-data (SIMD) instruction set of modern processors.
KangarooTwelve hash algorithms have the following attributes:-
One way: it is computationally tough to discover the contribution from hash esteems.
Compression: In KangarooTwelve, the hash size should represent a small fraction of data.
Ease calculation: KangarooTwelve hash algorithm is not exorbitant to compute the hash values.
Diffusion: K12 hinders the reverse engineering of the algorithm when one bit of input is changed, the hash also results in change.
Collision: In K12, it gets computationally tricky to find two inputs that generate the same hash.
Privacy Policy
Your privacy is important to us. It is ByNodes policy to respect your privacy regarding any information we may collect from you across our website, http://bynodes.org, and other sites we own and operate.
We only ask for personal Information when we truly need it to provide a service to you. We collect it by fair and Lawful mean, with your knowledge and consent. We also let you know why we're collecting it and how it will be used.
We only retain collected information for as long as necessary to provide you with your requested service. What data we store, well project within commercially acceptable means to prevent loss and theft, as well as unauthorized access, disclosure, copying, use or modification.
We don't share any personally identifying Information publicly or with third parties, except when required to by Law.
Our website may link to external sites that are not operated by us. Please be aware that we have no control over the content and practices of these sites, and cannot accept responsibility or liability for the respective privacy policies.
You are free to refuse our request for your personal information, with the understanding that we may be unable to provide you with some of your desired services.
Your continued use of our website will be regarded as acceptance of our practices around privacy and personal information. If you have any questions about how we handle user data and personal information, feel free to contact us.
This policy is effective as of 29 April 2020.
Terms of Use
1. Terms
By accessing the website at http://bynodes.org, you are agreeing to be bound by these terms of service, all applicable laws and regulations, and agree that you are responsible for compliance with any applicable local laws. If you do not agree with any of these terms, you are prohibited from using or accessing this site. The materials contained in this website are protected by applicable copyright and trademark law.
2. Use License
Permission is granted to temporarily download one copy of the materials (information or software) on ByNodes website for personal, non commercial transitory viewing only. This is the grant of a license, not a transfer of title, and under this license you may not:
modify or copy the materials;
use the materials for any commercial purpose, or for any public display (commercial or non-commercial);
attempt to decompile or reverse engineer any software contained on ByNodes website;
remove any copyright or other proprietary notations from the materials;
or transfer the materials to another person or "mirror" the materials on any other server.
This license shall automatically terminate if you violate any of these restrictions and may be terminated by ByNodes at any time. Upon terminating your viewing of these materials or upon the termination of this license, you must destroy any downloaded materials in your possession whether in electronic or printed format.
3. Disclaimer
The materials on ByNodes website are provided on an 'as is' basis. ByNodes makes no warranties, expressed or implied, and hereby disclaims and negates all other warranties including, without limitation, implied warranties or conditions of merchantability, fitness for a particular purpose, or non-infringement of intellectual property or other violation of rights.
Further. ByNodes does not warrant or make any representations concerning the accuracy, likely results, or reliability of the use of the materials on its website or otherwise relating to such materials or on any sites linked to this site.
4. Limitations
In no event shall ByNodes and its suppliers be liable for any damages (including, without limitation, damages for loss of data or profit, or due to business interruption) arising out of the use or inability to use the materials on ByNodes website, even if ByNodes or a ByNodes authorized representative has been notified orally or in writing of the possibility of such damage. Because some jurisdictions do not allow limitations on implied warranties, or limitations of liability for consequential or incidental damages, these limitations may not apply to you.
5. Accuracy of materials
The materials appearing on ByNodes website could include technical, typographical, or photographic errors. ByNodes does not warrant that any of the materials on its website are accurate, complete or current. ByNodes may make changes to the materials contained on its website at any time without notice. However ByNodes does not make any commitment to update the materials.
6. Links
ByNodes has not reviewed all of the sites linked to its website and is not responsible for the contents of any such linked site. The inclusion of any link does not imply endorsement by ByNodes of the site. Use of any such linked website is at the user's own risk.
7. Modifications
ByNodes may revise these terms of service for its website at any time without notice. By using this website you are agreeing to be bound by the then current version of these terms of service.
8. Governing Law
These terms and conditions are governed by and construed in accordance with the laws of India and you irrevocably submit to the exclusive jurisdiction of the courts in that State or location.
Cookie Policy
This is the Cookie Policy for ByNodes, accessible from www.bynodes.org.
What Are Cookies
As is common practice with almost all professional websites this site uses cookies, which are tiny files that are downloaded to your computer, to Improve your experience. This page describes what information they gather, how we use it and why we sometimes need to store these cookies. We will also share how you can prevent these cookies from being stored however this may downgrade or 'break certain elements of the sites functionality.
For more general information on cookies, please read "What Are Cookies".
How We Use Cookies
We use cookies for a variety of reasons detailed below. Unfortunately in most cases there are no industry standard options for disabling cookies without completely disabling the functionality and features they add to this site. It is recommended that you leave on all cookies if you are not sure whether you need them or not in case they are used to provide a service that you use.
Disabling Cookies
You can prevent the setting of cookies by adjusting the settings on your browser (see your browser Help for how to do this). Be aware that disabling cookies will affect the functionality of this and many other websites that you visit. Disabling cookies will usually result in also disabling certain functionality and features of this site. Therefore it is recommended that you do not disable cookies.
The Cookies We Set
Account related cookies
If you create an account with us then we will use cookies for the management of the signup process and general administration. These cookies will usually be deleted when you log out however in some cases they may remain afterwards to remember your site preferences when logged out.
Login related cookies
We use cookies when you are logged in so that we can remember this fact. This prevents you from having to log in every single time you visit a new page. These cookies are typically removed or cleared when you log out to ensure that you can only access restricted features and areas when logged in.
Email newsletters related cookies
This site offers newsletter or email subscription services and cookies may be used to remember if you are already registered and whether to show certain notifications which might only be valid to subscribed/unsubscribed users.
Surveys related cookies
From time to time we offer user surveys and questionnaires to provide you with interesting insights, helpful tools, or to understand our user base more accurately. These surveys may use cookies to remember who has already taken part in a survey or to provide you with accurate results after you change pages.
Forms related cookies
When you submit data through a form such as those found on contact pages or comment forms cookies may be set to remember your user details for future correspondence.
Third Party Cookies
In some special cases we also use cookies provided by trusted third parties. The following section details which third party cookies you might encounter through this site.
• This site uses Google Analytics which is one of the most widespread and trusted analytics solutions on the web for helping us to understand how you use the site and ways that we can improve your experience. These cookies may track things such as how long you spend on the site and the pages that you visit so we can continue to produce engaging content.
• For more information on Google Analytics cookies, see the official Google Analytics page.
• Third party analytics are used to track and measure usage of this site so that we can continue to produce engaging content. These cookies may track things such as how long you spend on the site or pages you visit which helps us to understand how we can improve the site for you.
• From time to time we test new features and make subtle changes to the way that the site is delivered. When we are still testing new features these cookies may be used to ensure that you receive a consistent experience whilst on the site whilst ensuring we understand which optimizations our users appreciate the most.
• The Google Adsense service we use to serve advertising uses a DoubleClick cookie to serve more relevant ads across the web and limit the number of times that a given ad is shown to you.
For more information on Google AdSense see the official Google Adsense privacy FAQ.
• We use adverts to offset the costs of running this site and provide funding for further development. The behavioural advertising cookies used by this site are designed to ensure that we provide you with the most relevant adverts where possible by anonymously tracking your interests and presenting similar things that may be of interest.
• Several partners advertise on our behalf and affiliate tracking cookies simply allow us to see if our customers have come to the site through one of our partner sites so that we can credit them appropriately and where applicable allow our affiliate partners to provide any bonus that they may provide you for making a purchase.
• We also use social media buttons and/or plugins on this site that allow you to connect with your social network in various ways. For these to work the following social media sites including: (Facebook, GitHub, LinkedIn, YouTube), will set cookies through our site which may be used to enhance your profile on their site or contribute to the data they hold for various purposes outlined in their respective privacy policies.
More Information
Hopefully that has clarified things for you and as was previously mentioned if there is something that you aren't sure whether you need or not it's usually safer to leave cookies enabled in case it does interact with one of the features you use on our site.
However if you are still looking for more information then you can contact us through one of our preferred contact methods.
Email: contact@bynodes.org.
About us
The first bit of leeway of the decentralized web is, it does not require a centralized server for queries. This paper presents- ByNodes, A Decentralized WWW that will, in general, be an arrangement of many computers and widely distributed data. ByNodes framework will depend on clients that posture itself to be a ‘node’ in the network that contributes their power and memory for the operation of a distributed database system. Distributed cloud systems spare user’s data and run by nodes that have conceded the network to their unused space and resources in return for incentives from other nodes.
The third cycle of web innovation presents us with a spot where services get distributed rather than restricted, where clients own and control their data, and where small players recuperate power from goliaths. Public ledger alongside native coins and tokens aids in enlisting and verifying transactions and data, which yields ballot rights altogether exercises the control each node has over the ByNodes network system. Digital identity for the use case of no password logins in numerous plat- forms adds up to be the best approach for security in a distributed community.
ByNodes facilitates a full-stack versatile WWW elective as opposed to current conventional web administrations, and never endangers the security and privacy of clients in the network. Fueling this foundation is a friendly methodology ad- opted by the network to ensure vital tools made available for developers to build user-focused decentralized applications on top of the overlay network. The objective is to innovate one system of people/nodes, empowering the whole nation and network with their abilities, skills, talents, and knowledge for a much larger similar audience.
ByNodes, a DLT based WWW system dispenses the danger with a single point of failure and a central point for attacks by operating through all nodes on the net- work. So a token economy subsequently conceived by being fair, unique, revolutionary, and progressive that has the potential to change all our future for higher goods with smart contracts composed for agreements acting among individuals on any services purchased, sold, leased, or handed out gets permanently recorded in the ledger creates a valid proof for the transaction happened. The Peer to peer movement started in the early days of the Internet and has brought forth many protocols and applications that, in the most immoderate cases, redefined our methods for devouring web operations.
Peer-to-peer (P2P) is a distributed application architecture that partitions tasks or workloads at hand between peers. All peers are equally privileged, equipotent members in the application, and have a job to shape a distributed Peer-to-peer network of nodes running worldwide. P2P acts naturally versatile, oversight safe, anonymous — and the robustness of present executions is a byproduct of incremental advancements.
In 1969, The ARPANET, the early Internet, was invented by equally processing peers. Napster in 1999 built a P2P set of three music centered online services. Its successor Gnutella appeared in 2000; a new type of file sharing spearheaded al- lowed users to locate one another and connect remotely. Around the same year, Freenet acquired noteworthy improvement in respect to user anonymity, introducing what might later be marked the “darknet” category. During 2001 a P2P file sharing platform was developed and coined as BitTorrent the protocol permitted peers to communicate straightforwardly over a TCP port, yet depended on central trackers to record the location/availability of files and to coordinate clients. Through Satoshi Nakamoto, an obscure individual or group of people, Bitcoin and Blockchain in 2009 were exposed to light. Bitcoin gets verified by a public ledger, a cryptocurrency, a digital asset intended to function as a medium of trade that uses cryptography to control its creation and management, instead of to depend on central authorities. What bitcoin did for the fiat currency, ByNodes visions to do the likewise for the present Internet by creating a new WWW, decentralized to every node.
