code_ir_equiv
The Code Court's first move: are two implementations equivalent by the exact value multiset of their LLVM IR constants? THE PAYLOAD IS THE CODE FILE — submit two whole source files (left_file and right_file, each {path, content}, or files as an array of two). The result leaf is those same whole files under files, plus WIN (constant-pool digests identical), CODE_IR_DIVERGED (naming the first divergent value), NOT_KNOWN (nothing mineable), or a REFUSED_* refusal. Stateless and content-addressed — the same two files rule identically on every cell, so a reviewer re-checks by re-digesting, not by re-reading the diff. Compares the constant pool (a necessary, strong condition for the numeric kernels the corpus is built from), not full behavioural equivalence.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| files | No | Exactly two whole files when left_file/right_file are not used. The payload IS the files. | |
| left_ir | No | LEGACY fragment of the first implementation. Still accepted and lifted into a whole file with a defaulted path; prefer left_file. | |
| right_ir | No | LEGACY fragment of the second implementation. Still accepted and lifted into a whole file with a defaulted path; prefer right_file. | |
| left_file | No | Whole source file of the first implementation. The payload IS the file. | |
| right_file | No | Whole source file of the second implementation. The payload IS the file. |