Coverage · Florida
Florida divorce forms, computed from your documents.
Florida files divorce through 67 counties, and Paxora prepares 14 of its court forms from a person’s own documents, each kept byte-identical to the court’s current copy. Core divorce packet auto-filled. The same engine runs every other state below.
50 states live · select your state to see the forms we prepare
The forms we prepare in Florida
Florida
- Petition for Dissolution of Marriage
- Summons: Personal Service on an Individual
- Family Law Financial Affidavit - Long Form
- Certificate of Compliance with Mandatory Disclosure
- Parenting Plan
- Child Support Guidelines Worksheet
The forms most people recognize, part of the 14 we prepare in Florida.
Core divorce packet auto-filled, across all 67 counties. Every value traced to its source and ready for you to review.
However you got here, our guides can walk you through itPipeline
Documents in, a court-ready filing out.
INPUT
Tax returns, W-2s, bank and mortgage statements, paystubs, or a signed client questionnaire mapped once, CALDA’s first.
EXTRACT
Structured financial data, read from each document.
MAP
Every value resolved to every form field, under each state's own rules.
COMPUTE
A court-ready filing, solved by deterministic mathematics, traceable to the source line.
Every field is solved by mathematics, from a line on a document to a field on a form, traced end to end. No large language model sits anywhere in the path, and nothing is generated or guessed, so the same input yields the same filing, every time.
Why it is hard
No two states agree.
Residency, waiting periods, and support math differ in every one. States also revise their forms without notice; the engine re-checks every form against its state's official source every two weeks and flags the change. One path produces a correct filing in all fifty states.
The law, as data
Three bodies of law decide whether a filing is accepted. Paxora holds all three.
One unit is one form, one ground for refusal or one verified fact, 2,587 in all.
547
Official court forms
Every divorce form the fifty states and their counties publish, held as the exact PDF each court accepts.
Republished by a judicial council, a court administrator or the state supreme court, with no notice on the file.
1,589
Grounds for refusing a filing
Every published reason a clerk may refuse a filing, each one quoting the court's own rule with its citation.
A supreme court amends by order, a presiding judge by administrative order, a clerk without either.
451
Verified filing facts
Fees, deadlines, residency and waiting periods, each citing the page that set it or recording that the state publishes nothing.
Set by a legislature, a county board, a judicial council or a sheriff, each on its own clock.
- States live
- 50
- Filing jurisdictions
- 3,142
- Form fields modeled
- 82,887
- Inference at runtime
- 0
The claim, written down
The three bodies above, written as one claim. Whether a court accepts a filing is a computable predicate.
P is the set of every possible packet, j a filing jurisdiction, F the official court forms and Φ the filing facts, G the published grounds for refusing a filing, T the court's current copy of each form, h a byte hash, E evidence, whole(p) whether the output Paxora produced is whole, R the renderer, and d the drift distance.
P = J × 2F × 2Φp = (j, Fp, Φp)
Packet · what Paxora assembles
One filing jurisdiction of 3,142, the court forms in the packet, and the filing facts behind it.
A(p) ≡ ⋀g∈G(j) ¬viol(g,p) ∧ ⋀f∈Fp h(f) = h(Tj(f)) ∧ ⋀φ∈Φp E(φ) ∧ whole(p)
Acceptance · what Paxora tests, the three bodies of law
The three bodies of law above, as one test, plus Paxora's own output. 1. No published ground for refusing the filing applies. 2. Every official court form matches the court's current copy byte for byte. 3. Every filing fact carries evidence. 4. The output Paxora produced is whole.
E(φ) ⟺ φ ∈ Cited ⊔ Nulldocut+1 ≤ ut
Evidence · how Paxora holds the third body of law
A filing fact cites the page that set it, or records that the state publishes nothing. The count without evidence can only fall.
A : P → {0, 1}total computablep1 = p2 ⟹ R(p1) = R(p2)
Determinism · how Paxora decides
Code that always finishes, no model in the path, and identical packets render identical bytes.
download(p)↓ ⟺ whole(p) ∧ ∀x ∈ X(p) : fixed(x) ∨ (filer(x) ∧ overrideinformed(x))
Gate · what Paxora withholds
A packet downloads only when its output is whole and every defect is fixed or, where the filer's own paperwork caused it, knowingly overridden. A defect Paxora caused is never released, under any override.
d(t, t′) = (δbytes, δpages, δtext, δrev)ship(f) ⟹ d(f, τcourt(f)) = 0
Drift · how Paxora watches the courts
Distance from a form we ship to the court's live copy, over four signals: bytes, page count, wording, and the printed revision date. Ships only at zero.
These six lines are the specification: ordinary mathematics, stated in a proof language, where a proof checker confirms on every build, for every packet at once, that acceptance always answers, that a withheld packet always names a published rule that was violated and never knowingly overridden, that a defect Paxora caused is never released, and that an acceptable packet is never withheld or refused. The proof language used for that check was Lean 4.
Every line is Paxora, before a packet ships and after, and each build checks the gate that runs in production against it. Law as a decidable predicate is forty years old. Holding every term of it as live data across fifty states is the new part.
What stays off this page
How a new state is absorbed is the engine.
That is the part built over many months, and it does not appear here. If you serve families, or build for those who do, let’s have that conversation.
Request access