]> Constrained Resource Identifiers Universität Bremen TZI
Postfach 330440 Bremen D-28359 Germany +49-421-218-63921 cabo@tzi.org
Fraunhofer SIT
Rheinstrasse 75 Darmstadt 64295 Germany henk.birkholz@sit.fraunhofer.de
CoRE Working Group The Constrained Resource Identifier (CRI) is a complement to the Uniform Resource Identifier (URI) that represents the URI components in Concise Binary Object Representation (CBOR) instead of a sequence of characters. This simplifies parsing, comparison and reference resolution in environments with severe limitations on processing power, code size, and memory size. (This "cref" paragraph will be removed by the RFC editor:)
The present revision -13 of this draft picks up some additional discussion points and is intended as input to the CoRE WG meeting at IETF 117. About This Document Status information for this document may be found at . Discussion of this document takes place on the Constrained RESTful Environments Working Group mailing list (), which is archived at . Subscribe at . Source for this draft and an issue tracker can be found at .
Introduction The Uniform Resource Identifier (URI) and its most common usage, the URI reference, are the Internet standard for linking to resources in hypertext formats such as HTML or the HTTP "Link" header field. A URI reference is a sequence of characters chosen from the repertoire of US-ASCII characters. The individual components of a URI reference are delimited by a number of reserved characters, which necessitates the use of a character escape mechanism called "percent-encoding" when these reserved characters are used in a non-delimiting function. The resolution of URI references involves parsing a character sequence into its components, combining those components with the components of a base URI, merging path components, removing dot-segments, and recomposing the result back into a character sequence. Overall, the proper handling of URI references is quite intricate. This can be a problem especially in constrained environments, where nodes often have severe code size and memory size limitations. As a result, many implementations in such environments support only an ad-hoc, informally-specified, bug-ridden, non-interoperable subset of half of RFC 3986. This document defines the Constrained Resource Identifier (CRI) by constraining URIs to a simplified subset and representing their components in Concise Binary Object Representation (CBOR) instead of a sequence of characters. This allows typical operations on URI references such as parsing, comparison and reference resolution (including all corner cases) to be implemented in a comparatively small amount of code. As a result of simplification, however, CRIs are not capable of expressing all URIs permitted by the generic syntax of RFC 3986 (hence the "constrained" in "Constrained Resource Identifier"). The supported subset includes all URIs of the Constrained Application Protocol (CoAP), most URIs of the Hypertext Transfer Protocol (HTTP), Uniform Resource Names (URNs), and other similar URIs. The exact constraints are defined in .
Notational Conventions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here. In this specification, the term "byte" is used in its now customary sense as a synonym for "octet". Terms defined in this document appear in cursive where they are introduced (rendered in plain text as the new term surrounded by underscores).
Constraints A Constrained Resource Identifier consists of the same five components as a URI: scheme, authority, path, query, and fragment. The components are subject to the following constraints:
  1. The scheme name can be any Unicode string (see Definition D80 in ) that matches the syntax of a URI scheme (see , which constrains schemes to ASCII) and is lowercase (see Definition D139 in ). The scheme is always present.
  2. An authority is always a host identified by an IP address or registered name, along with optional port information, and optionally preceded by user information. Alternatively, the authority can be absent; the two cases for this defined in are modeled by two different values used in place of an absent authority:
    • the path can be root-based (zero or more path components that are each started in the URI with "/", as when the authority is present), or
    • the path can be rootless, which requires at least one path component.
    (Note that in , no-authority is marked as a feature, as not all CRI implementations will support authority-less URIs.)
  3. A userinfo is a text string built out of unreserved characters () or "sub-delims" (); any other character needs to be percent-encoded (). Note that this excludes the ":" character, which is commonly deprecated as a way to delimit a cleartext password in a userinfo.
  4. An IP address can be either an IPv4 address or an IPv6 address, optionally with a zone identifier . Future versions of IP are not supported (it is likely that a binary mapping would be strongly desirable, and that cannot be designed ahead of time, so these versions need to be added as a future extension if needed).
  5. A registered name is a sequence of one or more labels, which, when joined with dots (".") in between them, result in a Unicode string that is lowercase and in Unicode Normalization Form C (NFC) (see Definition D120 in ). (The syntax may be further restricted by the scheme. As per , a registered name can be empty, for which case a scheme can define a default for the host.)
  6. A port is always an integer in the range from 0 to 65535. Ports outside this range, empty ports (port subcomponents with no digits, see ), or ports with redundant leading zeros, are not supported.
  7. The port is omitted if and only if the port would be the same as the scheme's default port (provided the scheme is defining such a default port) or the scheme is not using ports.
  8. A path consists of zero or more path segments. Note that a path of just a single zero-length path segment is allowed — this is considered equivalent to a path of zero path segments by HTTP and CoAP, but this equivalence does not hold for CRIs in general as they only perform normalization on the Syntax-Based Normalization level (, not on the scheme-specific Scheme-Based Normalization level (). (A CRI implementation may want to offer scheme-cognizant interfaces, performing this scheme-specific normalization for schemes it knows. The interface could assert which schemes the implementation knows and provide pre-normalized CRIs. This can also relieve the application from removing a lone zero-length path segment before putting path segments into CoAP Options, i.e., from performing the check and jump in item 8 of . See also in .)
  9. A path segment can be any Unicode string that is in NFC, with the exception of the special "." and ".." complete path segments. Note that this includes the zero-length string. If no authority is present in a CRI, the leading path segment cannot be empty. (See also in .)
  10. A query always consists of one or more query parameters. A query parameter can be any Unicode string that is in NFC. It is often in the form of a "key=value" pair. When converting a CRI to a URI, query parameters are separated by an ampersand ("&") character. (This matches the structure and encoding of the target URI in CoAP requests.) Queries are optional; there is a difference between an absent query and a single query parameter that is the empty string.
  11. A fragment identifier can be any Unicode string that is in NFC. Fragment identifiers are optional; there is a difference between an absent fragment identifier and a fragment identifier that is the empty string.
  12. The syntax of registered names, path segments, query parameters, and fragment identifiers may be further restricted and sub-structured by the scheme. There is no support, however, for escaping sub-delimiters that are not intended to be used in a delimiting function.
  13. When converting a CRI to a URI, any character that is outside the allowed character range or is a delimiter in the URI syntax is percent-encoded. For CRIs, percent-encoding always uses the UTF-8 encoding form (see Definition D92 in ) to convert the character to a sequence of bytes (that is then converted to a sequence of %HH triplets).
Examples for URIs at or beyond the boundaries of these constraints are in in .
Constraints not expressed by the data model There are syntactically valid CRIs and CRI references that cannot be converted into a URI or URI reference, respectively. For CRI references, this is acceptable -- they can be resolved still and result in a valid CRI that can be converted back. Examples of this are:
  • [0, ["p"]]: appends a slash and the path segment "p" to its base (and unsets the query and the fragment)
  • [0, null, []]: leaves the path alone but unsets the query and the fragment
(Full) CRIs that do not correspond to a valid URI are not valid on their own, and cannot be used. Normatively they are characterized by the process producing a valid and syntax-normalized URI. For easier understanding, they are listed here:
  • CRIs (and CRI references) containing a path component "." or "..". These would be removed by the remove_dot_segments algorithm of , and thus never produce a normalized URI after resolution. (In CRI references, the discard value is used to afford segment removal, and with "." being an unreserved character, expressing them as "%2e" and "%2e%2e" is not even viable, let alone practical).
  • CRIs without authority whose path starts with two or more empty segments. When converted to URIs, these would violate the requirement that in absence of an authority, a URI's path cannot begin with two slash characters, and they would be indistinguishable from a URI with a shorter path and a present but empty authority component.
  • CRIs without authority that are rootless and do not have a path component (e.g., ["a", true]), which would be indistinguishable from its root-based equivalent (["a"]) as both would have the URI a:.
Creation and Normalization In general, resource identifiers are created on the initial creation of a resource with a certain resource identifier, or the initial exposition of a resource under a particular resource identifier. A Constrained Resource Identifier SHOULD be created by the naming authority that governs the namespace of the resource identifier (see also ). For example, for the resources of an HTTP origin server, that server is responsible for creating the CRIs for those resources. The naming authority MUST ensure that any CRI created satisfies the constraints defined in . The creation of a CRI fails if the CRI cannot be validated to satisfy all of the constraints. If a naming authority creates a CRI from user input, it MAY apply the following (and only the following) normalizations to get the CRI more likely to validate:
  • map the scheme name to lowercase ();
  • map the registered name to NFC () and split it on embedded dots;
  • elide the port if it is the default port for the scheme ();
  • map path segments, query parameters and the fragment identifier to NFC form (, , ).
Once a CRI has been created, it can be used and transferred without further normalization. All operations that operate on a CRI SHOULD rely on the assumption that the CRI is appropriately pre-normalized. (This does not contradict the requirement that when CRIs are transferred, recipients must operate on as-good-as untrusted input and fail gracefully in the face of malicious inputs.)
Comparison One of the most common operations on CRIs is comparison: determining whether two CRIs are equivalent, without dereferencing the CRIs (using them to access their respective resource(s)). Determination of equivalence or difference of CRIs is based on simple component-wise comparison. If two CRIs are identical component-by-component (using code-point-by-code-point comparison for components that are Unicode strings) then it is safe to conclude that they are equivalent. This comparison mechanism is designed to minimize false negatives while strictly avoiding false positives. The constraints defined in imply the most common forms of syntax- and scheme-based normalizations in URIs, but do not comprise protocol-based normalizations that require accessing the resources or detailed knowledge of the scheme's dereference algorithm. False negatives can be caused, for example, by CRIs that are not appropriately pre-normalized and by resource aliases. When CRIs are compared to select (or avoid) a network action, such as retrieval of a representation, fragment components (if any) should be excluded from the comparison.
CRI References The most common usage of a Constrained Resource Identifier is to embed it in resource representations, e.g., to express a hyperlink between the represented resource and the resource identified by the CRI. This section defines the representation of CRIs in Concise Binary Object Representation (CBOR). When reduced representation size is desired, CRIs are not represented directly. Instead, CRIs are indirectly referenced through CRI references. These take advantage of hierarchical locality and provide a very compact encoding. The CBOR representation of CRI references is specified in . The only operation defined on a CRI reference is reference resolution: the act of transforming a CRI reference into a CRI. An application MUST implement this operation by applying the algorithm specified in (or any algorithm that is functionally equivalent to it). The reverse operation of transforming a CRI into a CRI reference is not specified in detail in this document; implementations are free to use any algorithm as long as reference resolution of the resulting CRI reference yields the original CRI. Notably, a CRI reference is not required to satisfy all of the constraints of a CRI; the only requirement on a CRI reference is that reference resolution MUST yield the original CRI. When testing for equivalence or difference, applications SHOULD NOT directly compare CRI references; the references should be resolved to their respective CRI before comparison.
CBOR Representation A CRI or CRI reference is encoded as a CBOR array , with the structure as described in the Concise Data Definition Language (CDDL) including its control extensions as follows: RFC Ed.: throughout this section, please replace RFC-XXXX with the RFC number of this specification and remove this note.
CDDL for CRI CBOR representation
The rules scheme, authority, path, query, fragment correspond to the (sub‑)components of a CRI, as described in , with the addition of the discard section. This CDDL specification is simplified for exposition and needs to be augmented by the following rules for interchange of CRIs and CRI references:
  • Trailing null values MUST be removed,
  • two leading null values (scheme and authority both not given) MUST be represented by using the discard alternative instead, and
  • an empty path in a CRI MUST be represented as the empty array [] (note that for CRI-Reference there is a difference between empty and absent paths, represented by [] and null, respectively),
  • an entirely empty outer array is not a valid CRI reference.
For interchange as separate encoded data items, CRIs MUST NOT use indefinite length encoding (see ); this requirement is relaxed for specifications that embed CRIs into an encompassing CBOR representation that does provide for indefinite length encoding.
The discard Section The discard section can be used in a CRI reference when neither a scheme nor an authority is present. It then expresses the operations performed on a base CRI by CRI references that are equivalent to URI references with relative paths and path prefixes such as "/", "./", "../", "../../", etc. "." and ".." are not available in CRIs and are therefore expressed using discard after a normalization step, as is the presence or absence of a leading "/". E.g., a simple URI reference "foo" specifies to remove one leading segment from the base URI's path, which is represented in the equivalent CRI reference discard section as the value 1; similarly "../foo" removes two leading segments, represented as 2; and "/foo" removes all segments, represented in the discard section as the value true. The exact semantics of the section values are defined by . Most URI references that calls "relative references" (i.e., references that need to undergo a resolution process to obtain a URI) correspond to the CRI form that starts with discard. The exception are relative references with an authority (called a "network-path reference" in ), which discard the entire path of the base CRI. These CRI references never carry a discard section: the value of discard defaults to true.
Visualization The structure of a CRI reference is visualized using the somewhat limited means of a railroad diagram: cri-reference: scheme authority discard local-part local-part: path query fragment ─────────────────────╮ │ │ │ ╭──────────────>──────────────╮ │ │ │ │ │ │ │ ╭──────>───────╮ │ │ │ │ │ │ │ │ │├──╯── path ──╯── query ──╯── fragment ──╰──╰──╰──┤│ ]]> This visualization does not go into the details of the elements.
Examples
Specific Terminology A CRI reference is considered well-formed if it matches the structure as expressed in in CDDL, with the additional requirement that trailing null values are removed from the array. A CRI reference is considered absolute if it is well-formed and the sequence of sections starts with a non-null scheme. A CRI reference is considered relative if it is well-formed and the sequence of sections is empty or starts with a section other than those that would constitute a scheme.
Ingesting and encoding a CRI Reference From an abstract point of view, a CRI Reference is a data structure with six sections: scheme, authority, discard, path, query, fragment Each of these sections can be unset ("null"), except for discard, which is always an unsigned number or true. If scheme and/or authority are non-null, discard must be true. When ingesting a CRI Reference that is in the transfer form, those sections are filled in from the transfer form (unset sections are filled with null), and the following steps are performed:
  • If the array is entirely empty, replace it with [0].
  • If discard is present in the transfer form (i.e., the outer array starts with true or an unsigned number), set scheme and authority to null.
  • If scheme and/or authority are present in the transfer form (i.e., the outer array starts with null, a text string, or a negative integer), set discard to true.
