I do have the code that do the thing.

Also, I think Coracle WoT model is very naive. Why pow(2, log(n)))

2^ln(n) = 2^( log2(n) / log2(e) ) = n ^ (1/log2(e))

Wtf is that? It's ugly! it's arbitrary!

Reply to this note

Please Login to reply.

Discussion

i haven't actually thought about the math of it, and i kinda don't understand normal math notation i'm used to thinking about functions in code form

as i understand it, web of trust is about some kind of hamming distance type thing between nodes in a graph, and you sum all of the interlinking paths by an exponentially decaying weight - ie, the value for close nodes falls off exponentially after several

so i guess, thinking that through, that he is using an inverse square weighting, against the sum of all the paths between two users based on their follows

this is only one part of it too, i think that you can also add weight by the number and frequency of replies from one user to another to evaluate more than just the simple proximity, to actually how the path is evaluated by each party in the graph

Yeah, I'm not a math guy. The goal was to weight mutes against follows in a reasonable way. Someone suggested I use tan instead. The nice thing is no one has to use the same formula.

I'm not a math guy either, so I can't really imagine WoT working just from within. Maybe as a recommendation tool for interesting npubs with similarities to you, but no idea how it will work for newly onboarded users. What would they see? How would they be seen? Would it make sense?

I recently proposed NIP-85 https://github.com/nostr-protocol/nips/pull/1210 to create chains/networks of trust between NIP-05 providers. It is not based on calculated trust, but real consideration of compatibility.