Thread

npub1u5njm6g
11/23
To @brugeman @npub1utx00ne @npub180cvv07

lmk if you have questions about how the GrapeRank algo works. Lately I’ve been thinking that a potentially faster way to calculate something similar to GrapeRank would be: 1. Calculate PageRank 2. Map the PageRank score from [0, infinity) to [0, 1) — see the graph in my habla article below. I don’t think that would be identical to my existing GrapeRank algo, but it would probably be a good approximation. Haven’t thought it all the way through. This would be easier to implement if you’re already familiar with PageRank and have access to software that implements it; and may be computationally faster too, since GrapeRank is iterative. habla.news/a/naddr1qvzqqqr4gupzq576k3ee24ptfhuun4dn9y6yqwm4ru9gs...

@undefined
11/23/2024, 9:00:55 PM
0
0
-