3 ms·
That makes sense. With the trust system described trust is only calculated for you personally rather than calculating how much everyone trusts everyone else. F
by TimJRobinson 6y ago
That makes sense. With the trust system described trust is only calculated for you personally rather than calculating how much everyone trusts everyone else.
From the benchmarks [1] of a simple naive JavaScript version is can recalculate one persons trust in a huge network in just a few ms. With partial updates when new ratings come in it could be done even faster.
1: https://github.com/adecentralizedworld/decentralized-trust-demo/#benchmarks https://github.com/adecentralizedworld/decentralized-trust-d...
- rolleiflex 6y agoYeah — trust level is only one component of a multivariate calculus that we call graph compile. So it's very possible for the trust only to take milliseconds when it's the only thing you compile with objects that only carry trust, but Aether compiler also moves the content around too. To give you a sense of the real world results, our initial compile takes multiple minutes even with binary (0 or 1) trust, even if only a vanishingly small portion of it is actually calculating trust. If an object is made dirty, regardless of the reason, it has to be touched, loaded into memory and processed. The disk is where you it the bottleneck. If your dataset fits into memory (mind that Aether has to work with computers with 4gb of RAM) then yes the whole thing is milliseconds. But once you start to do sequential reads on what might not even be SSD, you want to avoid any sort of dirtying if you can. Gradient Trust is one of the worst offenders in that almost any change to it dirties almost the whole graph.