{ "schema_version": 1, "builder_plan": { "scenario": "Your self-hosted model spends too long generating answers token by token.", "change": "Check whether a compatible draft model and serving integration exist before renting compute.", "baseline": "The same target with speculation off, then your existing drafter if you have one.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2610.28559", "title": "Large Flow Language Models", "summary": "The method replaces standard single-token AR decoding with blockwise parallel flow generation plus in-model self-speculative verification, eliminating the need for a separate draft model. The cost is a specialized training procedure that adapts a pretrained AR checkpoint into a flow model (demonstrated at 0.5B–8B with under 30B tokens), which exceeds the reader's compute budget, plus added inference complexity for blockwise asynchronous decoding and prefix caching. It can fail if pretrained flow checkpoints are not released for the reader's domain, if the 2.54x speedup does not transfer to other base models or workloads, or if quality degrades at aggressive few-step generation settings.", "rationale": "The throughput gain is attractive and requires no draft model, but it depends on flow-trained checkpoints the reader cannot produce on a 24 GB GPU, so adoption is only viable if the authors release usable weights.", "technique": "Blockwise flow LM with self-speculative decoding", "family": "decodificacao_especulativa", "recommendation": "observar", "published": "2026-10-20", "as_of": "2026-10-21", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.28559", "independent_implementations": 3, "total_implementations": 4, "stars": 126, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "The method replaces standard single-token AR decoding with blockwise parallel flow generation plus in-model self-speculative verification, eliminating the need for a separate draft model. The cost is a specialized training procedure that adapts a pretrained AR checkpoint into a flow model (demonstrated at 0.5B–8B with under 30B tokens), which exceeds the reader's compute budget, plus added inference complexity for blockwise asynchronous decoding and prefix caching. It can fail if pretrained flow checkpoints are not released for the reader's domain, if the 2.54x speedup does not transfer to other base models or workloads, or if quality degrades at aggressive few-step generation settings.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.28559", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Self-speculative decoding, verifying flow-based drafts autoregressively within a single model, yields 2.54x the throughput of an AR model at comparable quality.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.28559", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }