Skip to content

Latest commit

 

History

History
11 lines (9 loc) · 1.05 KB

internal-graph-update-flow.md

File metadata and controls

11 lines (9 loc) · 1.05 KB

Internal Service Graph Update Flows

The following diagram illustrates the differences in what is required to update a user's graph on-chain for different types of graphs: Public vs. Private, and Follow vs. Friendship. As shown, Private graph updates require the user's graph encryption keys, as Private graph data is stored encrypted on-chain. An additional requirement for Private Friendship also requires the counterparty's public graph encryption key. This enables the construction of a shared secret, a PRId, which is used to securely represent the connection in a public way. (The PRId is stored publicly on-chain, but the other side of the connection cannot be derived from it.)

flowchart TD
    pub1["Public Follow"] --- pub2(Create Graph\nData) --> pub3(Compress)
    priFollow1["Private Follows"] --- priFollow2(Create Graph\nData) --> priFollow3(Compress) --> priFollow4(Encrypt)
    priFriend1["Private Friends"] --- priFriend2(Create Graph\nData) --> priFriend3(Compress) --> priFriend4(Encrypt)
    priFriend2 --> priFriend5(Create PRId Data)
Loading