I read the TrustNet paper and Appleseed algorithm.
The approach is very cool.

However, I haven't done the math, but my intuition tells me that it scales rather poorly for large networks.

Do you have data on this?

For every node, one have to compute 60-100 rounds of the Appleseed algorithm.

My approach requires 5-6 rounds, and works for every node at once, whilst remaining local. Every row in the trust matrix T represents the trust that a user gives to all other participants in the network.