RE: HardFork UA: Open Letter to @Ned & Steemit Inc

You are viewing a single comment's thread from:

RE: HardFork UA: Open Letter to @Ned & Steemit Inc

View the full context

ned (69)in #ua • 6 years ago

I’ll read a proposal but would rather read the code. I can really appreciate HF proposals if they include mock code and implementation framework. Anyway please share the link to UA concept.

6 years ago in #ua by ned (69)

Sort:

scipio (65) 6 years ago

Hi @ned thanks for responding.

the mathematical formulae and implementation mechanisms were already posted in my first article here: https://steemit.com/utopian-io/@scipio/how-to-solve-spam-on-steem-introducing-userauthority
Instead of Gauss-Jordan row reduction I've used (low-CPU / low-RAM) multi-iterative substitution, which is presented in the spreadsheet / Excel found there as well.
the implementation plan is as follows:

read all follower transactions, chronologically, from the blockchain
store follower transactions in a temp MongoDB collection: followDB
update followDB per blockchain block
include last block id
approximate all user UA via multi-iterational substitution, begin with 1 per account, store in temp MongoDB collection: uaDB
equilibrium state is reached when abs[(it(n) - it(n-1)] < x % (confidence interval to be decided, can be very high)
store, as binary, the equilibrium per user as [uid: ua] : ua.db (binary file)
hash-encrypt ua.db , store hash in latest blockchain block for consensus
witnesses read ua.db per user (let's say 8 bytes per user: UA(user 100,000) is found at byte 800,000

$Na

10 votes

[-]

scipio (65) 6 years ago

Regarding no. 5: with the 1 I meant the initial absolute UA/weight approximation per account at iteration 0. The sum of all UA is either equal to the total number of accounts, or 1 (when all UA is divided by that same number of accounts).

$Na

1 vote