...
| Page properties | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ||||||||||||||||||
|
...
As a solution Incremental Eigentrust++ with custom s function, which will take account of several things like:
...
Network locality
1. Take P as ping time between 2 peers and MinPingTime as minimal ping time possible (something like 1ms or 0.03ms)
2. Let Max = -log(MinPingTime), as log(MinPingTime) is supposed to be very big negative number
3. log(P) / Max should normalize P and make its value between [-1; 1], and as P will decrease value will increase
4. log(P) / (2 * Max) is supposed to be between [-0.5; 0.5]
4. Now locality(P) = log(P) / (2 * log(MinPingTime)) + 0.5, and its value is in range [0; 1]
Computation power
May be calculated with something like this:
1. sending transaction with instruction count equal to N
2. taking time for peer to respond as T and P as ping time and PF as Ping factor (how many RTTs needed to send data to deliver response)
3. (T - P * PF) / N (Should be normalized by some amount of predefined computation score maximum)
...
(via sending transactions with some number of instruction count and calculating aggregated time spent on them)
Version test
Send all types of messages to peer and determine version
...
of peer. Equation can look like this (taking V and Vp as our version and peer version):
1. version(V, Vp) = (V - Vp) / V
Data consistency
Should be checked within block synchronization.
Success rate
It is pretty straightforward as in Eigentrust papers:
1. success_rate(i, j) = success(i, j) / (success(i, j) + failed(i, j))
S function
...
s function itself will share same properties as in eigentrust: it will be bound in [0; 1] and priorities of several parameters can be easily configured.
...