SMT prior-art DAG · patent routing

Patent claims as first-order logic

Ambiguous claim language becomes machine-checkable predicates. Overlap with prior art is decided by a solver, and royalties stream along the dependency tree that falls out of it.

FIG. 1CLAIM DEPENDENCY DAG · PRIOR-ART SUBSUMPTION0→10→21→32→32→43→54→512141618202222Claim 1 parses to 18 first-order predicates. Each edge is an entailment query;the chain from 12 to 22 is discharged UNSAT against 412,980 prior-art nodes.REFERENCE NUMERALS — 12 independent claim · 14, 16 dependent claims · 18, 20 prior-art clusters · 22 royalty sink FIG. 2ROYALTY DISTRIBUTION ALONG THE DAG123456fractional micro-payment per hop, 0.00042 ETH/s
Claim invariantUNSATnovel against corpus
Prior-art nodes412,980indexed
Dependency depth12 levelstopological
Royalty stream0.00042 ETH/sper downstream use

01 — the translationWhat a claim becomes

A patent claim is written to be argued over, not to be computed. FluidIP parses the independent claim into first-order logic predicates — in the reference case, eighteen of them from Claim 1 — and from there the question “is this already covered?” becomes a satisfiability query rather than an examiner's judgement.

[0001] A method comprising receiving a first signal, wherein the first signal is transformed according to a predetermined relation…
[0002] Parsed to: ∃x ∀y ( S(x) ∧ R(x,y) → T(y) ) — 18 predicates, 4 free variables.
[0003] Entailment against prior-art clusters: C1 ¬(PA ∨ PB) → UNSAT, no counterexample returned.
[AST-PARSE]Independent Claim 1 parsed into 18 first-order logic predicates
[SMT-SOLVER]Checking entailment: C_1 ¬(P_A ∨ P_B) → UNSAT, counterexample none
[ROYALTY-MESH]Micro-licence dispatched along the topological dependency DAG
[SETTLEMENT]Zero-knowledge proof of non-infringement verified

02 — comparedAgainst the patent office

MetricLegacy patent officesFluidIP protocol
examination duration2 to 4 years of backlogsub-minute automated SMT proof
infringement resolutionyears of high-court litigation, $2M+ in feesalgorithmic AST equivalence proof
royalty distributionlump sums behind closed NDAs and lawyerscontinuous micropayment streaming mesh
prior-art coveragemanual examiner keyword searchingtopological DAG satisfiability check
git clone https://github.com/KELLERBABG/FluidIP.git
cd FluidIP && cargo test        # verify a claim against the local prior-art SMT corpus
FluidIP · Keller Systems repository  /  kellersystems.dev