Tootfinder

Lessons Learned So Far From Verifying the Rust Standard Library (work-in-progress)
Alex Le Blanc, Patrick Lam
https://arxiv.org/abs/2510.01072 https://arxi…

Lessons Learned So Far From Verifying the Rust Standard Library (work-in-progress)
Although Rust primarily intends to be a safe programming language that excludes undefined behaviour, it provides its users with the escape hatch of unsafe Rust, allowing them to circumvent some of its strong compile-time checks. This additional freedom has some advantages, including potentially more efficient code, which is one of the main reasons why unsafe code is used extensively throughout Rust's standard library. However, because unsafe code also re-opens the door to undefined behaviour, A…

A theoretical guarantee for SyncRank
Yang Rao
https://arxiv.org/abs/2509.22766 https://arxiv.org/pdf/2509.22766

A theoretical guarantee for SyncRank
We present a theoretical and empirical analysis of the SyncRank algorithm for recovering a global ranking from noisy pairwise comparisons. By adopting a complex-valued data model where the true ranking is encoded in the phases of a unit-modulus vector, we establish a sharp non-asymptotic recovery guarantee for the associated semidefinite programming (SDP) relaxation. Our main theorem characterizes a critical noise threshold - scaling as sigma = O(sqrt(n / log n)) - below which SyncRank achieves…