Predicate Graph Deployment Validation

essential-contributions / essential-base

Core items shared by both the intent language and protocol.

https://essential.builders

Apache License 2.0

4 stars 2 forks source link

Open mitchmindtree opened 1 week ago

mitchmindtree commented 1 week ago

We want to check the following properties:

The number of nodes is within some max.
The number of edges is within some max.
Each following node's edge_start follows the previous.
All edge_start values are <= edges.len() or == Edge::MAX.
The graph must form a DAG (no cycles). We can achieve this by ensuring each node's edges point to node indices greater than the node's own index.