arXiv:2611.16588v1 Announce Type: new Abstract: Affected-version ranges in vulnerability databases decide which deployments scanners, patching pipelines, and incident responders treat as vulnerable, yet these ranges are often incomplete, so vulnerable releases are silently treat…
⏱ Độ trễ thật của tab này: trung bình 7.3 giờ sau khi CVE được công bố (n = 5336, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.
arXiv:2611.18449v1 Announce Type: new Abstract: RFC 6979 derives the ECDSA nonce as $k = F_x(h)$, with $F_x$ HMAC_DRBG keyed by the signing key x. We isolate the assumption its security rests on, A*: at known public key $Q = xG$, the signing transcript under nonces $F_x()$ is in…
arXiv:2611.14794v1 Announce Type: new Abstract: Proof-step verification rewrites a solver's answer into typed steps and uses LLM judges to certify or decline. We evaluate this pipeline on open-weight models across GPQA, AIME-2025, and a MATH-500 subset. Certification raises answ…
arXiv:2611.14844v1 Announce Type: new Abstract: Many advances in ML systems came from breaking an assumption that earlier methods took for granted: speculative decoding dropped the assumption that a model needs one forward pass per token. Yet algorithms rarely state their assump…
arXiv:2611.14984v1 Announce Type: new Abstract: Reward models (RMs) are increasingly deployed as service components in LLM alignment pipelines, where payment, audit, moderation, and governance workflows act on the scores they return. An inference proof alone does not show whethe…
arXiv:2611.10031v1 Announce Type: new Abstract: Autonomous agents increasingly execute consequential actions on behalf of users, but ordinary middleware guardrails do not provide cryptographic proof that a policy was actually enforced. Their verdicts leave counterparties depende…
arXiv:2611.11394v1 Announce Type: new Abstract: Digital innovations have strongly improved ship capabilities, including command, control & communication, navigation and combat management. In the wake of digitisation and geopolitical stress, resilience against cyber-attacks has b…
arXiv:2611.14698v1 Announce Type: new Abstract: Incrementally verifiable computation (IVC) allows a prover to maintain a short proof that can be efficiently updated after each computation step, without retaining or recomputing the preceding execution. Standard IVC schemes do not…
arXiv:2611.15432v1 Announce Type: new Abstract: We prove that the cyclotomic field $K_{11}=\mathbb{Q}(\zeta_{11})$ is unit reducible but not strongly unit reducible. So every nonzero principal fractional ideal of $K_{11}$ has a generator that is a shortest nonzero vector. For $I…
arXiv:2611.16495v1 Announce Type: new Abstract: We implement privacy-preserving local electricity exchanges using an automated market maker on the Hyperledger Besu network under QBFT consensus. The proposed protocol operator collects individual electricity positions off-chain an…
arXiv:2611.16922v1 Announce Type: new Abstract: An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRY…
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…
arXiv:2611.13042v1 Announce Type: new Abstract: Artificial intelligence (AI) systems now produce research results in bulk: in October 2026 a single laboratory released more than 700 AI-generated mathematics manuscripts, only part of them with machine-checked proofs. Such volumes…
arXiv:2611.13131v1 Announce Type: new Abstract: A serious criticism of Bitcoin's Proof-of-Work is its enormous electricity consumption. Proof-of-Useful-Work (PoUW), introduced by Ball, Rosen, Sabin, and Vasudevan (2017), in which mining performs useful computations, was suggeste…
arXiv:2611.10233v1 Announce Type: new Abstract: Mathematical understanding depends on the route from hypotheses to conclusion: how the parts of a proof function and which dependencies carry the argument forward. This structure can persist when wording or notation changes, while …
arXiv:2611.10234v1 Announce Type: new Abstract: A phone screen can be wrong in ways that need no reference: a label that runs off the screen, letters that touch, a line that breaks one character before its end, one button with sharp corners among round ones. We ask whether a mod…
arXiv:2611.10020v1 Announce Type: new Abstract: Secure aggregation in domains such as federated learning, Internet of Things, and voting requires operating on private inputs while preserving confidentiality, verifying that each input satisfies constraints, and avoiding trusted p…