토픽 정보
- 이름
- Rust
- Slug
- rust
- 관련 키워드
- and, the, rust, for, with, that, code, existing
- 최근 7일 변화
- MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
- 마지막 업데이트
- 2026-11-21T07:24:13.427Z
출처별 최신 반응
I Don't Trust Visual Recordings Anymore. But One Day I Will Again
Ask HN: Should Uber Ratings Decay over Time?
I’ve been thinking about how platforms like Uber calculate reputation scores, and I believe there’s a fundamental flaw in how historical ratings are treated. Uber calculates passenger ratings using the last 500 rated tr...
How to Bypass Rust's Orphan Rule
Show HN: Radiotherapy Delivery Demo
The treatment planning station (TPS) software field is currently monopolized by Varian's Eclipse and Raystation from Raysearch. Current software is still using technology stack 2 decades old. At UT Southwest Medica...
Verified Implementation of the Next-gen Borrow Checking Algorithm for Rust via Abstract Interpretation
Borrow checking is a central mechanism for Rust to ensure temporal memory safety. Its correctness is based on the intuition that the Aliasing XOR Mutability discipline guarantees that programs without borrow errors inherently could not access invalid references (i.e., pointers). However, existing work on formalizing borrow checking treats it either as a component of type systems or as symbolic execution describing resource transfer. None provides a direct explanation of the correctness of borrow checking algorithm...
Enforcing Accountable Disclosure in Confidential AI
Advances in CPU and GPU confidential computing enable confidential AI, allowing LLMs to process user prompts without exposing them to service providers or infrastructure operators. However, AI agents often need to send prompt-derived information to external services, and providers may also require limited disclosure for safety monitoring and failure diagnosis. We propose CORDE, a system for confidential virtual machines (CVMs) designed to satisfy the principle of Confine or Declare: user-derived data is confined b...
Sundance: A Simple SMT Solver for Program Verification
We present Sundance, an SMT solver for program verification written in about 13,600 lines of Rust. Sundance combines the Cadical SAT solver with congruence closure, linear arithmetic, algebraic datatypes, and pattern-based quantifier instantiation. Sundance produces eDRAT proofs for every unsat answer. On 21,531 queries from Verus, Dafny, and F*, Sundance is comparable to existing solvers, with 26--38 times fewer lines of code than Z3 and cvc5. We further show that its components can be swapped for Z3's arithmetic...
Verified but Vacuous: Three Failure Surfaces of LLM-Driven Verified Code Generation
What should ``verified'' mean when evaluating LLM-generated code? Many existing pipelines report a single verification number. We argue this collapses three distinct properties measured in a conditional audit sequence: verifier acceptance (Surface A), \emph{syntactic specification binding (Surface B: does the proof obligation bind to the spec?), and \emph{semantic specification fidelity} (Surface C: does the spec capture the informal requirement?). Two empirical demonstrations show the surfaces separate. \textbf{F...
Proving the Wrong Program: Miscompilations as a Threat to zkVM Guarantees
A zero-knowledge virtual machine (zkVM) lets an untrusted prover convince a verifier that a program, typically Rust compiled to RISC-V, ran correctly. The proof covers the compiled binary, so a miscompilation can make a correct zkVM produce a valid proof of a computation that differs from the developer's source. We present the first empirical study of miscompilation as a threat to zkVM guarantees, on the production zkVMs SP1 and Jolt. We assemble 88 known rustc and LLVM miscompilations with Rust reproducers, using...
Modular and Efficient Approximate Nearest Neighbors Search with Vectorium and kANNolo
Approximate Nearest Neighbors (ANN) search over neural embeddings powers modern retrieval systems such as Retrieval-Augmented Generation. Embeddings come in three representations (dense, sparse and multi-vector), and efficient search combines an index structure, a similarity function and a quantization scheme. Existing libraries fix one combination, hard-code each one separately, or factor only one side of the problem, and none covers all three representations. We present Vectorium and kANNolo, two open-source Rus...
Eunoia: Area-Proportional Euler and Venn Diagrams in Rust, Julia, Python, R, and JavaScript
Area-proportional Euler diagrams visualize sets and their intersections through regions whose areas represent their sizes. Because many set specifications have no exact geometric representation, constructing these diagrams requires numerical optimization and diagnostics that quantify the remaining discrepancies. Eunoia is a Rust library for fitting area-proportional Euler diagrams and constructing canonical Venn diagrams. It supports circles, ellipses, squares, and rectangles, computes region areas analytically, a...
WFDB-x: Conformance-Tested Implementations of the WFDB Software Package in Seven Programming Languages
The WFDB format is widely used to store and exchange physiological waveforms and annotations. However, existing software implementations are limited to C, Python, and MATLAB/Octave, can produce different results in corner cases and checksum calculations, and have defaults such as sampling frequency and gain, that can lead to silent misinterpretation of recordings. We developed WFDB-x, a cross-language, performance-optimized reimplementation of WFDB in seven programming languages, with extensive unit tests, to prov...