Community mesh: the mechanisms, running in your browser
Every control below runs the real logic on this page: RFC 9474 blind signatures, a Merkle settlement log with witnesses, tier-weighted admission and the audit arithmetic. The numbers come from the paper's experiment and virtual lab outputs, embedded unchanged.
1. Ask without being known runs here
The subscription authority signs a token it cannot read. The pool accepts the token without learning which subscriber holds it. Test key: RFC 9474 Appendix A.3 (public test material).
Press "Issue a token".
2. Catch a cheating contributor measured detection rates
An audit replays a sampled request. How fast a persistent cheat is caught depends on the audit rate and on what the audit compares.
3. Contribution moves you up the queue runs here
The pool cannot see who is asking, so priority rides on the token's tier. Queued requests are granted to the tier with the least service per unit weight.
4. A ledger nobody can quietly rewrite runs here
Credits and penalties go into a hash tree after the request is over. Witnesses sign each tree head only if it extends the history they have already seen.
Press "Seal an epoch".
5. Virtual lab evidence recorded run
| Scenario | What happened | Result |
|---|
6. Admission policies under load simulation
| Policy | Contributors p95 wait | Others p95 wait | Heavy members' share of service |
|---|