Baidu Unlimited-OCR is a 3B-parameter, MIT-licensed document-parsing model released on June 22, 2026, and it changes one specific thing about OCR pipelines: instead of chopping a PDF into pages, running each one separately, and stitching the output back together, it transcribes dozens of pages in a single forward pass — with a KV cache that stays flat no matter how long the output runs.
The release matters to operations teams, not just ML researchers. Every business that processes invoices, delivery documents, contracts, or scanned forms currently pays one of two taxes: a per-page cloud API bill, or the accuracy losses that come from page-by-page chopping in self-hosted stacks. A free, permissively licensed model that scores 93.23% on an independent benchmark — beating the DeepSeek-OCR baseline it was built from by 6.22 points — puts real pressure on both.
It also arrives wrapped in some hype worth correcting. Social recaps have circulated a claim that the model parses 100-page PDFs in one shot; the paper itself says dozens of pages, and independent technical coverage puts the practical ceiling near 40. This guide covers what actually shipped, the architecture in plain English, the honest benchmark picture, hardware requirements by precision tier, and the cost-versus-control math against cloud OCR APIs.
- 01MIT-licensed, 3B parameters, one month of adoption.Baidu open-sourced Unlimited-OCR on June 22, 2026 under an MIT license — a Mixture-of-Experts design with roughly 500M parameters active at inference. Support has compounded since: vLLM on June 28, Baidu Cloud on July 3, ms-swift training support on July 21.
- 02The breakthrough is constant memory, not raw accuracy.Reference Sliding Window Attention keeps visual and prompt tokens fixed while attending to only the last ~128 output tokens, so the KV cache stays bounded instead of growing with output length. That is what makes single-pass multi-page parsing possible.
- 0393.23% on OmniDocBench v1.5 — a vendor-independent benchmark.It beats the DeepSeek-OCR baseline (87.01%) by 6.22 points and DeepSeek-OCR-2 (89.17%) as well, with gains across text, formula, and table sub-metrics. OmniDocBench comes from OpenDataLab, not Baidu, which strengthens the number's credibility.
- 04The '100-page PDF' claim is not supported by primary sources.Baidu's own paper says the model transcribes dozens of pages under its 32K context limit, and independent coverage puts the practical single-pass ceiling near 40 pages. The 100-page figure traces back to a Hacker News commenter's generic illustration, not a benchmark.
- 05Free weights change the OCR cost equation — with caveats.Mistral OCR 4 charges $4 per 1,000 pages ($2 in batch). Self-hosting Unlimited-OCR removes the per-page bill and keeps sensitive documents in-house, but you trade it for GPU hardware, deployment effort, and operational ownership.
01 — The ReleaseWhat Baidu shipped — and the month since.
On June 22, 2026, Baidu published Unlimited-OCR as open weights on Hugging Face and GitHub under an MIT license — free commercial use, modification, and redistribution, no strings. The arXiv paper (“Unlimited OCR Works,” from a 17-author Baidu team) followed a day later, alongside a ModelScope listing. This is not breaking news; a month on, it is an adoption story. The official release log shows a Hugging Face Spaces demo on June 24, vLLM inference support on June 28, Baidu Cloud integration on July 3, and ms-swift training-framework support on July 21 — two days before this post’s publish date. In that window the repo has drawn tens of thousands of GitHub stars and the model card shows downloads in the millions, which is unusual traction for a task-specific 3B model.
Notably, Unlimited-OCR is not a from-scratch architecture. Baidu describes it as pushing DeepSeek-OCR “one step further,” and the repo’s acknowledgements credit DeepSeek-OCR, DeepSeek-OCR-2, and PaddleOCR directly. According to independent technical coverage, the model was continue-trained from a DeepSeek-OCR checkpoint for 4,000 steps — the visual encoder frozen, only the decoder trained — on roughly two million document samples. The innovation is a surgical attention-layer swap on a proven lineage, not a new model family.
3B MoE, ~500M active
A Mixture-of-Experts decoder behind a DeepEncoder that compresses each 1024×1024 page image into just 256 visual tokens — a 16× compression before the decoder ever sees the document.
MIT — genuinely open
Confirmed on both the Hugging Face model card and the GitHub repo. No research-only carve-outs, no revenue thresholds — the permissive end of the open-weights spectrum.
Built on DeepSeek-OCR
Credits DeepSeek-OCR, DeepSeek-OCR-2, and PaddleOCR in its acknowledgements. The contribution is a new attention mechanism in the decoder, not a ground-up rebuild.
02 — The ArchitectureWhy single-pass parsing is the real story.
Today’s standard OCR pipeline — cloud or self-hosted — chops a multi-page PDF into individual page images, runs the model on each page separately, then stitches the text back together. That workaround exists because of a memory problem: in a normal transformer decoder, every generated token is stored in a Key-Value cache that grows with output length. Transcribe a long document and the cache balloons, memory runs out, and generation slows to a crawl. Chopping avoids the blow-up but breaks anything that spans a page boundary — tables split mid-row, clause numbering, running totals on invoices.
“As the output sequence lengthens, the accumulated KV cache drives up memory consumption and progressively slows down generation.”— Baidu Unlimited-OCR authors, Unlimited OCR Works (arXiv, June 2026)
Baidu’s fix is called Reference Sliding Window Attention (R-SWA), and the intuition is human. The paper observes that “Humans exhibit no such decline in efficiency during long-horizon copying tasks” — a person transcribing a document keeps the source page in view but only holds the last sentence or two of their own writing in mind. R-SWA does the same thing. Every generated token attends to two things: the reference — all visual tokens and the prompt, kept permanently accessible — and a sliding window of only the preceding ~128 output tokens. Everything older is evicted. The result is a KV cache whose size is bounded rather than growing linearly with output length, which is precisely what lets the model transcribe dozens of pages in one pass instead of one page at a time.
Two details make this practical at speed. First, the DeepEncoder — a SAM-ViT cascaded with a CLIP-ViT — applies 16× token compression, so a full 1024×1024 page becomes 256 visual tokens. Second, the authors position R-SWA as a general-purpose mechanism, not an OCR trick: the paper suggests the same fixed-reference, sliding-output pattern could apply to speech recognition and machine translation. That framing is worth noting for anyone watching where small-model efficiency research goes next — though those transfers are future work, not shipped results.
03 — BenchmarksThe scores, on an independent benchmark.
The headline number: 93.23% overall on OmniDocBench v1.5, against 87.01% for the DeepSeek-OCR baseline the model was trained from — a 6.22-point gain — and 89.17% for DeepSeek-OCR-2. On the newer v1.6 cut of the benchmark, the paper reports 93.92%, its top score in that comparison table. These figures come from the paper and were cross-reported identically by two independent technical write-ups.
OmniDocBench v1.5 · overall score
Source: Unlimited OCR Works (arXiv, June 2026), OmniDocBench v1.5 overall scores as reported by MarkTechPost and PandailyEdit distance (lower is better)
Versus 0.073 for the DeepSeek-OCR baseline — roughly half the transcription error rate on the benchmark's text metric.
Formula CDM
Versus 83.37% for the baseline — a 9.24-point gain on the hardest structured content, mathematical notation.
Table TEDS
Versus 84.97% for the baseline — a 5.96-point gain on table-structure reconstruction, the metric that matters most for invoices and line-item documents.
Speed improved alongside accuracy. On the paper’s OmniDocBench throughput measurement in Base mode, Unlimited-OCR generates 5,580 tokens per second versus DeepSeek-OCR’s 4,951 — a 12.7% increase, with the paper noting the gap widens at longer outputs. (A separate benchmark cut measured at 6,144 output tokens shows larger margins; the two measurements come from different test conditions and shouldn’t be merged into one number.)
04 — The Reality Check“100-page PDFs” is a myth — here is the real ceiling.
If you have seen this model in a newsletter or a social recap, you may have read that it parses 100-page PDFs in a single shot. It does not — and the primary sources never claimed it did. Baidu’s own paper states the model “can transcribe dozens of pages of documents in a single forward pass” under its standard 32K maximum context length. Independent technical coverage at byteiota is more specific: the 32K context limit means roughly 40 pages is the practical single-pass maximum today, a constraint the paper acknowledges, with 128K context planned as future work.
Where did the 100-page figure come from? As best we can trace it, a Hacker News commenter used “transcribing a 100-page PDF” as a generic illustration of why the KV-cache problem matters — an explanatory example about long documents in general, not a benchmark result. That framing got compressed into a capability claim as it moved through social recaps. It is a small case study in how model hype propagates: a plausible number detaches from its context and outruns the paper it supposedly describes.
The honest accuracy picture across document length, from the paper’s own long-document test set: at 20 pages in a single pass, edit distance is 0.0572 with a 99.89% Distinct-35 score (a repetition-robustness metric); at 40-plus pages, edit distance rises to 0.1069 with Distinct-35 at 96.90%. Translation: quality degrades measurably but stays usable at the ceiling. For a 40-page contract that would otherwise be chopped into 40 independent fragments, that is still a categorical improvement.
Maximum context window
The ceiling on single-pass length, confirmed identically on GitHub, Hugging Face, and the arXiv paper. The authors plan 128K in future work.
Pages in one pass
Per independent coverage of the 32K limit. The paper's own framing is 'dozens of pages' — not the 100-page figure circulating in social recaps.
Edit distance, single pass
With 99.89% Distinct-35. At 40+ pages that degrades to 0.1069 and 96.90% — measurably worse, still usable.
05 — HardwareWhat “runs on an 8GB GPU” actually means.
The second claim that needs qualifying: “runs on an 8GB GPU” is true only for the quantized build. Per a third-party hardware guide published two days after release (a single detailed source — treat the specifics as indicative rather than gospel), the full-precision BF16 model weighs about 6.78GB on disk and wants 12GB of VRAM minimum, with 24GB recommended for comfortable production use — RTX 4090 or A100 class. The 8GB figure applies to the 8-bit quantized GGUF build; a 4-bit build reportedly fits in 6GB.
| Precision build | Minimum VRAM / RAM | Recommended | Accuracy trade-off |
|---|---|---|---|
| Full precision (BF16) | 12GB VRAM | 24GB (RTX 4090 / A100 class) | None — this is the benchmarked configuration |
| 8-bit quantized (GGUF Q8) | 8GB VRAM / RAM | Not stated | Modest quality loss expected — the build behind the “8GB GPU” headline |
| 4-bit quantized (GGUF Q4) | 6GB VRAM / RAM | Not stated | Larger quality loss expected — experimentation on constrained hardware |
Deployment support is broad for a month-old release. The official repo documents Hugging Face Transformers, vLLM (with official Docker images for CUDA 13.0 and CUDA 12.9/Hopper), and SGLang with an OpenAI-compatible API; aggregator coverage also mentions Ollama and llama.cpp support, and the model is listed on ModelScope and Baidu Cloud. If you are matching a model build to a GPU budget, the tier-matching framework in our open-weight self-hosting hardware guide applies here unchanged: pick the precision your hardware runs comfortably, then validate accuracy on your own documents before committing.
06 — Cost and ControlFree weights vs the per-page bill.
Here is the business decision underneath the architecture talk. The best-sourced cloud comparison point is Mistral OCR 4 — covered in our Mistral OCR 4 breakdown — at an official $4 per 1,000 pages on the standard API, or $2 per 1,000 with the batch discount. Unlimited-OCR’s weights cost nothing and carry an MIT license, so the entire trade is per-page billing versus hardware and operational ownership.
| Option | Per 1,000 pages | At 100K pages / yr | Data leaves your infra? | Setup effort |
|---|---|---|---|---|
| Baidu Unlimited-OCR (self-hosted) | $0 license — compute only | GPU + ops (model your own load) | No | High — GPU, deployment stack, monitoring |
| Mistral OCR 4 (standard API) | $4 | $400 | Yes | Low — API key and go |
| Mistral OCR 4 (Batch API) | $2 | $200 | Yes | Low — async batch jobs |
Read the middle column honestly. At 100,000 pages a year, the cloud bill is $200 to $400 — for most businesses, that is not a number worth building infrastructure to avoid. “Free” weights are not free to run: you pay in GPU hours, deployment work, and the ongoing operational attention a self-hosted service demands. On cost alone, the API wins at low and moderate volume, and it is not close.
The stronger argument for self-hosting is control. Invoices, proof-of-delivery documents, signed contracts, and condition reports are among the most sensitive artifacts an operations team touches — full of customer names, addresses, pricing, and signatures. A local model means none of that ever transits a third-party server, which matters in regulated industries, in client-confidentiality contexts, and for any team whose counsel has opinions about processor agreements. It is the same logic we laid out for self-hosted speech-to-text: the API is cheaper until data governance makes it expensive. And single-pass parsing adds a quality argument the per-page APIs structurally lack — documents whose meaning spans pages stay intact.
07 — Honest LimitationsWhat the authors — and the practitioners — admit.
Credit to the paper: it does not oversell. The authors acknowledge that parsing is not truly unlimited — the 32K context still bounds the prefill, and prefill cost grows as pages accumulate despite the 16× visual compression. Multi-page mode runs in Base resolution only, so very small text can be missed on dense pages. And the R-SWA transfer to speech recognition and translation is a research direction, not a shipped capability.
The practitioner reaction adds a colder shower. The release drew a heavily engaged Hacker News thread, and the most-cited comment came from someone with a decade of skin in the game — the founder of document-parsing company Parseur:
“I've been working on Parseur for the last 10 years, and OCR has not been solved yet, let me tell you. OCR still sucks in 2026. Hopefully this might improve the situation but I haven't tested it yet.”— Parseur founder, Hacker News discussion of the release, June 2026
Other commenters in the same thread pushed back on the idea that open-source OCR is even close to production-grade, arguing that commercial services like Amazon Textract remain the bar and that open tooling is still painful to operate and inconsistent in accuracy. That skepticism is earned. Benchmark scores measure performance on curated document sets; production document streams are full of skewed scans, handwriting, stamps, coffee stains, and forty vendors’ invoice formats. A 93.23% benchmark score is a reason to run a pilot, not a reason to delete your existing pipeline.
The right posture for an ops team is exactly the Parseur founder’s: optimistic, untested claims held at arm’s length. Pull a hundred real documents from your own workflow — the ugly ones — and measure. The model is free and the test costs an afternoon; that is precisely what MIT-licensed weights are for.
08 — The PlaybookWhat this means for document-heavy ops teams.
Zoom out and the trend is bigger than one model. Attention- efficiency research that lived in frontier LLM labs a year ago is now landing in 3B task models that a mid-sized company can run on a single workstation GPU. Document parsing — a category that commanded enterprise-software pricing for two decades — is being commoditized from below by MIT-licensed weights that are one attention-swap away from research checkpoints. The distance from open-weights release to official vLLM support was six days here. That pipeline speed, more than any single benchmark number, is the signal.
Projecting forward: the authors’ stated plan to extend context from 32K to 128K would push the single-pass ceiling from roughly 40 pages toward the length of genuinely long contracts and reports — at which point the “100-page PDF” claim stops being a myth and becomes a spec. Meanwhile, expect per-page API pricing to keep compressing; Mistral’s $2 batch tier already reads like a response to open-weight pressure, and every capable free model ratchets that pressure up. Neither projection is guaranteed — but both directions of travel are visible in the last month of data.
Regulated or confidential streams
Invoices, contracts, PODs, and client documents that shouldn't transit third-party servers. Self-hosting Unlimited-OCR keeps everything in-house, and the MIT license removes procurement friction. Budget for 12-24GB of VRAM and real ops time.
Standard back-office parsing
At 100K pages a year the cloud bill is $200-400. If your documents aren't sensitive and you have no ML-ops capacity, a managed API remains the rational default — the self-hosting savings can't cover the ops overhead.
Contracts, reports, statements
If your pipeline currently chops PDFs page-by-page and stitches output — breaking tables and cross-page context — single-pass parsing up to ~40 pages is the direct fix. This is the workload where Unlimited-OCR is differentiated, not just cheaper.
No urgent OCR pain
The 128K-context version is stated future work, per-quant accuracy data doesn't exist yet, and the ecosystem is a month old. Watching for one more quarter costs nothing and the license isn't going anywhere.
Wherever you land, the pattern to steal is the pipeline, not the model: documents in, structured data out, straight into the CRM or ERP without a human retyping line items. That integration layer — extraction rules, validation, exception handling, and the workflow around failures — is where document automation actually pays for itself, and it is the core of our CRM and automation engagements. If the build-versus-buy question spans more than OCR — model selection, hosting posture, data governance — that is the exact comparative evaluation our AI transformation work starts with.
09 — ConclusionA real release under an inflated headline.
The story is dozens of pages, free — not 100 pages, magic.
Strip the social-media inflation off Baidu Unlimited-OCR and what remains is still substantial: an MIT-licensed 3B model that beats its DeepSeek-OCR baseline by 6.22 points on an independent benchmark, parses dozens of pages in a single pass through a genuinely clever attention mechanism, and accumulated a serious deployment ecosystem in its first month. The corrected claims — ~40 pages, not 100; 8GB only for the quantized build — make it less magical and no less useful.
The decision framework is simple. If your document volume is modest and your data uncontroversial, a $2-4 per 1,000-page API remains the rational buy. If your documents are sensitive, your volume is high, or your pipeline is quietly mangling multi-page documents through page-by-page chopping, the free weights have earned a pilot — on your ugliest real documents, not the benchmark’s curated ones.
The larger signal is the direction of travel: frontier attention research is compounding into small, free, task-specific models faster than the per-page pricing of the incumbent category can adjust. Teams that build the integration layer now — extraction, validation, CRM handoff — will swap models underneath it as the ceiling rises. Teams that wait for “solved” will be waiting a while; as the practitioners keep reminding everyone, OCR is not there yet. It is just getting much cheaper to find out how close.