I would like to build open Graph computing over Nostr.
Any help and suggestions are welcome

What
-------
This note describes a basic framework for graph computation over Nostr Network. Nostr graph computation can find/calculate social data from the Nostr network. It may be able to find sub-communities, fields of interest, popular posts, etc

Why
-------
Graph computation is the base layer that allows the mining of social data from social networks.
Nostr is a protocol that enables social network applications.
Some of the more advanced and useful applications of social networks rely on computed social data. For example, a matching service based on a social network would use the ability to identify subgroups of connected entities or the ability to query for entities in a group who match some criteria.
Currently, every such app built on Nostr needs to compute its own social data. This is a complicated and costly process that narrows and centralizes the space of more complex and potentially highly useful applications.
Open-source social data mining utilities can lead to an open and distributed Nostr social data computation market, hopefully distributed between actors.
A framework and to some level, a protocol for computing Nostr social data can help achieve this goal.

How
-------
Big graph data computation requires a lot of processing, a lot of storage, and relatively complex software to manage it. These requirements tend to make Big graphs computation be done by gig centralized companies with enough resources to pull it.

This framework attempts to solve this by:
- Make use of relays as the data layer (storage) for graph computation and make the computation process as

- Define a low-level and hopefully simple protocol that allows disjointed actors to cooperate in the computation process and keep it distributed between different actors.

- Be an open-source software that can manage the synchronization between computation suppliers and allows other software developers to extend it to do more specific graph computation.