You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 14, 2023. It is now read-only.
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.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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.
The text was updated successfully, but these errors were encountered: