verify_reputation
Re-derive PageRank over a directed trust graph to confirm provided reputation scores are correct. Optionally checks against a graph commitment for integrity.
Instructions
Verify LUMEN reputation scores by re-deriving PageRank over the supplied graph (LUMEN verify).
Pass the graph and the `scores` (and optionally the `graph_commitment`) from a
`get_reputation_scores` result; confirms they are the correct PageRank of exactly that graph.
Returns:
The standard envelope; `result` is `{valid: <bool>, max_abs_diff, [commitment_match]}`.
Cost ~$0.002 USDC.
Example:
verify_reputation(nodes=3, edges=[[0,1,1.0],[1,2,0.5],[2,0,0.5]], scores=[0.33,0.33,0.34])
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| nodes | Yes | Number of nodes in the directed trust graph, 1..100000. Node indices in `edges` must be in [0, nodes). | |
| edges | Yes | Directed, weighted trust edges as `[from_index, to_index, weight]`. An edge i→j with weight w means node i confers w trust on node j. Weights need not be normalized. | |
| scores | Yes | The `scores` array from a get_reputation_scores result, to be re-derived and confirmed. | |
| damping | No | PageRank damping factor in [0,1] (default 0.85). Lower = more weight on the uniform prior, dampening graph manipulation. | |
| graph_commitment | No | Optional `graph_commitment` (0x… SHA-256) from the result, to bind the check to the exact graph. Pass '' to skip. |
Output Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |