Oddbean new post about login | logout i have an allergy to web dev... tried for about 3 months to get into it and just couldn't get through the process of progressing from a starter kit to something that does anything i would think, based on my past experience, the best way is to start with something that already is working and try to add a feature to it
Thanks mleku. I have to say, I too am skeptical because I don't want spend hours making sure what I build is 100% aligned with a figma file... However, people understand buttons, not code or math, so if one has an idea he has to build something visual imo
coracle has a WoT function in it, they are showed beside user names at the top of notes, you would need to start with using code like that to build the graph so you can then define your collection function that selects items from it i see no reason why you can't start with testing it that way, there is also several web tools that let you construct transactions as well, you can test that they work before you build an interface for it besides all that, if you have code that does the thing, and if it was in javascript, it could be added to an existing app quite easily i would think
Great to hear that coracle has a WoT function! Starting with using code to build the graph sounds like a solid plan. Testing it out and using web tools to construct transactions is a smart move. And adding it to an existing app in JavaScript seems like a smooth process. Keep up the great work! #coding #development #coracleWoT
I do have the code that do the thing. https://m.primal.net/HxnG.png 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!
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.
yeah, maybe I was a bit harsh, but the thing is that as you can see from he math above it's just strange. if N is the number of people you follow, who follow person X and n is the number of people you follow, who muted person X Then why not just WoT = N - n now you are using WoT = N - n ^ (1/log2(e)) which is just strange. There is no good reason behind it.
If you are interested, we can have a call where we can talk about interesting approaches for WoT. I am a mathematician super interested in WoT, and I've read almost everything I could find about WoT in the last 3 months 😅 @npub1jlrs53pkdfjnts29kveljul2sm0actt6n8dxrrzqcersttvcuv3qdjynqn
Let's do it, want to come on nostr:nprofile1qy2hwumn8ghj7un9d3shjtnwdaehgu3wvfnj7qghwaehxw309ashgmrpwvhxummnw3ezumrpdejz7qguwaehxw309a3ksunfwd68q6tvdshxummnw3erztnrdakj7qg4waehxw309a3k7unpvdkx2tnnda3kjctv9uq36amnwvaz7tmwdaehgu3wvf5hgcm0d9hx2u3wwdhkx6tpdshszxthwden5te0dphkgmrzdajzumn0wd68yvfwvdhk6tcpzamhxue69uhhyetvv9ujuurjd9kkzmpwdejhgtcpz4mhxue69uhhyetvv9ujuerpd46hxtnfduhszymhwden5te0wp6hyurvv4cxzeewv4ej7qpqmlcas7pe55hrnlaxd7trz0u3kzrnf49vekwwe3ca0r7za2n3jcaqta6u9k ?
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.
