How it works
The engine scans your columns for candidate relationships, then asks a sealed kernel to issue one of three verdicts for each candidate. No verdict is produced without evidence; an observational proposal alone can never be certified.
CERTIFIED
Proven by the kernel against certified knowledge. The relationship survives stability and phi checks.
ABSTAIN
Insufficient evidence to certify. The engine declines rather than guess — no false positive.
REJECTED
Contradicts certified knowledge. The candidate is actively ruled out.
Submit a run
.csv · .tsv · .txt · .data · .json · .jsonl · .xlsx · .db · .sqlite · .parquet · .zip — limit 10 MiB
Starting…
0/0