Upon encoding the abstract form into the transfer form, the inverse processing is performed: If scheme and/or authority are not null, the discard value is not transferred (it must be true in this case). If they are both null, they are both left out and only discard is transferred. Trailing null values are removed from the array. As a special case, an empty array is sent in place for a remaining [0] (URI "").
Error handling and extensibility It is recommended that specifications that describe the use of CRIs in CBOR-based protocols use the error handling mechanisms outlined in this section. Implementations of this document MUST adhere to rules unless the containing document overrides them. When encountering a CRI that is well-formed in terms of CBOR, but that
  • is not well-formed as a CRI,
  • does not meet the other requirements on CRIs that are not covered by the term "well-formed", or
  • uses features not supported by the implementation,
the CRI is treated as "unprocessable". When encountering an unprocessable CRI, the processor skips the entire CRI top-level array, including any CBOR items contained in there, and continues processing the CBOR items surrounding the unprocessable CRI. (Note: this skipping can be implemented in bounded memory for CRIs that do not use indefinite length encoding, as mandated in .) The unprocessable CRI is treated as an opaque identifier that is distinct from all processable CRIs, and distinct from all unprocessable CRIs with different CBOR representations. It is up to implementation whether unprocessable CRIs with identical representations are treated as identical to each other or not. Unprocessable CRIs can not be dereferenced, and it is an error to query any of their components. This mechanism ensures that CRI extensions (using originally defined features or later extensions) can be used without extending the compatibility hazard to the containing document. For example, if a collection of possible interaction targets contains several CRIs, some of which use the "no-authority" feature, an application consuming that collection that does not support that feature can still offer the supported interaction targets. The duty of checking validity is with the recipients that rely on this validity. An intermediary that does not use the detailed information in a CRI (or merely performs reference resolution) MAY pass on a CRI/CRI reference without having fully checked it, relying on the producer having generated a valid CRI/CRI reference. This is true for both basic CRIs (e.g., checking for valid UTF-8) and for extensions (e.g., checking both for valid UTF-8 and the minimal use of PET elements in extended-cris as per ).
Reference Resolution The term "relative" implies that a "base CRI" exists against which the relative reference is applied. Aside from fragment-only references, relative references are only usable when a base CRI is known. The following steps define the process of resolving any well-formed CRI reference against a base CRI so that the result is a CRI in the form of an absolute CRI reference:
  1. Establish the base CRI of the CRI reference and express it in the form of an abstract absolute CRI reference.
  2. Initialize a buffer with the sections from the base CRI.
  3. If the value of discard is true in the CRI reference (which is implicitly the case when scheme and/or authority are present in the reference), replace the path in the buffer with the empty array, unset query and fragment, and set a true authority to null. If the value of discard is an unsigned number, remove as many elements from the end of the path array; if it is non-zero, unset query and fragment. Set discard to true in the buffer.
  4. If the path section is set in the CRI reference, append all elements from the path array to the array in the path section in the buffer; unset query and fragment.
  5. Apart from the path and discard, copy all non-null sections from the CRI reference to the buffer in sequence; unset query in the buffer if query is the empty array [] in the CRI reference; unset fragment in the buffer if query is non-null in the CRI reference.
  6. Return the sections in the buffer as the resolved CRI.
