Skip to content
This repository has been archived by the owner on Nov 14, 2023. It is now read-only.

Policy of Tree Algorithms IANA registry #8

Open
letmaik opened this issue Apr 24, 2022 · 0 comments
Open

Policy of Tree Algorithms IANA registry #8

letmaik opened this issue Apr 24, 2022 · 0 comments

Comments

@letmaik
Copy link
Contributor

letmaik commented Apr 24, 2022

From https://mailarchive.ietf.org/arch/msg/scitt/bCi2TJZ65B9ltLKaEftm_ePxwL8/.

Ben suggested that the Tree Algorithms registry should have a lenient policy like "Expert Review", or "Specification Required", or even "First Come, First Served". Currently it's TBD. The reasoning being that the purpose of the registry "seems to be to avoid collisions rather than to reliably avoid duplication of effort". This issue tracks the discussion.

Note that there are two other proposed registries for hash and signature algorithms, but we can deal with them later on.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant