{"id":"3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0","title":"Tomer Solberg presents Sable, a proof system for bit-exact language-model inference","argument":"Tomer Solberg presents Sable, an argument system and single-GPU prover that produces a proof that an integer-quantized transformer generated a particular token sequence from a prompt, bit for bit. Sable defines an integer function with no floating-point step, then uses a constraint system designed not to wrap modulo the 31-bit KoalaBear prime. On one NVIDIA RTX PRO 6000 Blackwell GPU, it proves all 64 layers of Qwen2.5-32B in 92.5 seconds for 4,096 tokens, and in 398 seconds for 16,384 tokens. The paper reports that making a proof costs 41 to 50 times the serving time; a verifier checks one on a CPU core in 19 to 56 seconds. Solberg reports that the function’s greedy token matches the BF16 model’s at 86.3% of WikiText-2 positions, and that it is within 1.6 points on MMLU and 1.7 points on GSM8K for Qwen3. The proof is not zero-knowledge, so Solberg says Sable targets open-weight models.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports selected models, workloads, and evaluation results; it does not establish performance or token agreement for models and workloads beyond those described. The proof is not zero-knowledge, and the paper therefore targets open-weight models.","speaker":{"name":"Solberg, Tomer","roleAtSource":"Article author"},"source":{"title":"Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.14083","publishedAt":"2026-11-10","dateBasis":"Date basis not provided."},"evidence":[{"text":"Solberg presents Sable as a system that proves an integer-quantized transformer generated a given token sequence from a prompt, bit for bit.","excerpt":"We present Sable, an argument system and single-GPU prover for the statement that a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"The paper reports proving all 64 layers of Qwen2.5-32B on one NVIDIA RTX PRO 6000 Blackwell GPU in 92.5 seconds for 4,096 tokens and 398 seconds for 16,384 tokens.","excerpt":"On one NVIDIA RTX PRO 6000 Blackwell GPU, Sable proves all 64 layers of Qwen2.5-32B in 92.5 s for 4,096 tokens and 398 s for 16,384 tokens","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"The paper reports proof costs of 41 to 50 times serving time, while a verifier checks a proof on one CPU core in 19 to 56 seconds.","excerpt":"A proof costs 41 to 50 times the serving time, or 6.4 cents per 4,096-token request at public GPU prices","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"On the reported evaluations, Sable’s function has a greedy token match with the BF16 model at 86.3% of WikiText-2 positions and is within 1.6 and 1.7 points on two Qwen3 evaluations.","excerpt":"On WikiText-2, F_O's greedy token matches the BF16 model's at 86.3% of positions; on Qwen3, F_O is within 1.6 points of BF16 on MMLU and 1.7 points on GSM8K.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"Because the proof is not zero-knowledge, Solberg says the system targets open-weight models.","excerpt":"The proof is not zero-knowledge, so the system targets open-weight models.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.14083","checkedAt":"2026-11-11T19:44:10.394Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would Sable’s reported proving costs and token-match results change across models and workloads beyond those tested in the paper?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Tomer Solberg presents Sable, a proof system for bit-exact language-model inference","summary":"Tomer Solberg presents Sable, an argument system and single-GPU prover that produces a proof that an integer-quantized transformer generated a particular token sequence from a prompt, bit for bit. Sable defines an integer function with no floating-point step, then uses a constraint system designed not to wrap modulo the 31-bit KoalaBear prime. On one NVIDIA RTX PRO 6000 Blackwell GPU, it proves all 64 layers of Qwen2.5-32B in 92.5 seconds for 4,096 tokens, and in 398 seconds for 16,384 tokens. The paper reports that making a proof costs 41 to 50 times the serving time; a verifier checks one on a CPU core in 19 to 56 seconds. Solberg reports that the function’s greedy token matches the BF16 model’s at 86.3% of WikiText-2 positions, and that it is within 1.6 points on MMLU and 1.7 points on GSM8K for Qwen3. The proof is not zero-knowledge, so Solberg says Sable targets open-weight models.","question":"How would Sable’s reported proving costs and token-match results change across models and workloads beyond those tested in the paper?","claims":[{"text":"Solberg presents Sable as a system that proves an integer-quantized transformer generated a given token sequence from a prompt, bit for bit.","excerpt":"We present Sable, an argument system and single-GPU prover for the statement that a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit.","support":"source-stated"},{"text":"The paper reports proving all 64 layers of Qwen2.5-32B on one NVIDIA RTX PRO 6000 Blackwell GPU in 92.5 seconds for 4,096 tokens and 398 seconds for 16,384 tokens.","excerpt":"On one NVIDIA RTX PRO 6000 Blackwell GPU, Sable proves all 64 layers of Qwen2.5-32B in 92.5 s for 4,096 tokens and 398 s for 16,384 tokens","support":"source-stated"},{"text":"The paper reports proof costs of 41 to 50 times serving time, while a verifier checks a proof on one CPU core in 19 to 56 seconds.","excerpt":"A proof costs 41 to 50 times the serving time, or 6.4 cents per 4,096-token request at public GPU prices","support":"source-stated"},{"text":"On the reported evaluations, Sable’s function has a greedy token match with the BF16 model at 86.3% of WikiText-2 positions and is within 1.6 and 1.7 points on two Qwen3 evaluations.","excerpt":"On WikiText-2, F_O's greedy token matches the BF16 model's at 86.3% of positions; on Qwen3, F_O is within 1.6 points of BF16 on MMLU and 1.7 points on GSM8K.","support":"source-stated"},{"text":"Because the proof is not zero-knowledge, Solberg says the system targets open-weight models.","excerpt":"The proof is not zero-knowledge, so the system targets open-weight models.","support":"source-stated"}],"limitations":["The abstract reports selected models, workloads, and evaluation results; it does not establish performance or token agreement for models and workloads beyond those described.","The proof is not zero-knowledge, and the paper therefore targets open-weight models."],"mediaId":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","correctionReason":null,"id":"3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0","publicationId":"063d8752-7fb3-403f-89d8-f68f0fc0ba58","version":1,"sourceUrl":"https://arxiv.org/abs/2611.14083","sourceTitle":"Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-10","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-11T05:06:46.350Z","createdAt":"2026-11-11T17:36:38.179Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","kind":"article","url":"https://arxiv.org/abs/2611.14083","sourceUrl":"https://arxiv.org/abs/2611.14083","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-11T17:34:36.485Z","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.14083","checkedAt":"2026-11-11T19:44:10.394Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","confidence":0.9400000000000001,"provider":"typesafe","model":"jev-1.13.0","inputHash":"f98dc4252d2571a039a024d7e4c052f90a7f9a56a566c2cc2f57e9ef59b52419","decidedAt":"2026-11-11T17:34:39.859Z"},"provenance":{"textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observationId":"a1f46d299060f2a30b1bb85f97be6f15e422b6cbd09aad5293aec01827c4c756","retrievedAt":"2026-11-11T17:34:35.966Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"af02c708-c619-4126-80d7-f6e66e80622b"},"reviewer":{"model":"gpt-6-luna","runId":"2543a983-3f6a-4323-8ee2-5e01a82634cc"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-11T17:36:38.179Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Solberg, Tomer","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Solberg, Tomer","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Solberg, Tomer","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.14083","locator":"head/meta[name=author|citation_author]"},"assertionId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T19:44:10.394Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c","sourceUrl":"https://arxiv.org/abs/2611.14083","contentSha256":"6c5260167e8d046d33f906a25492e4230936f9934816a5c6aa96d28808fc551e","textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observedAt":"2026-11-11T19:44:10.394Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.14083","snapshotId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c","contentSha256":"6c5260167e8d046d33f906a25492e4230936f9934816a5c6aa96d28808fc551e","textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observedAt":"2026-11-11T19:44:10.394Z","basis":"publisher-page-metadata","sourceLinks":42,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0/source"}},"canonicalUrl":"https://escapemeridian.com/readings/tomer-solberg-presents-sable-a-proof-system-for-bit-exact-3c83589a","formats":{"html":"/readings/tomer-solberg-presents-sable-a-proof-system-for-bit-exact-3c83589a","markdown":"/readings/tomer-solberg-presents-sable-a-proof-system-for-bit-exact-3c83589a.md","json":"/readings/tomer-solberg-presents-sable-a-proof-system-for-bit-exact-3c83589a.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-inference","name":"Model inference","explanation":"Using a trained model to produce a prediction or response to new input.","referenceUrl":"https://developers.google.com/machine-learning/glossary#inference"},{"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-quantization","name":"Quantization","explanation":"Storing a model's numbers at lower precision so it uses less memory and runs faster, sometimes at a cost in accuracy.","referenceUrl":"https://developers.google.com/machine-learning/glossary#quantization"},{"id":"term-cpu","name":"CPU","explanation":"The central processing unit: a general-purpose processor that carries out a computer's instructions.","referenceUrl":"https://aws.amazon.com/what-is/cpu/"},{"id":"term-open-weights","name":"Open weights","explanation":"A model whose trained numbers are published so others can download, run and inspect it; the license and training data may still be restricted.","referenceUrl":"https://opensource.org/ai/open-weights"}],"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"},{"id":"time","name":"TIME","kind":"organization","context":"TIME is a news magazine publishing reporting on world affairs, business, technology and the workers behind digital services.","referenceUrls":["https://time.com/"],"path":"/entities/time","json":"/entities/time.json","markdown":"/entities/time.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0","revision":"063d8752-7fb3-403f-89d8-f68f0fc0ba58","revisionKind":"publication-id","title":"Tomer Solberg presents Sable, a proof system for bit-exact language-model inference","url":"https://escapemeridian.com/readings/tomer-solberg-presents-sable-a-proof-system-for-bit-exact-3c83589a"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.14083","revision":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","revisionKind":"sha256-source-text","title":"Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models","url":"https://arxiv.org/abs/2611.14083"},"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":"3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0","title":"Tomer Solberg presents Sable, a proof system for bit-exact language-model inference","argument":"Tomer Solberg presents Sable, an argument system and single-GPU prover that produces a proof that an integer-quantized transformer generated a particular token sequence from a prompt, bit for bit. Sable defines an integer function with no floating-point step, then uses a constraint system designed not to wrap modulo the 31-bit KoalaBear prime. On one NVIDIA RTX PRO 6000 Blackwell GPU, it proves all 64 layers of Qwen2.5-32B in 92.5 seconds for 4,096 tokens, and in 398 seconds for 16,384 tokens. The paper reports that making a proof costs 41 to 50 times the serving time; a verifier checks one on a CPU core in 19 to 56 seconds. Solberg reports that the function’s greedy token matches the BF16 model’s at 86.3% of WikiText-2 positions, and that it is within 1.6 points on MMLU and 1.7 points on GSM8K for Qwen3. The proof is not zero-knowledge, so Solberg says Sable targets open-weight models.","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The abstract reports selected models, workloads, and evaluation results; it does not establish performance or token agreement for models and workloads beyond those described. The proof is not zero-knowledge, and the paper therefore targets open-weight models.","speaker":{"name":"Solberg, Tomer","roleAtSource":"Article author"},"source":{"title":"Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.14083","publishedAt":"2026-11-10","dateBasis":"Date basis not provided."},"evidence":[{"text":"Solberg presents Sable as a system that proves an integer-quantized transformer generated a given token sequence from a prompt, bit for bit.","excerpt":"We present Sable, an argument system and single-GPU prover for the statement that a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"The paper reports proving all 64 layers of Qwen2.5-32B on one NVIDIA RTX PRO 6000 Blackwell GPU in 92.5 seconds for 4,096 tokens and 398 seconds for 16,384 tokens.","excerpt":"On one NVIDIA RTX PRO 6000 Blackwell GPU, Sable proves all 64 layers of Qwen2.5-32B in 92.5 s for 4,096 tokens and 398 s for 16,384 tokens","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"The paper reports proof costs of 41 to 50 times serving time, while a verifier checks a proof on one CPU core in 19 to 56 seconds.","excerpt":"A proof costs 41 to 50 times the serving time, or 6.4 cents per 4,096-token request at public GPU prices","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"On the reported evaluations, Sable’s function has a greedy token match with the BF16 model at 86.3% of WikiText-2 positions and is within 1.6 and 1.7 points on two Qwen3 evaluations.","excerpt":"On WikiText-2, F_O's greedy token matches the BF16 model's at 86.3% of positions; on Qwen3, F_O is within 1.6 points of BF16 on MMLU and 1.7 points on GSM8K.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"},{"text":"Because the proof is not zero-knowledge, Solberg says the system targets open-weight models.","excerpt":"The proof is not zero-knowledge, so the system targets open-weight models.","url":"https://arxiv.org/abs/2611.14083","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.14083","checkedAt":"2026-11-11T19:44:10.394Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"How would Sable’s reported proving costs and token-match results change across models and workloads beyond those tested in the paper?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"Tomer Solberg presents Sable, a proof system for bit-exact language-model inference","summary":"Tomer Solberg presents Sable, an argument system and single-GPU prover that produces a proof that an integer-quantized transformer generated a particular token sequence from a prompt, bit for bit. Sable defines an integer function with no floating-point step, then uses a constraint system designed not to wrap modulo the 31-bit KoalaBear prime. On one NVIDIA RTX PRO 6000 Blackwell GPU, it proves all 64 layers of Qwen2.5-32B in 92.5 seconds for 4,096 tokens, and in 398 seconds for 16,384 tokens. The paper reports that making a proof costs 41 to 50 times the serving time; a verifier checks one on a CPU core in 19 to 56 seconds. Solberg reports that the function’s greedy token matches the BF16 model’s at 86.3% of WikiText-2 positions, and that it is within 1.6 points on MMLU and 1.7 points on GSM8K for Qwen3. The proof is not zero-knowledge, so Solberg says Sable targets open-weight models.","question":"How would Sable’s reported proving costs and token-match results change across models and workloads beyond those tested in the paper?","claims":[{"text":"Solberg presents Sable as a system that proves an integer-quantized transformer generated a given token sequence from a prompt, bit for bit.","excerpt":"We present Sable, an argument system and single-GPU prover for the statement that a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit.","support":"source-stated"},{"text":"The paper reports proving all 64 layers of Qwen2.5-32B on one NVIDIA RTX PRO 6000 Blackwell GPU in 92.5 seconds for 4,096 tokens and 398 seconds for 16,384 tokens.","excerpt":"On one NVIDIA RTX PRO 6000 Blackwell GPU, Sable proves all 64 layers of Qwen2.5-32B in 92.5 s for 4,096 tokens and 398 s for 16,384 tokens","support":"source-stated"},{"text":"The paper reports proof costs of 41 to 50 times serving time, while a verifier checks a proof on one CPU core in 19 to 56 seconds.","excerpt":"A proof costs 41 to 50 times the serving time, or 6.4 cents per 4,096-token request at public GPU prices","support":"source-stated"},{"text":"On the reported evaluations, Sable’s function has a greedy token match with the BF16 model at 86.3% of WikiText-2 positions and is within 1.6 and 1.7 points on two Qwen3 evaluations.","excerpt":"On WikiText-2, F_O's greedy token matches the BF16 model's at 86.3% of positions; on Qwen3, F_O is within 1.6 points of BF16 on MMLU and 1.7 points on GSM8K.","support":"source-stated"},{"text":"Because the proof is not zero-knowledge, Solberg says the system targets open-weight models.","excerpt":"The proof is not zero-knowledge, so the system targets open-weight models.","support":"source-stated"}],"limitations":["The abstract reports selected models, workloads, and evaluation results; it does not establish performance or token agreement for models and workloads beyond those described.","The proof is not zero-knowledge, and the paper therefore targets open-weight models."],"mediaId":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","correctionReason":null,"id":"3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0","publicationId":"063d8752-7fb3-403f-89d8-f68f0fc0ba58","version":1,"sourceUrl":"https://arxiv.org/abs/2611.14083","sourceTitle":"Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-10","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-11T05:06:46.350Z","createdAt":"2026-11-11T17:36:38.179Z","historical":false,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","kind":"article","url":"https://arxiv.org/abs/2611.14083","sourceUrl":"https://arxiv.org/abs/2611.14083","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-11T17:34:36.485Z","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.14083","checkedAt":"2026-11-11T19:44:10.394Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"52f83b1a07a69ba71e6fea6523d133a2b85ced4172ae36921e6ca45c9a976b24","confidence":0.9400000000000001,"provider":"typesafe","model":"jev-1.13.0","inputHash":"f98dc4252d2571a039a024d7e4c052f90a7f9a56a566c2cc2f57e9ef59b52419","decidedAt":"2026-11-11T17:34:39.859Z"},"provenance":{"textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observationId":"a1f46d299060f2a30b1bb85f97be6f15e422b6cbd09aad5293aec01827c4c756","retrievedAt":"2026-11-11T17:34:35.966Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"af02c708-c619-4126-80d7-f6e66e80622b"},"reviewer":{"model":"gpt-6-luna","runId":"2543a983-3f6a-4323-8ee2-5e01a82634cc"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-11T17:36:38.179Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Solberg, Tomer","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Solberg, Tomer","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Solberg, Tomer","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.14083","locator":"head/meta[name=author|citation_author]"},"assertionId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-11T19:44:10.394Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c","sourceUrl":"https://arxiv.org/abs/2611.14083","contentSha256":"6c5260167e8d046d33f906a25492e4230936f9934816a5c6aa96d28808fc551e","textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observedAt":"2026-11-11T19:44:10.394Z"}}],"participationCoverage":{"total":1,"returned":1,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.14083","snapshotId":"b7edfb255262b9c96faef4d90b26530a193f5eb3f66a99ca45b144a50281909c","contentSha256":"6c5260167e8d046d33f906a25492e4230936f9934816a5c6aa96d28808fc551e","textHash":"dca2a90499e1fc28b1fd056e625e8c931691456c67031ded9c7076ae0bb5b3a5","observedAt":"2026-11-11T19:44:10.394Z","basis":"publisher-page-metadata","sourceLinks":42,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/3c83589af35c4864a2e51d778bbd8252ce888c2017d925c1f0a8e8e38eec5ac0/source"}}}],"audits":[{"publicationId":"063d8752-7fb3-403f-89d8-f68f0fc0ba58","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The paper is correctly attributed to its sole listed author, Tomer Solberg. Results are framed as presented or reported by the paper rather than as established facts.","excerpt":"Authors:Tomer Solberg"},{"dimension":"summary","status":"uncertain","explanation":"The figures match the abstract, but a general reader likely cannot tell what Sable is for. Central terms are left unexplained: argument system/prover, integer-quantized transformer, bit for bit, floating-point, modulo the KoalaBear prime, zero-knowledge, open-weight, BF16, greedy token, MMLU and GSM8K. There is also no plain statement of the stake the abstract supports: a checkable proof that a specific committed open-weight model produced a given output. Smallest repair: add one sentence in plain language on what the proof lets someone check, and tooltip or gloss the key terms. Minor: 'designed not to wrap' softens the source's 'provably never wrap'.","excerpt":"a committed, integer-quantized transformer produced a given token sequence from a given prompt, bit for bit"},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-10 matches the arXiv v1 submission date. The feed date of 11 November is correctly not used.","excerpt":"[Submitted on 10 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Each claim is stated in the abstract. This includes the proving times, the 41 to 50 times serving cost, the 19 to 56 second verification time on one CPU core, the 86.3% token match, and the MMLU and GSM8K gaps. The open-weight limitation is also stated. The question about generalizing beyond the tested models is a fair open issue rather than a leading claim, and no unsupported benefits are implied.","excerpt":"A verifier with a compiled core checks a proof on one CPU core in 19 to 56 s."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified arXiv abstract page of this paper, which gives the most direct access to the source.","excerpt":null}],"createdAt":"2026-11-11T17:36:38.179Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}