pippellia on Nostr: Hey OgLog, great article. First, I am all for using spontaneous user interactions as ...
Hey
OgLog (npub1zte…wcyy), great article.
First, I am all for using spontaneous user interactions as input for discovery algorithms, as opposed to NIP77 where the user is asked for a trust judgment that will likely require bootstrapping a new type of user interaction.
Second, I like zaps because they carry a value signal (assuming the sender is not colluding with the recipient).
I think your proposed algorithm is part of a more general class of algorithms that I've described in my
Navigating the Social Graph
https://pippellia.com/pippellia/Social+Graph/Navigating+the+social+graphHere is how I see it:
- The input is some social graph whose edges represent some form of social relationship, such as who follows who, or, as in your case, who zapped who and how much.
- some propagation rule is applied (in your case, it's direct propagation)
- calculate a certain set of candidates
- apply a sorting rule to sort the candidates (this can be pagerank, local pagerank, trustrank, zap weight...)
Published at
2024-06-16 09:12:27Event JSON
{
"id": "82476459c5d451f11af14ddbce92a0fc6a7db823e140983edb90258ceb86af4d",
"pubkey": "f683e87035f7ad4f44e0b98cfbd9537e16455a92cd38cefc4cb31db7557f5ef2",
"created_at": 1718529147,
"kind": 1,
"tags": [
[
"p",
"12f20c66d3c6e6b7f9b1173f0e91b5dd421dc677d6e3c0ecb0ec3f221cb75652",
"",
"mention"
],
[
"a",
"30023:12f20c66d3c6e6b7f9b1173f0e91b5dd421dc677d6e3c0ecb0ec3f221cb75652:1718478780642",
"",
"root"
],
[
"r",
"https://pippellia.com/pippellia/Social+Graph/Navigating+the+social+graph"
]
],
"content": "Hey nostr:npub1zteqcekncmnt07d3zulsayd4m4ppm3nh6m3upm9sasljy89h2efqzcwcyy, great article.\n\nFirst, I am all for using spontaneous user interactions as input for discovery algorithms, as opposed to NIP77 where the user is asked for a trust judgment that will likely require bootstrapping a new type of user interaction.\n\nSecond, I like zaps because they carry a value signal (assuming the sender is not colluding with the recipient).\n\nI think your proposed algorithm is part of a more general class of algorithms that I've described in my\nNavigating the Social Graph https://pippellia.com/pippellia/Social+Graph/Navigating+the+social+graph\n\nHere is how I see it:\n\n- The input is some social graph whose edges represent some form of social relationship, such as who follows who, or, as in your case, who zapped who and how much.\n\n- some propagation rule is applied (in your case, it's direct propagation)\n\n- calculate a certain set of candidates\n\n- apply a sorting rule to sort the candidates (this can be pagerank, local pagerank, trustrank, zap weight...)",
"sig": "7f8b9b41baaac6757b3b3e99e18aa8342a60a0d69fd0aa31733eef6b9f9a060d26860cbdc89ca2c29c38317fa873b1399632075d1020d4d4e2ab4e69eff575cb"
}