Skip to content

Main content

Evidence Chain Depth Tool

Inspect one caller-supplied evidence-reference chain without inferring evidential reliability.

Loading tool…

Description

Scan chain IDs in order, mark a cycle on any repeat, and either stop before counting the first repeated entry or continue counting every entry according to repeatedIdTerminates.

A justification chain or evidence path is a structural representation of an argument. Repeated identifiers and reachable cycles can expose a local structural issue, but path counts do not establish independent evidence or argument soundness.

Scan chain IDs in order, mark a cycle on any repeat, and either stop before counting the first repeated entry or continue counting every entry according to repeatedIdTerminates.

When to use this tool

Use Evidence Chain Depth when you need a supplied chain, path-count or cycle diagnostic.

How to use the tool and how it works

  1. Enter chainIds, repeatedIdTerminates. Use the units and conventions below.
  2. Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
  3. Read depth, cycleDetected. Inspect cycleDetected before interpreting the associated values.

Scan chain IDs in order, mark a cycle on any repeat, and either stop before counting the first repeated entry or continue counting every entry according to repeatedIdTerminates.1

Input fieldMeaning and unitsAccepted input
chainIdsChain IdsRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
repeatedIdTerminatesRepeated Id TerminatesRequired. Boolean.
Output fieldInterpretationReturned shape
depthDepth on the common length basis and sign convention above.Required. Safe integer.
cycleDetectedCycle DetectedRequired. Boolean.
json
{
  "input": {
    "chainIds": [
      "A",
      "B",
      "C",
      "B"
    ],
    "repeatedIdTerminates": true
  },
  "output": {
    "depth": 3,
    "cycleDetected": true
  }
}

Limitations and assumptions

  • Repeated IDs are treated as a cycle witness in the supplied sequence, without verifying actual dependency edges. The stopping repeat is excluded from depth.
  • Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.

Alternative or Complementary methods

Inspect the actual dependency graph and substantive premises. Use a full graph traversal when disconnected components matter, and evaluate evidentiary validity separately from structure.

References

  1. Calculation and input contract: epistemology/evidence-chain-depth — tool.io

Similar or alternative tools