{"id":"8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8","title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry — arXiv cs.AI, tested on NVIDIA GPUs","argument":"Xiuyuan Qi, Pedro Reviriego, Javier Conde and Shanshan Liu present BlockLock, a method intended to make a protected request produce the same output when the other requests in its batch change. They argue that existing approaches either constrain every operator or sacrifice shared prefill compute and pad decode. BlockLock instead keeps shared batched prefill and pins only the protected request’s numerical path. Its two modes, BlockLock-Rows and BlockLock-Pack, use different ways of fixing the geometry seen by that request. Under a stated per-deployment contract, the authors report that both preserve the target’s output bitwise when its companions change. In tests across five dense models and three single-GPU deployments, they report preserving target sequences and Top20-logit bits. At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant. The authors say BlockLock needs no custom kernel implementations compared with batch-invariant kernels, and constrains only protected requests. The results describe the reported tests and contract; they do not by themselves establish performance or reproducibility for other deployments.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The evidence is an abstract-level account of reported tests across five dense models and three single-GPU deployments; it also mentions initial tensor-parallel experiments on two NVIDIA A6000 GPUs. The reported reproducibility guarantee is stated under a per-deployment contract; the supplied evidence does not establish its scope beyond that contract and the reported tests.","speaker":{"name":"Qi, Xiuyuan, Reviriego, Pedro, Conde, Javier, Liu, Shanshan","roleAtSource":"Article author"},"source":{"title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.06977","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors propose BlockLock to preserve a protected request’s output when its batch companions change, while keeping shared batched prefill.","excerpt":"BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"The authors describe two modes: BlockLock-Rows and BlockLock-Pack, with different ways of fixing the geometry seen by the protected request.","excerpt":"two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"Under a stated per-deployment contract, the authors report bitwise preservation when companions change; reported tests also preserve target sequences and Top20-logit bits.","excerpt":"Under a stated per-deployment contract, both modes preserve the target's output bitwise when its companions change.","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant, according to the authors.","excerpt":"reduces latency by 53.5--55.0\\% and improves throughput by 115.2--122.2\\% relative to vLLM Batch-Invariant","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06977","checkedAt":"2026-11-08T07:56:06.629Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Would BlockLock preserve the target’s output bitwise under the stated per-deployment contract on models and deployments beyond those tested?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry — arXiv cs.AI, tested on NVIDIA GPUs","summary":"Xiuyuan Qi, Pedro Reviriego, Javier Conde and Shanshan Liu present BlockLock, a method intended to make a protected request produce the same output when the other requests in its batch change. They argue that existing approaches either constrain every operator or sacrifice shared prefill compute and pad decode. BlockLock instead keeps shared batched prefill and pins only the protected request’s numerical path. Its two modes, BlockLock-Rows and BlockLock-Pack, use different ways of fixing the geometry seen by that request. Under a stated per-deployment contract, the authors report that both preserve the target’s output bitwise when its companions change. In tests across five dense models and three single-GPU deployments, they report preserving target sequences and Top20-logit bits. At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant. The authors say BlockLock needs no custom kernel implementations compared with batch-invariant kernels, and constrains only protected requests. The results describe the reported tests and contract; they do not by themselves establish performance or reproducibility for other deployments.","question":"Would BlockLock preserve the target’s output bitwise under the stated per-deployment contract on models and deployments beyond those tested?","claims":[{"text":"The authors propose BlockLock to preserve a protected request’s output when its batch companions change, while keeping shared batched prefill.","excerpt":"BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request","support":"source-stated"},{"text":"The authors describe two modes: BlockLock-Rows and BlockLock-Pack, with different ways of fixing the geometry seen by the protected request.","excerpt":"two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing","support":"source-stated"},{"text":"Under a stated per-deployment contract, the authors report bitwise preservation when companions change; reported tests also preserve target sequences and Top20-logit bits.","excerpt":"Under a stated per-deployment contract, both modes preserve the target's output bitwise when its companions change.","support":"source-stated"},{"text":"At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant, according to the authors.","excerpt":"reduces latency by 53.5--55.0\\% and improves throughput by 115.2--122.2\\% relative to vLLM Batch-Invariant","support":"source-stated"}],"limitations":["The evidence is an abstract-level account of reported tests across five dense models and three single-GPU deployments; it also mentions initial tensor-parallel experiments on two NVIDIA A6000 GPUs.","The reported reproducibility guarantee is stated under a per-deployment contract; the supplied evidence does not establish its scope beyond that contract and the reported tests."],"mediaId":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","correctionReason":null,"id":"8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8","publicationId":"29613995-45ee-4162-8555-78a374b76f11","version":1,"sourceUrl":"https://arxiv.org/abs/2611.06977","sourceTitle":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:11:11.301Z","createdAt":"2026-11-08T05:49:32.198Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","kind":"article","url":"https://arxiv.org/abs/2611.06977","sourceUrl":"https://arxiv.org/abs/2611.06977","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-08T05:48:45.809Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06977","checkedAt":"2026-11-08T07:56:06.629Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","confidence":0.91,"provider":"typesafe","model":"jev-1.13.0","inputHash":"8d6ffdb90e67446229ef2248949bd4d735e4254d926d66c71b59f72a6142cb11","decidedAt":"2026-11-08T05:48:47.823Z"},"provenance":{"textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observationId":"d36440e675ab7d34f942eff30d62d9eef3325571fe41e7848349413d5f691be8","retrievedAt":"2026-11-08T05:48:45.499Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"669ab865-24f9-48b3-8ccc-10ad4951d5f3"},"reviewer":{"model":"gpt-6-luna","runId":"95b6f803-ee46-484d-8f77-0908035ce0e0"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-08T05:49:32.198Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Qi, Xiuyuan","url":null,"kind":"unknown"},{"name":"Reviriego, Pedro","url":null,"kind":"unknown"},{"name":"Conde, Javier","url":null,"kind":"unknown"},{"name":"Liu, Shanshan","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Qi, Xiuyuan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Qi, Xiuyuan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Reviriego, Pedro","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Reviriego, Pedro","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Conde, Javier","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Conde, Javier","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Liu, Shanshan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Liu, Shanshan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.06977","snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8/source"}},"canonicalUrl":"https://escapemeridian.com/readings/blocklock-reproducible-llm-inference-with-fixed-batch-geometry-8ee30b02","formats":{"html":"/readings/blocklock-reproducible-llm-inference-with-fixed-batch-geometry-8ee30b02","markdown":"/readings/blocklock-reproducible-llm-inference-with-fixed-batch-geometry-8ee30b02.md","json":"/readings/blocklock-reproducible-llm-inference-with-fixed-batch-geometry-8ee30b02.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-llm","name":"Large language model","explanation":"A language model with many learned numerical settings, used to process and generate language.","referenceUrl":"https://developers.google.com/machine-learning/glossary#large-language-model"},{"id":"term-gpu","name":"Graphics processing unit","explanation":"A chip that performs many calculations at once; the main hardware used to train and run AI models.","referenceUrl":"https://en.wikipedia.org/wiki/Graphics_processing_unit"},{"id":"term-latency","name":"Latency","explanation":"The delay between sending a request and receiving the result.","referenceUrl":"https://developers.google.com/machine-learning/glossary#latency"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"},{"id":"nvidia","name":"NVIDIA","kind":"organization","context":"NVIDIA develops processors, networking and software used for AI, graphics and scientific computing.","referenceUrls":["https://blogs.nvidia.com/"],"path":"/entities/nvidia","json":"/entities/nvidia.json","markdown":"/entities/nvidia.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8","revision":"29613995-45ee-4162-8555-78a374b76f11","revisionKind":"publication-id","title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry — arXiv cs.AI, tested on NVIDIA GPUs","url":"https://escapemeridian.com/readings/blocklock-reproducible-llm-inference-with-fixed-batch-geometry-8ee30b02"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.06977","revision":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","revisionKind":"sha256-source-text","title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry","url":"https://arxiv.org/abs/2611.06977"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8","title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry — arXiv cs.AI, tested on NVIDIA GPUs","argument":"Xiuyuan Qi, Pedro Reviriego, Javier Conde and Shanshan Liu present BlockLock, a method intended to make a protected request produce the same output when the other requests in its batch change. They argue that existing approaches either constrain every operator or sacrifice shared prefill compute and pad decode. BlockLock instead keeps shared batched prefill and pins only the protected request’s numerical path. Its two modes, BlockLock-Rows and BlockLock-Pack, use different ways of fixing the geometry seen by that request. Under a stated per-deployment contract, the authors report that both preserve the target’s output bitwise when its companions change. In tests across five dense models and three single-GPU deployments, they report preserving target sequences and Top20-logit bits. At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant. The authors say BlockLock needs no custom kernel implementations compared with batch-invariant kernels, and constrains only protected requests. The results describe the reported tests and contract; they do not by themselves establish performance or reproducibility for other deployments.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The evidence is an abstract-level account of reported tests across five dense models and three single-GPU deployments; it also mentions initial tensor-parallel experiments on two NVIDIA A6000 GPUs. The reported reproducibility guarantee is stated under a per-deployment contract; the supplied evidence does not establish its scope beyond that contract and the reported tests.","speaker":{"name":"Qi, Xiuyuan, Reviriego, Pedro, Conde, Javier, Liu, Shanshan","roleAtSource":"Article author"},"source":{"title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.06977","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors propose BlockLock to preserve a protected request’s output when its batch companions change, while keeping shared batched prefill.","excerpt":"BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"The authors describe two modes: BlockLock-Rows and BlockLock-Pack, with different ways of fixing the geometry seen by the protected request.","excerpt":"two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"Under a stated per-deployment contract, the authors report bitwise preservation when companions change; reported tests also preserve target sequences and Top20-logit bits.","excerpt":"Under a stated per-deployment contract, both modes preserve the target's output bitwise when its companions change.","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"},{"text":"At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant, according to the authors.","excerpt":"reduces latency by 53.5--55.0\\% and improves throughput by 115.2--122.2\\% relative to vLLM Batch-Invariant","url":"https://arxiv.org/abs/2611.06977","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06977","checkedAt":"2026-11-08T07:56:06.629Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Would BlockLock preserve the target’s output bitwise under the stated per-deployment contract on models and deployments beyond those tested?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry — arXiv cs.AI, tested on NVIDIA GPUs","summary":"Xiuyuan Qi, Pedro Reviriego, Javier Conde and Shanshan Liu present BlockLock, a method intended to make a protected request produce the same output when the other requests in its batch change. They argue that existing approaches either constrain every operator or sacrifice shared prefill compute and pad decode. BlockLock instead keeps shared batched prefill and pins only the protected request’s numerical path. Its two modes, BlockLock-Rows and BlockLock-Pack, use different ways of fixing the geometry seen by that request. Under a stated per-deployment contract, the authors report that both preserve the target’s output bitwise when its companions change. In tests across five dense models and three single-GPU deployments, they report preserving target sequences and Top20-logit bits. At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant. The authors say BlockLock needs no custom kernel implementations compared with batch-invariant kernels, and constrains only protected requests. The results describe the reported tests and contract; they do not by themselves establish performance or reproducibility for other deployments.","question":"Would BlockLock preserve the target’s output bitwise under the stated per-deployment contract on models and deployments beyond those tested?","claims":[{"text":"The authors propose BlockLock to preserve a protected request’s output when its batch companions change, while keeping shared batched prefill.","excerpt":"BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request","support":"source-stated"},{"text":"The authors describe two modes: BlockLock-Rows and BlockLock-Pack, with different ways of fixing the geometry seen by the protected request.","excerpt":"two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing","support":"source-stated"},{"text":"Under a stated per-deployment contract, the authors report bitwise preservation when companions change; reported tests also preserve target sequences and Top20-logit bits.","excerpt":"Under a stated per-deployment contract, both modes preserve the target's output bitwise when its companions change.","support":"source-stated"},{"text":"At equal delivered work, BlockLock-Rows reduces latency and improves throughput relative to vLLM Batch-Invariant, according to the authors.","excerpt":"reduces latency by 53.5--55.0\\% and improves throughput by 115.2--122.2\\% relative to vLLM Batch-Invariant","support":"source-stated"}],"limitations":["The evidence is an abstract-level account of reported tests across five dense models and three single-GPU deployments; it also mentions initial tensor-parallel experiments on two NVIDIA A6000 GPUs.","The reported reproducibility guarantee is stated under a per-deployment contract; the supplied evidence does not establish its scope beyond that contract and the reported tests."],"mediaId":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","correctionReason":null,"id":"8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8","publicationId":"29613995-45ee-4162-8555-78a374b76f11","version":1,"sourceUrl":"https://arxiv.org/abs/2611.06977","sourceTitle":"BlockLock: Reproducible LLM Inference with Fixed Batch Geometry","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-06T05:11:11.301Z","createdAt":"2026-11-08T05:49:32.198Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","kind":"article","url":"https://arxiv.org/abs/2611.06977","sourceUrl":"https://arxiv.org/abs/2611.06977","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-08T05:48:45.809Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06977","checkedAt":"2026-11-08T07:56:06.629Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"2173f7bc6c09b49ce1a64d592ab2e6c228130a5b6769b425a386c0a980c992c1","confidence":0.91,"provider":"typesafe","model":"jev-1.13.0","inputHash":"8d6ffdb90e67446229ef2248949bd4d735e4254d926d66c71b59f72a6142cb11","decidedAt":"2026-11-08T05:48:47.823Z"},"provenance":{"textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observationId":"d36440e675ab7d34f942eff30d62d9eef3325571fe41e7848349413d5f691be8","retrievedAt":"2026-11-08T05:48:45.499Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"669ab865-24f9-48b3-8ccc-10ad4951d5f3"},"reviewer":{"model":"gpt-6-luna","runId":"95b6f803-ee46-484d-8f77-0908035ce0e0"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-08T05:49:32.198Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Qi, Xiuyuan","url":null,"kind":"unknown"},{"name":"Reviriego, Pedro","url":null,"kind":"unknown"},{"name":"Conde, Javier","url":null,"kind":"unknown"},{"name":"Liu, Shanshan","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Qi, Xiuyuan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Qi, Xiuyuan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Reviriego, Pedro","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Reviriego, Pedro","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Conde, Javier","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Conde, Javier","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}},{"actor":{"name":"Liu, Shanshan","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Liu, Shanshan","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06977","locator":"head/meta[name=author|citation_author]"},"assertionId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-08T07:56:06.629Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","sourceUrl":"https://arxiv.org/abs/2611.06977","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z"}}],"participationCoverage":{"total":4,"returned":4,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.06977","snapshotId":"3198ed9f1a5d335ff41ce0d388ec5747195845dbcd421a8a666535ae1aba9c74","contentSha256":"132b996c172c771d7587da65241aaf375e8989a4614f5d1adb4219fb610931e7","textHash":"5169ede41ee3fb194e0ba81112bf0dbceb627bfdb3aac3c5fdf126d7600bcc7e","observedAt":"2026-11-08T07:56:06.629Z","basis":"publisher-page-metadata","sourceLinks":43,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/8ee30b02551af89e742e5f7a6afe4984c7f93f7a488d9d506c87fb7e0e6c58e8/source"}}}],"audits":[{"publicationId":"29613995-45ee-4162-8555-78a374b76f11","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading correctly credits Xiuyuan Qi, Pedro Reviriego, Javier Conde and Shanshan Liu and frames the results as the authors' reported findings.","excerpt":"Authors:Xiuyuan Qi, Pedro Reviriego, Javier Conde, Shanshan Liu"},{"dimension":"summary","status":"uncertain","explanation":"The summary follows the abstract faithfully, but a non-specialist could not follow it. Central terms are left unexplained in plain language: batch, prefill, decode, operator, kernel, batch geometry, bitwise, Top20-logit bits and vLLM Batch-Invariant. The draft also never says in plain terms why identical output regardless of batch companions matters. Smallest repair: add brief plain-language explanations or term-library tooltips for these terms, and include the source's own one-line definition of reproducible inference. Do not add new motives.","excerpt":"Reproducible LLM inference requires that a request produces the same output regardless of the other requests in the batch."},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-04 matches the arXiv v1 submission date. It is not the later feed date.","excerpt":"[Submitted on 4 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"The claims, limitations and question are grounded in the abstract. The performance claim is scoped to the comparison at equal delivered work against vLLM Batch-Invariant. The bitwise claim keeps the per-deployment contract condition. The question flags an open issue without assuming an answer, and no benefits or costs are invented.","excerpt":"Both modes preserve target sequences and Top20-logit bits in the reported tests."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct arXiv abstract page for this paper, which is the most direct way to access the source.","excerpt":null}],"createdAt":"2026-11-08T05:49:32.198Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}