Relationship between CRIs, URIs and IRIs CRIs are meant to replace both Uniform Resource Identifiers (URIs) and Internationalized Resource Identifiers (IRIs) in constrained environments. Applications in these environments may never need to use URIs and IRIs directly, especially when the resource identifier is used simply for identification purposes or when the CRI can be directly converted into a CoAP request. However, it may be necessary in other environments to determine the associated URI or IRI of a CRI, and vice versa. Applications can perform these conversions as follows:
CRI to URI
A CRI is converted to a URI as specified in .
URI to CRI
The method of converting a URI to a CRI is unspecified; implementations are free to use any algorithm as long as converting the resulting CRI back to a URI yields an equivalent URI. Note that CRIs are defined to enable implementing conversions from or to URIs analogously to processing URIs into CoAP Options and back, with the exception that item 8 of and item 7 of do not apply to CRI processing. See in for more details.
CRI to IRI
A CRI can be converted to an IRI by first converting it to a URI as specified in , and then converting the URI to an IRI as described in .
IRI to CRI
An IRI can be converted to a CRI by first converting it to a URI as described in , and then converting the URI to a CRI as described above.
Everything in this section also applies to CRI references, URI references and IRI references.
Converting CRIs to URIs Applications MUST convert a CRI reference to a URI reference by determining the components of the URI reference according to the following steps and then recomposing the components to a URI reference string as specified in .
scheme
If the CRI reference contains a scheme section, the scheme component of the URI reference consists of the value of that section, if text (scheme-name); or, if a negative integer is given (scheme-id), the lower case scheme name corresponding to the scheme number as per the CRI Scheme Numbers registry . Otherwise, the scheme component is unset.
authority
If the CRI reference contains a host-name or host-ip item, the authority component of the URI reference consists of a host subcomponent, optionally followed by a colon (":") character and a port subcomponent, optionally preceded by a userinfo subcomponent. Otherwise, the authority component is unset. The host subcomponent consists of the value of the host-name or host-ip item. The userinfo subcomponent, if present, is turned into a single string by appending a "@". Otherwise, both the subcomponent and the "@" sign are omitted. Any character in the value of the userinfo elements that is not in the set of unreserved characters () or "sub-delims" () MUST be percent-encoded. The host-name is turned into a single string by joining the elements separated by dots ("."). Any character in the elements of a host-name item that is not in the set of unreserved characters () or "sub-delims" () MUST be percent-encoded. If there are dots (".") in such elements, the conversion fails (percent-encoding is not able to represent such elements, as normalization would turn the percent-encoding back to the unreserved character that a dot is.) The value of a host-ip item MUST be represented as a string that matches the "IPv4address" or "IP-literal" rule (). Any zone-id is appended to the string, separated by "%25" as defined in , or as specified in a superseding zone-id specification document ; this also leads to a modified "IP-literal" rule as specified in these documents. If the CRI reference contains a port item, the port subcomponent consists of the value of that item in decimal notation. Otherwise, the colon (":") character and the port subcomponent are both omitted.
path
If the CRI reference contains a discard item of value true, the path component is considered rooted. If it contains a discard item of value 0 and the path item is present, the conversion fails. If it contains a positive discard item, the path component is considered unrooted and prefixed by as many "../" components as the discard value minus one indicates. If the discard value is 1 and the first element of the path contains a :, the path component is prefixed by "./" (this avoids the first element to appear as supplying a URI scheme; compare path-noscheme in ). If the discard item is not present and the CRI reference contains an authority that is true, the path component of the URI reference is considered unrooted. Otherwise, the path component is considered rooted. If the CRI reference contains one or more path items, the path component is constructed by concatenating the sequence of representations of these items. These representations generally contain a leading slash ("/") character and the value of each item, processed as discussed below. The leading slash character is omitted for the first path item only if the path component is considered "unrooted". Any character in the value of a path item that is not in the set of unreserved characters or "sub-delims" or a colon (":") or commercial at ("@") character MUST be percent-encoded. If the authority component is present (not null or true) and the path component does not match the "path-abempty" rule (), the conversion fails. If the authority component is not present, but the scheme component is, and the path component does not match the "path-absolute", "path-rootless" (authority == true) or "path-empty" rule (), the conversion fails. If neither the authority component nor the scheme component are present, and the path component does not match the "path-absolute", "path-noscheme" or "path-empty" rule (), the conversion fails.
query
If the CRI reference contains one or more query items, the query component of the URI reference consists of the value of each item, separated by an ampersand ("&") character. Otherwise, the query component is unset. Any character in the value of a query item that is not in the set of unreserved characters or "sub-delims" or a colon (":"), commercial at ("@"), slash ("/") or question mark ("?") character MUST be percent-encoded. Additionally, any ampersand character ("&") in the item value MUST be percent-encoded.
fragment
If the CRI reference contains a fragment item, the fragment component of the URI reference consists of the value of that item. Otherwise, the fragment component is unset. Any character in the value of a fragment item that is not in the set of unreserved characters or "sub-delims" or a colon (":"), commercial at ("@"), slash ("/") or question mark ("?") character MUST be percent-encoded.
Extending CRIs CRIs have been designed to relieve implementations operating on CRIs from string scanning, which both helps constrained implementations and implementations that need to achieve high throughput. The CRI structure described up to this point is termed the Basic CRI. It should be sufficient for all applications that use the CoAP protocol, as well as most other protocols employing URIs. However, Basic CRIs have one limitation: They do not support URI components that require percent-encoding () to represent them in the URI syntax, except where that percent-encoding is used to escape the main delimiter in use. E.g., the URI is represented by the basic CRI However, percent-encoding that is used at the application level is not supported by basic CRIs: Extended forms of CRIs may be defined to enable these applications. They will generally extend the potential values of text components of URIs, such as userinfo, hostnames, paths, queries, and fragments. One such extended form is described in the following . Consumers of CRIs will generally notice when an extended form is in use, by finding structures that do not match the CDDL rules given in . Future definitions of extended forms need to strive to be distinguishable in their structures from the extended form presented here as well as other future forms. Extensions to CRIs MUST NOT allow indefinite length items. This provision ensures that recipients o CRIs can deal with unprocessable CRIs as described in .
Extended CRI: Accommodating Percent Encoding (PET) This section presents a method to represent percent-encoded segments of userinfo, hostnames, paths, and queries, as well as fragments. The four CDDL rules are replaced with That is, for each of the host-name, path, and query segments, and for the userinfo and fragment components, an alternate representation is provided besides a simple text string: a non-empty array of alternating non-blank text and byte strings, the text strings of which stand for non-percent-encoded text, while the byte strings retain the special semantics of percent-encoded text without actually being percent-encoded. The above DID URI can now be represented as: (Note that, in CBOR diagnostic notation, single quotes delimit literals for byte strings, double quotes for text strings.) To yield a valid extended-cri, the use of byte strings MUST be minimal. Both the following examples are therefore not valid: An algorithm for constructing a valid text-pet-sequence might repeatedly examine the byte sequences in each byte string; if such a sequence stands for an unreserved ASCII character, or constitutes a valid UTF-8 character ≥ U+0080, move this character over into a text string by appending it to the end of the preceding text string, prepending it to the start of the following text string, or splitting the byte string and inserting a new text string with this character, all while preserving the order of the bytes. (Note that the properties of UTF-8 make this a simple linear process.)
Implementation Status With the exception of the authority=true fix, host-names split into labels, and , CRIs are implemented in https://gitlab.com/chrysn/micrurus. A golang implementation of version -10 of this document is found at: https://github.com/thomas-fossati/href
Security Considerations Parsers of CRI references must operate on input that is assumed to be untrusted. This means that parsers MUST fail gracefully in the face of malicious inputs. Additionally, parsers MUST be prepared to deal with resource exhaustion (e.g., resulting from the allocation of big data items) or exhaustion of the call stack (stack overflow). See for additional security considerations relating to CBOR. The security considerations discussed in and for URIs and IRIs also apply to CRIs.
IANA Considerations
CRI Scheme Numbers Registry This specification defines a new "CRI Scheme Numbers" sub-registry in the "CoRE Parameters" registry , with the policy "Expert Review" (). The objective is to have CRI scheme number values registered for all registered URI schemes (Uniform Resource Identifier (URI) Schemes registry), as well as exceptionally for certain text strings that the Designated Expert considers widely used in constrained applications in place of URI scheme names.
Instructions for the Designated Expert The expert is instructed to be frugal in the allocation of CRI values with short representations (1+0 and 1+1 encoding), keeping them in reserve for applications that are likely to enjoy wide use and can make good use of their shortness. When the expert notices that a registration has been made in the Uniform Resource Identifier (URI) Schemes registry (see also ), the expert is requested to initiate a parallel registration in the CRI Scheme Numbers registry. CRI values in the range between 1000 and 20000 (inclusive) should be assigned unless a shorter representation in CRIs appears desirable. The expert exceptionally also may make such a registration for text strings that have not been registered in the Uniform Resource Identifier (URI) Schemes registry if and only if the expert considers the to be in wide use in place of URI scheme names in constrained applications. (Note that the initial registrations in already include such registrations for the text strings "mqtt" and "mqtts".) A registration in the CRI Scheme Numbers registry does not imply that a URI scheme under this name exists or has been registered in the Uniform Resource Identifier (URI) Schemes registry -- it essentially is only providing an integer identifier for an otherwise uninterpreted text string. Any questions or issues that might interest a wider audience might be raised by the expert on the core-parameters@ietf.org mailing list for a time-limited discussion.
Structure of Entries Each entry in the registry must include:
CRI value:
A negative integer unique in this registry
URI scheme name:
a text string that would be acceptable for registration as a URI Scheme Name in the Uniform Resource Identifier (URI) Schemes registry
Reference:
a reference to a document, if available, or the registrant
Initial Registrations The initial registrations for the CRI Scheme Numbers registry are provided in .
Update to "Uniform Resource Identifier (URI) Schemes" Registry is updated to add the following note in the "Uniform Resource Identifier (URI) Schemes" Registry :
The CRI Scheme Numbers Registry registers numeric identifiers for what essentially are URI Scheme names. Registrants for the Uniform Resource Identifier (URI) Schemes Registry are requested to make a parallel registration in the CRI Scheme Numbers registry. The number for this registration will be assigned by the Designated Expert for that registry.
References Normative References Uniform Resource Identifier (URI): Generic Syntax A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or physical resource. This specification defines the generic URI syntax and a process for resolving URI references that might be in relative form, along with guidelines and security considerations for the use of URIs on the Internet. The URI syntax defines a grammar that is a superset of all valid URIs, allowing an implementation to parse the common components of a URI reference without knowing the scheme-specific requirements of every possible identifier. This specification does not define a generative grammar for URIs; that task is performed by the individual specifications of each URI scheme. [STANDARDS-TRACK] Internationalized Resource Identifiers (IRIs) This document defines a new protocol element, the Internationalized Resource Identifier (IRI), as a complement of the Uniform Resource Identifier (URI). An IRI is a sequence of characters from the Universal Character Set (Unicode/ISO 10646). A mapping from IRIs to URIs is defined, which means that IRIs can be used instead of URIs, where appropriate, to identify resources. The approach of defining a new protocol element was chosen instead of extending or changing the definition of URIs. This was done in order to allow a clear distinction and to avoid incompatibilities with existing software. Guidelines are provided for the use and deployment of IRIs in various protocols, formats, and software components that currently deal with URIs. Representing IPv6 Zone Identifiers in Address Literals and Uniform Resource Identifiers This document describes how the zone identifier of an IPv6 scoped address, defined as in the IPv6 Scoped Address Architecture (RFC 4007), can be represented in a literal IPv6 address and in a Uniform Resource Identifier that includes such a literal address. It updates the URI Generic Syntax specification (RFC 3986) accordingly. Guidelines and Registration Procedures for URI Schemes This document updates the guidelines and recommendations, as well as the IANA registration processes, for the definition of Uniform Resource Identifier (URI) schemes. It obsoletes RFC 4395. Uniform Resource Identifier (URI) Schemes IANA Guidelines for Writing an IANA Considerations Section in RFCs Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA). To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry. This is the third edition of this document; it obsoletes RFC 5226. Representing IPv6 Zone Identifiers in Address Literals and Uniform Resource Identifiers Apple Inc. Check Point Software This document describes how the zone identifier of an IPv6 scoped address, defined as <zone_id> in the IPv6 Scoped Address Architecture (RFC 4007), can be represented in a literal IPv6 address and in a Uniform Resource Identifier that includes such a literal address. It updates the URI Generic Syntax and Internationalized Resource Identifier specifications (RFC 3986, RFC 3987) accordingly, and obsoletes RFC 6874. Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures This document proposes a notational convention to express Concise Binary Object Representation (CBOR) data structures (RFC 7049). Its main goal is to provide an easy and unambiguous way to express structures for protocol messages and data formats that use CBOR or JSON. The Unicode Standard, Version 13.0.0 The Unicode Consortium Concise Binary Object Representation (CBOR) The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack. This document obsoletes RFC 7049, providing editorial improvements, new details, and errata fixes while keeping full compatibility with the interchange format of RFC 7049. It does not create a new version of the format. Additional Control Operators for the Concise Data Definition Language (CDDL) The Concise Data Definition Language (CDDL), standardized in RFC 8610, provides "control operators" as its main language extension point. The present document defines a number of control operators that were not yet ready at the time RFC 8610 was completed:,, and for the construction of constants; / for including ABNF (RFC 5234 and RFC 7405) in CDDL specifications; and for indicating the use of a non-basic feature in an instance. Key words for use in RFCs to Indicate Requirement Levels In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Constrained RESTful Environments (CoRE) Parameters IANA Informative References Terminology for Constrained-Node Networks The Internet Protocol Suite is increasingly used on small devices with severe constraints on power, memory, and processing resources, creating constrained-node networks. This document provides a number of basic terms that have been useful in the standardization work for constrained-node networks. HTTP Semantics The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document describes the overall architecture of HTTP, establishes common terminology, and defines aspects of the protocol that are shared by all versions. In this definition are core protocol elements, extensibility mechanisms, and the "http" and "https" Uniform Resource Identifier (URI) schemes. This document updates RFC 3864 and obsoletes RFCs 2818, 7231, 7232, 7233, 7235, 7538, 7615, 7694, and portions of 7230. The Constrained Application Protocol (CoAP) The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for use with constrained nodes and constrained (e.g., low-power, lossy) networks. The nodes often have 8-bit microcontrollers with small amounts of ROM and RAM, while constrained networks such as IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs) often have high packet error rates and a typical throughput of 10s of kbit/s. The protocol is designed for machine- to-machine (M2M) applications such as smart energy and building automation. CoAP provides a request/response interaction model between application endpoints, supports built-in discovery of services and resources, and includes key concepts of the Web such as URIs and Internet media types. CoAP is designed to easily interface with HTTP for integration with the Web while meeting specialized requirements such as multicast support, very low overhead, and simplicity for constrained environments. Uniform Resource Names (URNs) A Uniform Resource Name (URN) is a Uniform Resource Identifier (URI) that is assigned under the "urn" URI scheme and a particular URN namespace, with the intent that the URN will be a persistent, location-independent resource identifier. With regard to URN syntax, this document defines the canonical syntax for URNs (in a way that is consistent with URI syntax), specifies methods for determining URN-equivalence, and discusses URI conformance. With regard to URN namespaces, this document specifies a method for defining a URN namespace and associating it with a namespace identifier, and it describes procedures for registering namespace identifiers with the Internet Assigned Numbers Authority (IANA). This document obsoletes both RFCs 2141 and 3406. Web Linking This specification defines a model for the relationships between resources on the Web ("links") and the type of those relationships ("link relation types"). It also defines the serialisation of such links in HTTP headers with the Link header field. URI Design and Ownership Section 1.1.1 of RFC 3986 defines URI syntax as "a federated and extensible naming system wherein each scheme's specification may further restrict the syntax and semantics of identifiers using that scheme." In other words, the structure of a URI is defined by its scheme. While it is common for schemes to further delegate their substructure to the URI's owner, publishing independent standards that mandate particular forms of substructure in URIs is often problematic. This document provides guidance on the specification of URI substructure in standards. This document obsoletes RFC 7320 and updates RFC 3986. HTML 5.2 Common Format and MIME Type for Comma-Separated Values (CSV) Files This RFC documents the format used for Comma-Separated Values (CSV) files and registers the associated MIME type "text/csv". This memo provides information for the Internet community.
Mapping Scheme Numbers to Scheme Names defines the initial mapping from CRI scheme numbers to URI scheme names. Mapping Scheme Numbers to Scheme Names
CRI value URI scheme Reference
-1 coap [RFCthis]
-2 coaps [RFCthis]
-3 http [RFCthis]
-4 https [RFCthis]
-5 urn [RFCthis]
-6 did [RFCthis]
-7 coap+tcp [RFCthis]
-8 coaps+tcp [RFCthis]
-9 coap+ws [RFCthis]
-10 coaps+ws [RFCthis]
-1025 telnet [RFCthis]
-1046 ldap [RFCthis]
-1056 ms-virtualtouchpad [RFCthis]
-1091 fax [RFCthis]
-1107 ves [RFCthis]
-1147 submit [RFCthis]
-1192 gg [RFCthis]
-1219 simplex [RFCthis]
-1240 ms-settings-nfctransactions [RFCthis]
-1241 secret-token [RFCthis]
-1249 acap [RFCthis]
-1276 openpgp4fpr [RFCthis]
-1300 ms-mixedrealitycapture [RFCthis]
-1307 ymsgr [RFCthis]
-1320 iris.xpcs [RFCthis]
-1351 turns [RFCthis]
-1367 opaquelocktoken [RFCthis]
-1499 platform [RFCthis]
-1597 sftp [RFCthis]
-1613 vscode [RFCthis]
-1649 mqtt [RFCthis]
-1664 ms-settings [RFCthis]
-1690 doi [RFCthis]
-1720 file [RFCthis]
-1729 dvb [RFCthis]
-1760 magnet [RFCthis]
-1768 calculator [RFCthis]
-1836 ssh [RFCthis]
-1966 gopher [RFCthis]
-1985 ms-gamingoverlay [RFCthis]
-1997 z39.50 [RFCthis]
-2032 ms-secondary-screen-setup [RFCthis]
-2038 fido [RFCthis]
-2085 mumble [RFCthis]
-2095 ms-settings-cloudstorage [RFCthis]
-2106 imap [RFCthis]
-2152 ms-officeapp [RFCthis]
-2233 pwid [RFCthis]
-2236 drm [RFCthis]
-2264 tag [RFCthis]
-2369 feed [RFCthis]
-2460 ipps [RFCthis]
-2484 xmlrpc.beeps [RFCthis]
-2492 jms [RFCthis]
-2542 wpid [RFCthis]
-2669 barion [RFCthis]
-2675 onenote [RFCthis]
-2695 icon [RFCthis]
-2769 message [RFCthis]
-2800 ms-enrollment [RFCthis]
-2804 bolo [RFCthis]
-2817 diaspora [RFCthis]
-2833 microsoft.windows.camera.picker [RFCthis]
-2864 notes [RFCthis]
-2866 amss [RFCthis]
-2873 tip [RFCthis]
-3018 fm [RFCthis]
-3042 rtmfp [RFCthis]
-3060 reload [RFCthis]
-3111 pres [RFCthis]
-3232 acd [RFCthis]
-3362 prospero [RFCthis]
-3364 geo [RFCthis]
-3414 snmp [RFCthis]
-3483 iris.beep [RFCthis]
-3510 maps [RFCthis]
-3575 content [RFCthis]
-3618 pack [RFCthis]
-3619 keyparc [RFCthis]
-3632 mongodb [RFCthis]
-3693 smb [RFCthis]
-3796 graph [RFCthis]
-3818 filesystem [RFCthis]
-3839 payment [RFCthis]
-3840 ms-settings-bluetooth [RFCthis]
-3951 palm [RFCthis]
-4027 hyper [RFCthis]
-4043 microsoft.windows.camera [RFCthis]
-4067 mvn [RFCthis]
-4098 mtqp [RFCthis]
-4130 jabber [RFCthis]
-4275 mms [RFCthis]
-4343 skype [RFCthis]
-4351 oid [RFCthis]
-4420 dict [RFCthis]
-4454 attachment [RFCthis]
-4662 ocf [RFCthis]
-4807 isostore [RFCthis]
-4816 redis [RFCthis]
-4862 ms-settings-privacy [RFCthis]
-4877 ms-settings-wifi [RFCthis]
-5004 v-event [RFCthis]
-5020 com-eventbrite-attendee [RFCthis]
-5105 teliaeid [RFCthis]
-5222 itms [RFCthis]
-5234 fish [RFCthis]
-5285 dtn [RFCthis]
-5298 vscode-insiders [RFCthis]
-5304 tftp [RFCthis]
-5347 rtsp [RFCthis]
-5358 adiumxtra [RFCthis]
-5464 smp [RFCthis]
-5470 ms-eyecontrolspeech [RFCthis]
-5479 ms-settings-language [RFCthis]
-5491 mqtts [RFCthis]
-5595 wyciwyg [RFCthis]
-5596 hcp [RFCthis]
-5619 go [RFCthis]
-5673 rediss [RFCthis]
-5683 ms-settings-cellular [RFCthis]
-5743 ldaps [RFCthis]
-5843 z39.50s [RFCthis]
-5886 bitcoincash [RFCthis]
-5960 ms-mobileplans [RFCthis]
-6182 pttp [RFCthis]
-6208 facetime [RFCthis]
-6289 gtalk [RFCthis]
-6348 afp [RFCthis]
-6361 mss [RFCthis]
-6426 ms-settings-notifications [RFCthis]
-6448 psyc [RFCthis]
-6488 tv [RFCthis]
-6514 wifi [RFCthis]
-6523 sarif [RFCthis]
-6539 moz [RFCthis]
-6659 ms-lockscreencomponent-config [RFCthis]
-6716 cabal [RFCthis]
-6734 ms-media-stream-id [RFCthis]
-6780 mupdate [RFCthis]
-6793 dis [RFCthis]
-6804 nih [RFCthis]
-6809 ms-help [RFCthis]
-6909 soap.beep [RFCthis]
-6998 iotdisco [RFCthis]
-7027 acr [RFCthis]
-7040 ms-newsandinterests [RFCthis]
-7089 hxxp [RFCthis]
-7096 ms-settings-location [RFCthis]
-7125 soap.beeps [RFCthis]
-7301 ipn [RFCthis]
-7309 nntp [RFCthis]
-7316 query [RFCthis]
-7334 smtp [RFCthis]
-7335 ms-spd [RFCthis]
-7400 ni [RFCthis]
-7403 ms-excel [RFCthis]
-7421 ms-settings-power [RFCthis]
-7435 pop [RFCthis]
-7447 session [RFCthis]
-7582 ms-infopath [RFCthis]
-7701 ms-word [RFCthis]
-7715 web+ap [RFCthis]
-7791 steam [RFCthis]
-7995 cstr [RFCthis]
-8008 web3 [RFCthis]
-8064 videotex [RFCthis]
-8069 nfs [RFCthis]
-8094 udp [RFCthis]
-8102 ed2k [RFCthis]
-8138 ms-getoffice [RFCthis]
-8203 sgn [RFCthis]
-8331 data [RFCthis]
-8364 swidpath [RFCthis]
-8385 fuchsia-pkg [RFCthis]
-8395 ms-screensketch [RFCthis]
-8426 hxxps [RFCthis]
-8487 unreal [RFCthis]
-8555 ens [RFCthis]
-8585 ms-settings-camera [RFCthis]
-8619 stun [RFCthis]
-8673 ms-stickers [RFCthis]
-8775 spotify [RFCthis]
-8860 starknet [RFCthis]
-8890 ms-settings-emailandaccounts [RFCthis]
-8907 market [RFCthis]
-8967 ms-powerpoint [RFCthis]
-9001 rtsps [RFCthis]
-9064 p1 [RFCthis]
-9128 aw [RFCthis]
-9132 mailserver [RFCthis]
-9186 irc6 [RFCthis]
-9338 ms-settings-lock [RFCthis]
-9339 hcap [RFCthis]
-9350 drop [RFCthis]
-9419 icap [RFCthis]
-9437 xcon-userid [RFCthis]
-9457 leaptofrogans [RFCthis]
-9461 ipfs [RFCthis]
-9479 bitcoin [RFCthis]
-9555 apt [RFCthis]
-9605 ms-whiteboard-cmd [RFCthis]
-9669 ssb [RFCthis]
-9725 aaas [RFCthis]
-9734 ar [RFCthis]
-9767 proxy [RFCthis]
-9773 res [RFCthis]
-9780 msrps [RFCthis]
-9795 aim [RFCthis]
-9826 tool [RFCthis]
-9842 finger [RFCthis]
-9900 turn [RFCthis]
-9901 num [RFCthis]
-9903 svn [RFCthis]
-9904 ut2004 [RFCthis]
-9932 ms-visio [RFCthis]
-10008 eid [RFCthis]
-10100 wss [RFCthis]
-10103 gizmoproject [RFCthis]
-10172 dlna-playsingle [RFCthis]
-10224 swh [RFCthis]
-10337 dat [RFCthis]
-10348 cap [RFCthis]
-10355 z39.50r [RFCthis]
-10412 xcon [RFCthis]
-10430 gitoid [RFCthis]
-10524 hydrazone [RFCthis]
-10565 example [RFCthis]
-10699 crid [RFCthis]
-10717 teamspeak [RFCthis]
-10743 elsi [RFCthis]
-10769 dtmi [RFCthis]
-10840 ftp [RFCthis]
-10902 ms-drive-to [RFCthis]
-10903 upt [RFCthis]
-10911 appdata [RFCthis]
-11039 callto [RFCthis]
-11131 ms-remotedesktop-launch [RFCthis]
-11139 dweb [RFCthis]
-11264 lastfm [RFCthis]
-11307 xmlrpc.beep [RFCthis]
-11342 ms-whiteboard [RFCthis]
-11465 first-run-pen-experience [RFCthis]
-11473 webcal [RFCthis]
-11553 adt [RFCthis]
-11566 vemmi [RFCthis]
-11590 cvs [RFCthis]
-11629 taler [RFCthis]
-11688 ms-inputapp [RFCthis]
-11864 git [RFCthis]
-11893 irc [RFCthis]
-11936 ms-settings-workplace [RFCthis]
-12171 blob [RFCthis]
-12173 modem [RFCthis]
-12188 msnim [RFCthis]
-12268 iris.lwz [RFCthis]
-12302 ms-sttoverlay [RFCthis]
-12321 lbry [RFCthis]
-12334 rmi [RFCthis]
-12346 ms-restoretabcompanion [RFCthis]
-12482 ms-useractivityset [RFCthis]
-12485 dab [RFCthis]
-12491 about [RFCthis]
-12500 embedded [RFCthis]
-12501 rtmp [RFCthis]
-12526 ircs [RFCthis]
-12558 mid [RFCthis]
-12573 sip [RFCthis]
-12593 ipns [RFCthis]
-12666 dvx [RFCthis]
-12706 android [RFCthis]
-12747 wtai [RFCthis]
-12831 ms-search-repair [RFCthis]
-12838 microsoft.windows.camera.multipicker [RFCthis]
-12857 ms-settings-screenrotation [RFCthis]
-12879 rtspu [RFCthis]
-12914 ms-screenclip [RFCthis]
-12943 aaa [RFCthis]
-12954 xmpp [RFCthis]
-12988 soldat [RFCthis]
-13041 lorawan [RFCthis]
-13054 beshare [RFCthis]
-13077 sips [RFCthis]
-13081 iris.xpc [RFCthis]
-13113 simpleledger [RFCthis]
-13127 vsls [RFCthis]
-13207 matrix [RFCthis]
-13307 otpauth [RFCthis]
-13336 cid [RFCthis]
-13352 service [RFCthis]
-13417 h323 [RFCthis]
-13438 ms-settings-connectabledevices [RFCthis]
-13452 payto [RFCthis]
-13463 ms-settings-displays-topology [RFCthis]
-13505 lvlt [RFCthis]
-13596 ms-walk-to [RFCthis]
-13672 dns [RFCthis]
-13730 quic-transport [RFCthis]
-13762 paparazzi [RFCthis]
-13766 ms-people [RFCthis]
-13889 xri [RFCthis]
-13894 onenote-cmd [RFCthis]
-13934 dav [RFCthis]
-14003 content-type [RFCthis]
-14068 sms [RFCthis]
-14119 ms-publisher [RFCthis]
-14197 xfire [RFCthis]
-14250 secondlife [RFCthis]
-14260 ark [RFCthis]
-14301 iax [RFCthis]
-14312 msrp [RFCthis]
-14475 swid [RFCthis]
-14590 tn3270 [RFCthis]
-14596 ms-appinstaller [RFCthis]
-14627 stuns [RFCthis]
-14688 dpp [RFCthis]
-14701 ms-secondary-screen-controller [RFCthis]
-14764 browserext [RFCthis]
-14820 chrome [RFCthis]
-14878 pkcs11 [RFCthis]
-15066 dlna-playcontainer [RFCthis]
-15155 spiffe [RFCthis]
-15207 uuid-in-package [RFCthis]
-15261 ms-settings-proximity [RFCthis]
-15356 things [RFCthis]
-15377 ms-gamebarservices [RFCthis]
-15379 shc [RFCthis]
-15547 ipp [RFCthis]
-15552 mailto [RFCthis]
-15558 ms-browser-extension [RFCthis]
-15838 shttp (OBSOLETE) [RFCthis]
-15842 acct [RFCthis]
-15849 w3 [RFCthis]
-15869 wais [RFCthis]
-15928 qb [RFCthis]
-15947 ms-search [RFCthis]
-16043 ms-settings-airplanemode [RFCthis]
-16045 jar [RFCthis]
-16069 tel [RFCthis]
-16074 dntp [RFCthis]
-16160 chrome-extension [RFCthis]
-16193 cast [RFCthis]
-16326 view-source [RFCthis]
-16356 im [RFCthis]
-16358 resource [RFCthis]
-16378 ms-calculator [RFCthis]
-16380 news [RFCthis]
-16415 wcr [RFCthis]
-16523 casts [RFCthis]
-16689 ms-access [RFCthis]
-16723 grd [RFCthis]
-16750 rsync [RFCthis]
-16773 lpa [RFCthis]
-16850 afs [RFCthis]
-16874 bb [RFCthis]
-16884 ham [RFCthis]
-16926 info [RFCthis]
-16972 ms-meetnow [RFCthis]
-17117 ms-project [RFCthis]
-17172 ethereum [RFCthis]
-17225 thismessage [RFCthis]
-17226 vnc [RFCthis]
-17232 snews [RFCthis]
-17245 sieve [RFCthis]
-17269 feedready [RFCthis]
-17271 mt [RFCthis]
-17288 ws [RFCthis]
-17338 ms-transit-to [RFCthis]
-17346 ventrilo [RFCthis]
-17357 iris [RFCthis]
The assignments from this table can be extracted from the XML form of this document (when stored in a file "this.xml") into CSV form using this short Ruby program:
The Small Print This appendix lists a few corner cases of URI semantics that implementers of CRIs need to be aware of, but that are not representative of the normal operation of CRIs.
  1. Initial (Lone/Leading) Empty Path Segments:
  • Lone empty path segments: As per , s://x is distinct from s://x/ -- i.e., a URI with an empty path ([] in CRI) is different from one with a lone empty path segment ([""]). However, in HTTP and CoAP, they are implicitly aliased (for CoAP, in item 8 of ). As per item 7 of , recomposition of a URI without Uri-Path Options from the other URI-related CoAP Options produces s://x/, not s://x -- CoAP prefers the lone empty path segment form. Similarly, after discussing HTTP semantics, states:
