Simple Random Candidate Selection
draft-hoffman-genarea-random-candidate-selection-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Paul E. Hoffman | ||
| Last updated | 2023-11-30 (Latest revision 2023-05-29) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document describes a process to randomly select a subset of candidates from a larger set of candidates. The process uses an unpredictable value can be trusted by all candidates. It uses randomizing based on a hash function to make the description of the process easy to understand. This draft has a GitHub repository (https://github.com/paulehoffman/ draft-hoffman-genarea-random-candidate-selection). Issues and pull requests can be made there.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)