Skip to content

/network/tech-stack

Tech Stack

A computable graph engine. Token-2022 settlement on Solana. ElGamal confidential transfers in preparation. Autonomous agents.

Layers
04
layer · graph

Graph Engine

Temporal queries, spatial relationships, and graph algorithms for financial network analysis.

  1. 01

    Temporal Queries

    Query graph state at any point in time using timestamped relationships

    MATCH (m:Member)-[r:VALIDATES]->(t:Transaction)
    WHERE r.timestamp >= datetime('2024-01-01')
      AND r.pohSlot > 123456789
    RETURN m, r, t
    ORDER BY r.pohSlot DESC
  2. 02

    Spatial Relationships

    Geographic and network proximity calculations

    MATCH (m1:Member)-[:LOCATED_IN]->(c1:Country),
    	  (m2:Member)-[:LOCATED_IN]->(c2:Country)
    WHERE distance(c1.coordinates, c2.coordinates) < 1000
    RETURN m1, m2, distance(c1.coordinates, c2.coordinates) as km
  3. 03

    Graph Algorithms

    Shortest path, community detection, and centrality measures

    CALL gds.shortestPath.dijkstra.stream('arbitrage-graph', {
      sourceNode: id(startCurrency),
      targetNode: id(endCurrency),
      relationshipWeightProperty: 'exchangeRate'
    })
    YIELD sourceNode, targetNode, path, totalCost