In general, a URI that uses the generic syntax for authority with an empty path should be normalized to a path of "/".
  • Leading empty path segments without authority: Somewhat related, note also that URIs and URI references that do not carry an authority cannot represent initial empty path segments (i.e., that are followed by further path segments): s://x//foo works, but in a s://foo URI or an (absolute-path) URI reference of the form //foo the double slash would be mis-parsed as leading in to an authority.
  1. Constraints () of CRIs/basic CRIs While most URIs in everyday use can be converted to CRIs and back to URIs matching the input after syntax-based normalization of the URI, these URIs illustrate the constraints by example:
    • https://host%ffname, https://example.com/x?data=%ff All URI components must, after percent decoding, be valid UTF-8 encoded text. Bytes that are not valid UTF-8 show up, for example, in BitTorrent web seeds.
    • https://example.com/component%3bone;component%3btwo, http://example.com/component%3dequals While delimiters can be used in an escaped and unescaped form in URIs with generally distinct meanings, basic CRIs (i.e., without percent-encoded text ) only support one escapable delimiter character per component, which is the delimiter by which the component is split up in the CRI. Note that the separators . (for authority parts), / (for paths), & (for query parameters) are special in that they are syntactic delimiters of their respective components in CRIs. Thus, the following examples are convertible to basic CRIs: https://interior%2edot/ https://example.com/path%2fcomponent/second-component https://example.com/x?ampersand=%26&questionmark=?
    • https://alice@example.com/ The user information can be expressed in CRIs if the "userinfo" feature is present. The URI https://@example.com is represented as [-4, [false, "", "example", "com"]]; the false serves as a marker that the next element is the userinfo. The rules do not cater for unencoded ":" in userinfo, which is commonly considered a deprecated inclusion of a literal password.
