LATIDIA · Ciberseguridad

Sable: A Small-Field Sumcheck Argument for Bit-Exact Inference of Large Language Models

arXiv: 2611.14083v1Tipo de anuncio: nuevo Resumen: Presentamos Sable, un sistema de argumentos y demostrador de GPU única para la afirmación de que un transformador cuantificado con enteros comprometido produjo una secuencia de tokens dada a partir de un pr dado

La noticia

arXiv:2611.14083v1 Announce Type: new Abstract: 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. Sable fixes an integer function F_O with no floating-point step, in which every rounding, normalization, softmax and sampling decision is determined by its inputs, and proves it with a constraint system whose relations provably never wrap modulo the 31-bit KoalaBear prime. The proof batches zerochecks and LogUp-GKR lookups into one sumcheck per domain, and commits to every witness tensor and weight in one multilinear commitment built from Reed-Solomon codes, BLAKE3 Merkle trees and a mixed-length BaseFold