FRACTAL
The first hierarchical social network
Hi everybody. This is an explanation of an idea for the first hierarchical social network based on a blockchain. At the same time this is an invitation to participate in implementation of this project in case you like it and and want to help.
Intro
According to the research by "We ARe Social" and "Hootsuite" the amount of the most wellknown social networks' users has been growing at about one million new accounts per day for the last year. It has reached 3,2 bln accounts up to 2018. Many users gain profits from their accounts. As usual these are the advertising revenues. And the amount of the revenues demands on the amount of followers.
Often it is hard to distinguish accounts with real followers from the artificially increased ones. There is a lot of advertising in the Internet which offers extra followers, likes, tweets etc. That is why the amount of tweets, likes and reposts can't always be a realy trusted evaluation mechanism.
From the other side, the real followers are only indirectly interested in participating in any communities, while not getting any reward for the loyalty.
Thus we have the situation in which the content authors are not responsible for their followers especialy in realy large communities, and the followers are not interested any how to be true and active ones.
In addition the most wellknown social networks are the peer ones and do not allow to create hierarchical structures, which could consider "the-followers-of-the-followers". Although suh structers are most relevant to the human society.
What we offer
Fractal is going to be the first blockchain based social network with the possibility to build hierarhical structures, guaranteed assessment of your social connections and the possibility of gaining revenues directly dependent on the amount of one's social connections.
Fractal first in addition to the usual ways of participating in any community introduces the concept of the VOTE. Every user has only one outgoing VOTE and as many as possible incoming VOTEs from other users.
While giving his personal VOTE to any other account the users at the same time gives his every incoming VOTE. The depth of this structure is regulated by Fractal.
Fractal will allow any its user to track the status of his TREE OF CONNECTIONS, the activity of followers. It will also let users to spread their content through the whole TREE, to create chats and etc.
Also Fractal will offer the certain mechanism for the evaluating one's tree of connections, will assign it the value. Because we realy think that social connections matter. Fractal users will recieve the possibility to gain revenues in Fractal tokens for the creating of communities and for participating in them. Because we think, that real network users must be rewarded for the loyalty and activity.
Y blockchain?
In order to implement the idea of Fractal we need to solve the next problems:
- secure data storage
- impossible data forgery
- openness and transparency
- evaluating connections
All of them can be solved with blockchain and tokenization technologies.
Evaluation for social connections and possibility of gaining revenues create temptation for data forgery and dishonest activity. Blockchain technology allows to solve the problem of secure distibuted data storage and disables the possibility of data forgery.
Nodes' confirmation for creation of new connections allows to implement transparency and openness.
And the internal token will evaluate connections.
How it works
In Fractal all the information about one's token's distribution and connections transactions is to be storaged in blockchain with its unseparable chain of blocks of data.
Every user of Fractal at desire can become a node which participates in generating a block and get a guaranteed reward of a certain amount of Fractal tokens.
The user can spend this reward, sell it, or keep it.
Details
Fractal will use the Proof-Of-Weight algorythm which is a subspecies of a PoS-algorythm of mining of a block.
The weight of every mining node will assume of its token amount and its amount of connections, multiplied by certain coefficient.
Thus the owner of the large amount of incoming VOTEs will be equal in his abilities of generating a block with a serious tokenholder. This is how the main princip "connections-matter" is implemented.
Since at first time of Fractal evolution tokenholders will prevail over VOTEowners they will have more chances to generate a block and get a reward. This is fair enough because of the fact that token buyers and ICO participants finance the start of the system.
Over time, participants of large structures will not yield to token holders in opportunities for generating blocks and receiving rewards
More details
As mentioned above, each node in Fractal has a certain weight. This value is the sum of the amount of the Fractal tokens, which is owned by the node, and the amount of incoming VOTEs multiplied by the coefficient of the connection cost k
W=T+k*V
W - the weight of a node
T - the amount of tokens
V - the amount of incoming VOTEs
When writing a new block to the blockchain, the node generates a random number R, distributed evenly over the interval [0;1]. For each node it is calculated
S=R/W
The node with the lowest S value becomes the winner. Each block has as one of the attributes a number that is the end-to-end result of the sums of all previous S values. The winner node adds its result to this number, writes the block to the blockchain and sends its version of the chain to other nodes. When splitting blockchain chains, preference is given to the chain with the lowest end-to-end value S.
Distribution of rewards
The node that recorded the next block in the blockchain receives a reward in the amount of X tokens. According to the idea of Fractal, the nodes that have provided their outgoing VOTEs up to a certain hierarchy level also receive a part of this reward, in proportion to their contribution to the total number of VOTEs of the winning node
It is obvious that the distribution of reward in case of winning by a large structures with a large number of participants will greatly overload the blockchain. We offer the following solution.
A distinctive feature of the transaction responsible for accrual of rewards is the void sender's address field. A node cannot reference such a transaction as an input when trying to dispose of tokens which it owns.
Every N blocks the network generates a special block which is responsible for the distribution of the accumulated reward. It can happen approximately once per week for example. The Protocol analyzes all transactions with the void sender's address, sums them for the same nodes and distributes a part of the reward between sub-nodes. Since the sender address field is no longer empty, this transaction can be used as an input to dispose of tokens.
Transaction of a VOTE
The Fractal user can at any time transfer his or her VOTE or request it back. Since the standard cryptocurrency transaction is unidirectional and does not imply the possibility of its cancellation, this mechanism needs to be improved.
This transaction, along with the sender address and recipient address fields, is assigned to the direction of connections field. A positive value for this field indicates that the VOTE is sent, and a negative value indicates that the VOTE is requested back. Thus, the number of VOTEs of any node can be calculated by iterating through all transactions in which the node address is the recipient address and summarizing them by the direction of connection field.
Who we are looking for
We are looking for blockchain-enthusiasts who would like to join our group as a full partner and help to implement the idea of Fractal. We will be very happy to consider your resume by email
fractalblockchain@gmail.com
