Most of the foundation is in place. The first step in Banyan...

原始 JSON

{
  "kind": 1,
  "id": "6f3e3f613c658cc1762757a91d239c761663e09c1d2d73859da125351aaedd5d",
  "pubkey": "7ed7d5c3abf06fa1c00f71f879856769f46ac92354c129b3ed5562506927e200",
  "created_at": 1778086311,
  "tags": [],
  "content": "Most of the foundation is in place. The first step in Banyan's trust algorithm is to crawl follows and collect users and relay urls.\n\nI won't trust users own relay declarations to find where their events are. Instead, I'm going to brute force query every single relay for every single user I find and find out exactly which relays have an affinity to which users. At the same time, that process can score the performance and health of each relay.\n\nThe outcome will be a very rich graph in neo4j that has every known user around me and every known relay. Every relay will have a baseline quality score and I'll know exactly which relays hold whose notes. A good foundation for the next phase which is note aggregation and reference following without having to trust relay lists or hints.",
  "sig": "f9e19b6494be94cb79845d5682fa80e74f67f6e723815ab57182f992e02baa72d6beeb55cde1c378e4a63d34eaaafccd8d0850dfda3998ae77bf4e405dc1b715"
}