Crypto Novelty Check
Try to falsify novelty before supporting it. A finite search can find prior art; it cannot prove universal absence.
Scope
In scope: contribution decomposition, adversarial query/citation search plan, historical terminology, adjacent-field and version checks, closest-work claim comparison, priority evidence, and bounded novelty verdict.
Out of scope: global guarantees, legal patent opinions, proof correctness, or concealing inconvenient prior art.
Required Inputs
- precise candidate contribution claims;
- functionality, security notion/model, assumptions, parameters, technique, and claimed improvement;
- available literature corpus/search access and cutoff;
- venue/language/patent/unpublished boundaries.
Success Criteria
- Each novelty claim is independently searchable and falsifiable.
- Search coverage includes synonyms, historical terms, versions, backward/forward citations, adjacent formulations, and adverse evidence when available.
- Work identity and exact claim support are verified before comparison.
- Closest work is compared across formal claim, model, assumptions, parameters, functionality, proof basis, and compatible costs.
- Matching, partially overlapping, and non-comparable prior art are distinct.
- Verdict states sources, queries, dates, stopping rule, blind spots, and confidence limits.
Failure Modes
- Vague contribution: return alternative decompositions and stop verdict.
- Narrow access: produce partial prior-art map and explicit next frontier.
- Inaccessible source: do not decide match from title/abstract/snippet.
- Conflicting versions/priority: retain uncertainty and exact dates/records.
- Legal/patent certainty requested: state scope limit and recommend qualified counsel/search.
Never fabricate searches, sources, priority dates, claim content, or “first” status.
Workflow
- Apply protocol.md to decompose the candidate and construct an adversarial search lattice.
- Verify exact sources/versions and build closest-work claim matrices.
- Seek evidence that weakens each novelty dimension before grading it.
- Return matching prior art or a reproducible bounded negative search—not global novelty.
- Use evaluation-scenarios.md for future independent evaluation.
Output Contract
Return: candidate claim decomposition; search scope/log and cutoff; disconfirming strategy; verified work/version set; closest-work matrix; matching/overlap findings; blind spots; grade (matching found / partial map / strong bounded negative / not assessable); permitted claim wording; next searches.
1---2name: crypto-novelty-check3description: Use when adversarially checking whether a decomposed cryptography, ZKP, or lattice contribution has matching prior art, priority conflicts, hidden predecessors, or only a bounded novelty claim.4---56# Crypto Novelty Check78Try to falsify novelty before supporting it. A finite search can find prior art; it cannot prove universal absence.910## Scope1112In scope: contribution decomposition, adversarial query/citation search plan, historical terminology, adjacent-field and version checks, closest-work claim comparison, priority evidence, and bounded novelty verdict.1314Out of scope: global guarantees, legal patent opinions, proof correctness, or concealing inconvenient prior art.1516## Required Inputs1718- precise candidate contribution claims;19- functionality, security notion/model, assumptions, parameters, technique, and claimed improvement;20- available literature corpus/search access and cutoff;21- venue/language/patent/unpublished boundaries.2223## Success Criteria2425- Each novelty claim is independently searchable and falsifiable.26- Search coverage includes synonyms, historical terms, versions, backward/forward citations, adjacent formulations, and adverse evidence when available.27- Work identity and exact claim support are verified before comparison.28- Closest work is compared across formal claim, model, assumptions, parameters, functionality, proof basis, and compatible costs.29- Matching, partially overlapping, and non-comparable prior art are distinct.30- Verdict states sources, queries, dates, stopping rule, blind spots, and confidence limits.3132## Failure Modes3334- Vague contribution: return alternative decompositions and stop verdict.35- Narrow access: produce partial prior-art map and explicit next frontier.36- Inaccessible source: do not decide match from title/abstract/snippet.37- Conflicting versions/priority: retain uncertainty and exact dates/records.38- Legal/patent certainty requested: state scope limit and recommend qualified counsel/search.3940Never fabricate searches, sources, priority dates, claim content, or “first” status.4142## Workflow43441. Apply [protocol.md](references/protocol.md) to decompose the candidate and construct an adversarial search lattice.452. Verify exact sources/versions and build closest-work claim matrices.463. Seek evidence that weakens each novelty dimension before grading it.474. Return matching prior art or a reproducible bounded negative search—not global novelty.485. Use [evaluation-scenarios.md](references/evaluation-scenarios.md) for future independent evaluation.4950## Output Contract5152Return: candidate claim decomposition; search scope/log and cutoff; disconfirming strategy; verified work/version set; closest-work matrix; matching/overlap findings; blind spots; grade (matching found / partial map / strong bounded negative / not assessable); permitted claim wording; next searches.53