Change Log Changes from -08 to -09
  • Identify more esoteric features with a CDDL ".feature".
  • Clarify that well-formedness requires removing trailing nulls.
  • Fragments can contain PET.
  • Percent-encoded text in PET is treated as byte strings.
  • URIs with an authority but a completely empty path (e.g., http://example.com): CRIs with an authority component no longer always produce at least a slash in the path component. For generic schemes, the conversion of scheme://example.com to a CRI is now possible because CRI produces a URI with an authority not followed by a slash following the updated rules of . Schemes like http and coap do not distinguish between the empty path and the path containing a single slash when an authority is set (as recommended in ). For these schemes, that equivalence allows implementations to convert the just-a-slash URI to a CRI with a zero length path array (which, however, when converted back, does not produce a slash after the authority). (Add an appendix "the small print" for more detailed discussion of pesky corner cases like this.)
Changes from -07 to -08
  • Fix the encoding of NOAUTH-NOSLASH / NOAUTH-LEADINGSLASH
  • Add URN and DID schemes, add example.
  • Add PET
  • Remove hopeless attempt to encode "remote trailing nulls" rule in CDDL (which is not a transformation language).
Changes from -06 to -07
  • More explicitly discuss constraints (), add examples ().
  • Make CDDL more explicit about special simple values.
  • Lots of gratuitous changes from XML2RFC redefinition of <tt> semantics.
Changes from -05 to -06
  • rework authority:
    • split reg-names at dots;
    • add optional zone identifiers to IP addresses
Changes from -04 to -05
  • Simplify CBOR structure.
  • Add implementation status section.
Changes from -03 to -04:
  • Minor editorial improvements.
  • Renamed path.type/path-type to discard.
  • Renamed option to section, substructured into items.
  • Simplified the table "resolution-variables".
  • Use the CBOR structure inspired by Jim Schaad's proposals.
Changes from -02 to -03:
  • Expanded the set of supported schemes (#3).
  • Specified creation, normalization and comparison (#9).
  • Clarified the default value of the path.type option (#33).
  • Removed the append-relation path.type option (#41).
  • Renumbered the remaining path.types.
  • Renumbered the option numbers.
  • Restructured the document.
  • Minor editorial improvements.
Changes from -01 to -02:
  • Changed the syntax of schemes to exclude upper case characters (#13).
  • Minor editorial improvements (#34 #37).
Changes from -00 to -01:
  • None.
Acknowledgements CRIs were developed by for use in the Constrained RESTful Application Language (CoRAL). The current author team is completing this work with a view to achieve good integration with the potential use cases, both inside and outside of CoRAL. Thanks to , , , , and for helpful comments and discussions that have shaped the document.
Contributors Ericsson
Torshamnsgatan 23 Stockholm 16483 Sweden klaus.hartke@ericsson.com
Hollandstr. 12/4 Vienna 1020 Austria christian@amsuess.com