QnEvt

QnEvt is the public documentation home for a verifiable randomness and proof system.

The project exists for one practical reason: when randomness affects a security-sensitive, auditable, or fairness-sensitive workflow, the process should leave behind evidence that can be checked later. QnEvt focuses on proof records, deterministic verification, public API contracts, security boundaries, and integration guidance.

中文文档见 README_ZH.md.

Repository Role

This repository is the project-level documentation and protocol repository. It is not the place for production server source, private deployment configuration, or hardware firmware internals.

Published here:

• project overview and repository map
• proof schema and verification rules
• public Web/API contract
• security notes and threat model
• architecture and roadmap documentation

Published elsewhere:

• Hardware-facing public client and node protocol: NanaKabu/QnEvt-entropy. Its current public client is Windows/Avalonia, but the protocol is intended to be platform-independent.

Intentionally private:

• production server implementation
• admin backend implementation
• deployment secrets and environment configuration
• production databases, logs, uploads, and generated artifacts
• private hardware design files and firmware internals

What QnEvt Provides

• Verifiable proof records: portable JSON records commit to inputs, entropy material, deterministic algorithms, and result hashes.
• Secret generation evidence: generated secrets stay local; proof metadata and output hashes can be checked.
• Audit sampling evidence: datasets can be committed by hash so third parties can reproduce a sample when authorized.
• Fair random selection evidence: participant lists, winner counts, entropy batches, and result hashes can be independently verified.
• Agent-ready randomness contract: AI agents can call QnEvt-compatible APIs and return proof URLs instead of inventing unverifiable randomness.

Documentation

Start here:

• Documentation index
• Project map
• Architecture
• Glossary
• Proof schema
• Verification guide
• API reference
• Security notes
• Threat model
• Roadmap
• Licensing

Verification Model

QnEvt does not ask users to trust hidden randomness blindly. A proof should preserve enough information for later checking:

1. Commit to the input or generation parameters with a hash.
2. Identify the entropy source or entropy batch.
3. Declare the deterministic algorithm.
4. Commit to the final result with a hash.
5. Optionally bind proof materials with client, server, or node signatures.

Raw secrets and private datasets should remain local unless the user intentionally publishes them.

License

QnEvt public documentation, schemas, and API contracts in this repository are released under the Apache License 2.0. See LICENSE and Licensing.