{"ok":true,"service":"kelly-glass-lab","route":"/api/recursive-loop-linker","sourceAuthority":"primary_static_recursive_loop_linker","sourceUrl":"https://kelly-static-production.up.railway.app/api/runtime/recursive-loop-linker?limit=20","generatedAt":"2026-07-08T04:59:01.394Z","readOnly":true,"mutationAllowed":false,"publicUserWriteAllowed":false,"philosophy":"source_code_archeology","thesis":"If two loops are real, KELLY should expose the evidence fields that can link them, then test the bridge against reality before treating it as reusable knowledge.","loopLinkState":"partial_bridge_network_visible","summary":{"bridgeCount":6,"linkedBridgeCount":3,"missingBridgeCount":0,"nextBestBridge":{"id":"closure_to_replay","from_loop":"reality_closure_loop","to_loop":"replay_loop","state":"candidate_waiting_downstream","upstream_count":20,"downstream_count":0,"evidence_fields":["reality_closure.closures[]","memory_cell_birth.memory_lineage_trail[].replay_status"],"missing":["replayable_cells"],"rule":"A closed loop becomes reusable only after replay confirms the chain can be reconstructed.","proof_posture":"hypothesis_only_until_fields_exist"}},"bridges":[{"id":"source_to_hypothesis","from_loop":"source_intake_loop","to_loop":"hypothesis_generation_loop","state":"linked","upstream_count":4,"downstream_count":20,"evidence_fields":["summary.approved_source_count","kelly_generated_hypotheses[]"],"missing":[],"rule":"A source loop can feed a hypothesis loop only when an approved source frontier and at least one KELLY-generated hypothesis are both visible.","proof_posture":"evidence_backed_bridge"},{"id":"hypothesis_to_observation","from_loop":"hypothesis_generation_loop","to_loop":"observation_intake_loop","state":"linked","upstream_count":20,"downstream_count":25,"evidence_fields":["kelly_generated_hypotheses[]","summary.recent_observation_count"],"missing":[],"rule":"A theory becomes useful fuel only when approved data produces observations that can test it.","proof_posture":"evidence_backed_bridge"},{"id":"observation_to_reality_closure","from_loop":"observation_intake_loop","to_loop":"reality_closure_loop","state":"linked","upstream_count":25,"downstream_count":20,"evidence_fields":["summary.recent_observation_count","reality_closure.closures[]"],"missing":[],"rule":"Observation loops link to closure loops when a settlement/proof/calibration closure is visible.","proof_posture":"evidence_backed_bridge"},{"id":"closure_to_replay","from_loop":"reality_closure_loop","to_loop":"replay_loop","state":"candidate_waiting_downstream","upstream_count":20,"downstream_count":0,"evidence_fields":["reality_closure.closures[]","memory_cell_birth.memory_lineage_trail[].replay_status"],"missing":["replayable_cells"],"rule":"A closed loop becomes reusable only after replay confirms the chain can be reconstructed.","proof_posture":"hypothesis_only_until_fields_exist"},{"id":"replay_to_memory_birth","from_loop":"replay_loop","to_loop":"memory_birth_loop","state":"waiting_for_upstream","upstream_count":0,"downstream_count":27,"evidence_fields":["summary.replayable_visible_cell_count","memory_cell_birth.memory_lineage_trail[]","memory_cell_birth.next_cell_candidates[]"],"missing":["replayable_cells"],"rule":"Replayable evidence may feed memory only as visible cells or governed candidates, never as a hidden write.","proof_posture":"hypothesis_only_until_fields_exist"},{"id":"memory_to_graphstate_promotion","from_loop":"memory_birth_loop","to_loop":"graphstate_topology_loop","state":"waiting_for_upstream","upstream_count":0,"downstream_count":7,"evidence_fields":["memory_cell_birth.memory_lineage_trail[]","memory_cell_birth.next_cell_candidates[]"],"missing":["replayable_cells"],"rule":"Memory can link into GraphState only through governed promotion candidates and apply receipts.","proof_posture":"hypothesis_only_until_fields_exist"}],"recursiveRule":"Do not recurse by faith. Recurse only when loop A output and loop B input are both represented by public-safe evidence fields, then close the bridge through proof, settlement, calibration, replay, and memory eligibility.","boundary":{"public_users_can_force_bridge":false,"public_users_can_write_ground_truth":false,"memory_written_by_this_route":false,"graphstate_mutated_by_this_route":false,"hidden_links_guessed":false,"secret_values_recorded":false},"upstream":{"status":200,"error":null,"linkerVersion":null,"sourceRoute":"/api/runtime/recursive-loop-linker"}}