UVS: Recomputing Draw Fairness, Not Trusting Certificates

This review examines UVS (Uncloned Verification Standard), a proposed technical standard for verifiable random draws. It shifts proof of fairness from opaque certificates to recomputable evidence, addressing trust issues in lotteries, gacha, and raffles.

The Answer Up Front

UVS (Uncloned Verification Standard) offers a compelling solution for indie founders and small teams building features that require auditable random draws, such as in-game gacha mechanics, raffles, or lotteries. Its core innovation is a tiered system for assessing draw fairness based on verifiable evidence, moving beyond the industry's reliance on often-unverified certifications. Developers needing to demonstrate cryptographic integrity for their random outcomes, particularly those operating in regulated or trust-sensitive environments, should consider UVS. Teams comfortable with existing "provably fair" badges that lack deep verifiability, or whose primary concern is input integrity rather than outcome integrity, may find UVS an over-specification for their needs. The bottom line is that UVS provides a robust framework for proving outcome fairness, making it a valuable standard for high-stakes random events.

Methodology

This v0 review draws on the founder Constantin Razinsky's published claims at dev.to, accessed on 2026-06-15. Independent benchmarks are pending. Update cadence: re-tested when claims diverge from observed behavior. The review covers the UVS standard as described, including the deriveTier function, the uvLottery mechanics, and the proposed use of drand and RFC-3161 TSAs for commitment anchoring. It analyzes the technical details presented in the blog post, focusing on the cryptographic primitives and the logic for achieving different tiers of verifiability. This review does not cover independent performance benchmarks, long-term workflow integration, or edge cases not explicitly addressed in the source material. It also does not evaluate the broader market adoption or existing implementations of the UVS standard, as the source is a foundational proposal.

What It Does

Evidence-based Tiering

UVS introduces the deriveTier function, a central component that assigns a trust tier to a draw based on the cryptographic evidence attached to it, rather than a self-proclaimed badge. This function evaluates the provided proof and categorizes the draw into one of three tiers:

• 🔴 (Red): No anchor, relying on a bare seed. This represents the lowest trust level.
• 🟡 (Yellow): Notary, self-anchor, or a beacon binding without proof that the commitment was made before the randomness was known. This offers a moderate level of trust.
• 🟢 (Green): Achieved with a neutral-registry signature, trail immutability, or outcome-binding with a proven commitment. This signifies the highest level of verifiable fairness.

Honest Scope and Limitations

The standard explicitly defines its scope: UVS proves that the published rules were followed on the published inputs using the published randomness. The founder, Constantin Razinsky, is clear that UVS does not prove the honesty of the inputs themselves. An operator could still manipulate participant lists or misrepresent prize pools. UVS secures the outcome link comprehensively, while guarding inputs, KYC, and licensing remain separate control challenges. This upfront honesty contrasts with many "provably fair" claims that often imply broader integrity than they deliver.

uvLottery Mechanics

The uvLottery branch of UVS, designed for draws and gacha, uses a seeded permutation. It combines a serverSeed with public drand randomness (specifically, the quicknet's 3-second ticks) via SHA-256 to create a combinedSeed. Each participant's id is then hashed with this combinedSeed to generate a score. Prizes are dealt by sorting participants based on these scores (descending, with ties broken by id). This process ensures that the same inputs will always produce the same sorted list on any machine, providing deterministic and recomputable outcomes.

Commitment Anchoring

To prevent operators from grinding seeds to achieve desired outcomes, uvLottery outcomes bind to a drand round whose randomness is not yet available at the time of commitment. For a 🟢 tier, a stronger commitment anchor is required. The commitmentHash (without the drand round) is timestamped using two independent RFC-3161 TSAs (Timestamping Authorities), such as FreeTSA and DigiCert, operating in parallel across different jurisdictions. The drand round is then derived from this cryptographically proven timestamp, ensuring the round is strictly after the commitment time. This construction prevents the operator from choosing the drand round, thereby eliminating seed grinding.

What's Interesting / What's Not

What's most interesting about UVS is its direct challenge to the prevalent "trust us" model in verifiable randomness. The founder's background building casino slot machines lends significant weight to the critique of paper certificates and unverified "provably fair" badges. The explicit, programmatic tiering via deriveTier is a meaningful improvement, forcing operators to demonstrate cryptographic evidence rather than simply claim fairness. This shifts the burden of proof to the system itself, making fairness a recomputable fact. The transparent scope, clearly stating what UVS does and does not guarantee, is also a refreshing departure from common overselling in this space. The integration of drand for public randomness and the use of two independent RFC-3161 TSAs for commitment anchoring are technically sound choices that provide strong, auditable guarantees against operator manipulation of the random outcome.

What's less developed in the source is the practical implementation aspect. While the standard is clearly defined, the blog post does not detail public SDKs, reference implementations, or the "second branch" of randomness mechanics mentioned in the section header. The focus on outcome fairness, while critical, means UVS does not address the equally important problem of input integrity (e.g., ensuring all legitimate participants are included and no phantom entries exist). This is acknowledged by the founder, but it means UVS is a necessary but not sufficient condition for a truly fair system. The cost and latency implications of using two RFC-3161 TSAs in parallel for every 🟢-tier draw are also not discussed, which could be a practical consideration for high-volume systems.

Pricing

The source material describes UVS as a technical standard and does not mention any associated pricing for its use or implementation. It appears to be an open framework.

Verdict

UVS is a significant step forward for any founder or team needing to build truly verifiable random draw systems. Its strength lies in its methodical, evidence-based approach to fairness, moving from trust to recomputability. For applications like gacha, lotteries, or raffles where public trust and auditability are paramount, UVS provides a robust framework for proving the integrity of the random outcome. While it doesn't solve the problem of input honesty, its clear delineation of scope and strong cryptographic underpinnings make it a superior choice compared to many existing "provably fair" claims. We recommend UVS for developers prioritizing cryptographic verifiability of random outcomes.

What We'd Test Next

Our next steps would involve seeking out or building a reference implementation of UVS to benchmark its practical performance. We would test the latency and computational overhead of generating combinedSeed and score(id) for large participant lists (e.g., 100,000+ entries). We would also investigate the real-world cost and latency involved in obtaining and verifying timestamps from two RFC-3161 TSAs for 🟢-tier draws. Furthermore, we would explore the details of the "second branch" of randomness mechanics alluded to in the source, if and when it is publicly detailed, to understand its specific applications and guarantees. Finally, we would assess the ease of integrating UVS into existing application stacks and the availability of community support or tooling.

The investor read

UVS signals a growing demand for verifiable transparency in digital systems, particularly where trust in random outcomes is critical (e.g., gaming, NFTs, digital lotteries). The founder's critique of current "provably fair" systems highlights a market gap for genuinely auditable solutions. While UVS is presented as a standard rather than a product, its adoption could drive demand for tooling, libraries, and services that implement it. Companies building infrastructure for verifiable randomness, or those offering RFC-3161 TSA services, could see increased relevance. An investable company in this space would likely offer a robust, easy-to-integrate SDK or API that abstracts away the cryptographic complexity of UVS, potentially with a managed service for drand and TSA interactions, targeting high-volume, trust-sensitive applications. This could be a deliberate small/bootstrapped play if the goal is to establish a foundational open standard.