How to generate globally unique, resolvable and persistent identifiers

Recipe metadata



Difficulty level

Reading Time

30 minutes

Recipe Type

Background Information

Executable Code


Intended Audience

Principal Investigators

Data Managers

Data Scientists

The FAIR principles, under the Findability and the Accessibility chapters respectively, state that:

F1. (Meta)data are assigned a globally unique and persistent identifier

A1. (Meta)data are retrievable by their identifier using a standardised communications protocol

Main Objectives

The main goals of this recipe are therefore:

To understand the purpose of a globally unique and persistent identifier and how they can be used to retrieve the associated (meta)data using a standardized communication protocol. To provide explanations on how to generate globaly unique identifiers, explain what IRI are and how they can be generated, retrieved and resolved.

From these principles, it is necessary to explain three key processes, which are:

  1. Identifier minting

    Identifier minting is fundamentally about the authority deciding identity.

    • the tax office
    • the HR department
    • the company registry
    • the EMBL-EBI
  2. URI construction

URI construction is fundamentally about scoping the authority.

> for example, should the web address be:
    > http://organization/people/1123 
    > or
    > http://organization/commercial/people/1123

  1. URI Resolution:

URI resolution is fundamentally about directing requests to the relevant identified entity

The standard approach would be resolving a `HTTP GET` request using content negotiation to choose between different representations of the resource.

All these key points will be developed in this recipe.

graph TD Process2[Identifier Minting]:::bix --> A1(authority decide identity):::box Process2 --> Process3 Process3[URI construction]:::bix --> A2(scoping the authority):::box Process3 --> Process4 Process4[URI resolution]:::bix --> A3(directing requests to the relevant identified entity):::box classDef bix font-family:avenir,font-size:14px,fill:#7e0038,stroke:#222,color:#fff,stroke-width:1px classDef box font-family:avenir,font-size:14px,fill:#2a9fc9,stroke:#222,color:#fff,stroke-width:1px

Capability & Maturity Table

Capability Initial Maturity Level Final Maturity Level
Findability minimal repeatable
Accessibility minimal repeatable
Identifier minting repeatable
URI construction repeatable
Identifier resolution repeatable
content negotiation repeatable

Table of Data Standards

Data Formats Terminologies Models

Minting identifiers

:notebook_with_decorative_cover: "Identifier minting is fundamentally about the authority deciding identity."

Identifiers are used to tag, identify, find and retrieve entities which are part of a collection or a resource maintained by some organization. This organization is the authority which rules over that area of knowledge. The core assumption is that identifiers must be unique, that is they can not be shared and there is a 1 to 1 relation between the 'identifier' and the entity it identifies.

With isolated systems, disconnected from any other system, the risk of identifier collision is null but two isolated systems can create local identifiers which could be completely identical but which denote completely different entities. In fact, this happens all the time.

So these identifiers are said to be locally unique, as there is no guarantee these are unique to all other systems that exist, in other words, that they are globally unique.

How to produce globally unique identifiers?

There are 2 ways to produce non-resolvable, globally unique identifiers:

UUID based identifiers

With this approach, the notion of universally unique is a probabilistic one. The probability to find a duplicate within 103 trillion version-4 UUIDs is one in a billion. The likelihood of collision (generation of the exact same identifier) is extremely small but not null. Therefore, with an ever increasing number of digital resources to index, collisions should not be ruled out. According to the RFC4122 specifications, a UUID is an identifier that is unique across both space and time, with respect to the space of all UUIDs. Since a UUID is a fixed size and contains a time field, it is possible for values to rollover (around A.D. 3400, depending on the specific algorithm used). A UUID can be used for multiple purposes, from tagging objects with an extremely short lifetime, to reliably identifying very persistent objects across a network.

:information_source: Key Fact about UUID:

  • no centralized authority is required to administer them
  • content independent, entirely disconnected from the identify they can be associated with for identification purpose
  • generation on demand can be completely automated
  • non resolvable
  • completely semantic free (opaque) identifier

Generation in Python

The following code snippet shows the generation of a UUID using the Python uuid package.

import uuid
id = uuid.uuid4() 


Hash based identifiers

This approach uses 2 inputs:

  • a cryptographic hashing algorithm implemented as a software function
  • a digital resource (e.g. a file)

Indeed, the approach generates an identifier by using all or some of the content of the digital resource as input to the cryptographic hashing function to compute a unique string, which is therefore a signature (or fingerprint) of the the digital resource. A number of algorithms can be used and some are already widely used such as Message Digest algorithm MD5 specified by the RFC1321[1], the Secure Hash Algorithm (SHA1), Secure Hash Algorithm 2 (SHA256), Secure Hash Algorithm 3 (SHA3) or BLAKE2b-256 (RFC 7693). The first two are considered obsolete, while the latter two are most advanced and approved by NIST.

:information_source: Key fact about hash identifiers: It is not possible to reconstruct the original data from these hash strings. These are only fingerprints, which can therefore only be used to do the following tasks:

  • message authentication
  • digital signature
  • public key encryption

Generation in Python

The following code snippet shows the generation of a hash for a string using the Python hashlib package:

import hashlib

# encode it to bytes using UTF-8 encoding
message = "creating globally unique identifiers for FAIR data".encode()

# hash with MD5 (not recommended)
print("MD5:", hashlib.md5(message).hexdigest())

# hash with SHA-2 (SHA-256 bits & SHA-512 bits long)
print("SHA-256:", hashlib.sha256(message).hexdigest())
print("SHA-512:", hashlib.sha512(message).hexdigest())

# hash with SHA-3
print("SHA-3-256:", hashlib.sha3_256(message).hexdigest())
print("SHA-3-512:", hashlib.sha3_512(message).hexdigest())

# hash with BLAKE2 (256-bits BLAKE2s & 512-bits BLAKE2c)
print("BLAKE2s:", hashlib.blake2s(message).hexdigest())
print("BLAKE2b:", hashlib.blake2b(message).hexdigest())

Generation of hashes using curl

The following snippet shows how a b2sum hash can be generated using curl

curl | b2sum --length 256 --binary


In our context, the use of the hashing function is to generate a unique key which may be used to generate a URL. This simply indicates a technical option for generating opaque URL, not that it is necessarily the most widespread approach.

Understanding Uniform Resource Locators (URLs)

:notebook_with_decorative_cover: URI construction is fundamentally about scoping the authority.

Having covered the technical details to generated globally unique identifiers, it is now necessary to discuss the issue making identifiers resolvable (a notion also known as dereferencable).

In other words, in order to create globally unique identifiers for the web, it is necessary to understand what Uniform Resource Locators (a.k.a URL) are and how to construct them for use with the Hypertext Transfer Protocol.

This results in URLs of the following form

          userinfo       host      port
          ┌──┴───┐ ┌──────┴──────┐ ┌┴┐
  └─┬─┘   └───────────┬──────────────┘└───────┬───────┘ └───────────┬─────────────┘ └┬┘
  scheme          authority                  path                 query           fragment


The structure of URL, according to the World Wide Web Consortium (W3C) specification, is as follows:

URI = scheme:[//authority]path[?query][#fragment]


In this structure, the scheme defines the protocol or application to use to obtain the resource. The list of official scheme is maintained by the Internet Assigned Numbers Authority and the following link ( holds the most up to date version.

The most relevant URI scheme in the context of FAIR data and Linked Open Data are http and https which denote the Hypertext Transfer Protocol and the Hypertext Tranfer Protocol Secure.


Besides setting the scheme, the other essential fragment of a URI is the authority, which according to the Internet Engineering Task Force (IETF) specifications, presents the following characteristics:

authority = [userinfo@]host[:port]

Note how the required part is the host, with userinfo and port information being optional and should be avoided in identifiers for data.


In the authority, the notion of host corresponds to the Internet Protocol (IP) address of a server hosting a resource. Often, the IP address corresponding to the host is given a host name such as The host name should be a Qualified Domain Name at minima, or a Fully Qualified Domain Name (FQDN) ideally and registered with the Domain Name Service (DNS) which allows the resolution (lookup) between the ip address and the hostname.

:information_source: it is often the case the authority is reduced to the host , which is then referred to as a 'namespace' or 'domain name' in an abuse of language. host is in fact further specified by 3 element

  • top-level domain , com in the web address
  • second-level domain, example in the web address
    • hostname subdomain,www in the web address

:information_source: subdomain can be defined in the Domain Name Service and belong to the main domain. Technically, to add a subdomain pointing to the domain name, one needs to create/add a CNAME to the DNS for a registered domain name


The path defines the directory on the host where the resource is located and consists of a sequence of zeor or more path segements separated by a /.


The query is an optional part of the URL syntax that starts with a ?. Typically the query component consists of a service of key-value pairs separated by an & deliminator.

In the context resolvable identiers, query components should be avoided.


The fragement is an optional part of the URL syntax that starts with a #. It identifies a component within the returned resource and is used for client side processing, e.g. to scroll to a particular section within a webpage.

Generating Resolvable URLs

In the context of FAIR data, resources on the web must have unique, persistent, and resolvable identifiers. In order to achieve the capability of persistence, it is necessary for the resource identifiers to comply to the RFC 3986 IETF standard for URIs (and IRIs, which are URI extended to cope with unicode). This means that it must comprise the following components:

  1. scheme: https
  2. an authority:
  3. optionally a path: /dataset-name/
  4. a local identifier (such as database accession number, such as P12133 from uniprot) or a globally unique identifier (such as a UUID or hash code).

In a virtual example which uses a UUID for the local identifier and does not use a path, it looks like this

Taking a real life example, to make the UniProt accession number globally unique, one needs to provide the context in which the accession number is unique. This can be done by converting it into an International Resource Identifier (IRI – commonly referred to as a URL) by appending the local identifier onto a namesapce.

:information_source: You should only use a namespace over which you have ownership (the authority), otherwise you cannot guarantee that the minted IRI will be globally unique; the organization or person who owns the namespace may already, or at some point in the future, use the IRI that you created for some other purpose.

In the case of UniProt, the resource has provided IRIs for each page about a protein as well as separate IRIs for the protein itself; this is because the page is not the concept of the protein by a document that describes properties of the protein. This separation of identities is achieved by using different namespaces for the different types of resource.

Once such URIs are available, one may also turn them into compact identifiers called CURIEs. This will be discussed further in the next section.

Identifier Resolution - Enabling persistence through indirection

This relates to this other FAIR principle mentioned in the introduction.

A1. (Meta)data are retrievable by their identifier using a standardised communications protocol.

:notebook_with_decorative_cover: URI resolution is fundamentally about directing requests to the relevant identified entity.
The standard approach would be resolving a HTTP GET request using content negotiation to choose between different representations of the resource.

A PURL is a persistent URL, meaning that it provides a ++permanent address to access a resource on the web++.

To understand the notion of PURL, one needs to first get familiar with the notion of url indirection (also known as url redirect or url forwarding ), which refers to the practice of providing a stable, fixed web address/url, but setting it up so that it points to another content, which may be periodically modified.

When a user retrieves a PURL, they will be redirected to the current location of the resource. When an author needs to move a page, they can update the PURL to point to the new location.

The practice of indirection comes handy as it ensures invariant url address for resources which are known to change, owing to version changes for instance or owing to change in ownership,

We can see this practice in action with the reliance on url for identifying OBO Foundry resources. For instance, the following url is a redirect to the latest release of the file, which is

PURLs with a common prefix are grouped together into domains. Each domain has a single maintainer who can add new PURLs to the domain and make changes to existing PURLs within the domain.

FAIR Principle A1 states that:

(meta)data should be retrievable by its identifier.

When the identifier is not a resolvable URL, then Identifier Resolution Services are required that know how to map an IRI to a location for the data.

Introducing CURIES or Compact URIs

CURIEs (short for compact URIs) are defined by a World Wide Web Consortium Working Group Note CURIE Syntax 1.0, and provide a human readable shortening of IRIs.

The CURIE consists of a namespace prefix followed by the local identifier.

There are some widely used and defined CURIEs such as DOIs and ISBN numbers. For example the DOI [doi:10.1038/sdata.2016.18] refers to the FAIR Principles paper1. The Digital Object Identifier System web site ( provides a resolution service for DOIs. The service is available as a web form on the site or can be used by appending a DOI to the website.The client will be redirected to the URL where the resource about the concept is located, e.g. for the FAIR Data Principles paper we can use the URL to resolve the paper's DOI. This results in the client being taken to the page at

Namespaces can be defined by convention, such as the case with doi, and registered with services to allow for the resolution of CURIEs (see Identifier Resolution Services below). These are extensively used to map CURIEs to URLs that can be resolved.

Going back to our Life Science context, we can use the following CURIE [uniprot:P38398] to refer to the UniProt record for the protein.

This is very useful for including unambiguous, global identifiers in scientific articles.

Identifier Resolution services


    The PURL system is a service of the Internet Archive, which provides an interface to administer domain. For more information about the service, visit

  • w3ids

    Permanent Identifiers for the Web. Secure, permanent URLs for your Web application that will stand the test of time.

    • authority registration service
    • resolution service
    • redirection service:

    Send a request to add a redirect to the mailing list. Make sure to include the URL that you want on, the URL that you want to redirect to, and the HTTP code that you want to use when redirecting. An administrator will then create the redirect for you.

  • is a Resolution Service provides consistent access to life science data using Compact Uniform Resource Identifiers, hosted by the EBI provides a resolution service, both as a web form and through the URL pattern. Compact Identifiers consist of an assigned, unique prefix and a local provider designated accession number (prefix:accession). The resolving location of Compact Identifiers is determined using information that is stored in the Registry. Datasets can register their namespace prefix together with their identifier pattern. The service can then be used in the same way as the DOI resolution service. So for the UniProt page about BRCA1, we can resolve the CURIE [uniprot:P38938] using This means that the URL resolves to the UniProt page

  • Name2Things

    Name2Things (N2T) is a Resolution Service, maintained at the California Digital Library (CDL) within the University of California (UC) Office of the President. CDL supports electronic library services for ten UC campuses and affiliated law schools, medical centers, and national laboratories, as well as hundreds of museums, herbaria, botanical gardens, etc. Similar to URL shorteners like, N2T serves content indirectly. N2T can store more than one "target" (forwarding link) for an identifier, as well as any kind or amount of metadata (descriptive information) is also a "meta-resolver". In collaboration with, it recognizes over 600 well-known identifier types and knows where their respective servers are. Failing to find forwarding information for a specific individual identifier, it uses the identifier's type to look for an overall target rule.

For more details, see the Identifier Resolution Services recipe.


In this recipe, we have given an overview of globally unique and persistent identifier, i.e. FAIR principle F1. We have covered:

  • The difference between global and local identifiers;
  • How to convert a local identifier into a global one;
  • Opaque and transparent identifiers

We have given an overview of the different services available for handling identifiers.

But we can not conclude this section on persistent identifiers without stressing how central they are to the production of Linked Data or Linked Open Data, which rely on 3 W3C standards: URI, RDF and HTTP.

What should I read next?


  1. IRI.
  2. CURIE.
  3. URL.
  4. RDF concepts.
  5. MD5 specifications.
  6. Blake2 specifications.
  7. Cool URIs don't change.
  8. Leo Sauermann and Richard Cyganiak (eds.) (2008 December 3). Cool URIs for the Semantic Web, W3C Semantic Web Education and Outreach Interest Group Note,
  11. Identifiers for the 21st century: How to design, provision, and reuse persistent identifiers to maximize utility and impact of life science data.
  12. Nick Juty, Sarala M Wimalaratne, Stian Soiland-Reyes, John Kunze, Carole A Goble, and Tim Clark. 2020. Unique, persistent, resolvable: Identifiers as the foundation of FAIR. Data Intelligence (2020), 30–39.
  13. Nick Juty, Nicolas Le Novere, and Camille Laibe. 2012. and MIRIAM Registry: Community resources to provide persistent identification. Nucleic Acids Research 40, D1 (2012), D580–D586.
  14. Rachana Ananthakrishnan, Kyle Chard, Mike D'Arcy, Ian T Foster, Carl F Kesselman , Brendan McCollam , Jim Christopher Pruyne , Philippe Rocca-Serra, Robert E Schuler, Rick P Wagner. An Open Ecosystem for Pervasive Use of Persistent Identifiers.


Name Affiliation orcid CrediT role specific contribution
Alasdair Gray Heriot-Watt University / ELIXIR-UK 0000-0002-5711-4872 Writing - Original Draft Original format
Converting to online format
Chris Evelo Maastricht University 0000-0002-5301-3142 Writing - Original Draft Original format
Egon Willighagen Maastricht University 0000-0001-7542-0286 Writing - Original Draft Original format
Philippe Rocca-Serra University of Oxford 0000-0001-9853-5668 Writing – Review & Editing, Conceptualization Markdown
Andrea Splendiani Novartis AG 0000-0002-3201-9617 Conceptualization


This page is released under the Creative Commons 4.0 BY license.

  1. The CURIES are included in square brackets to make them safe CURIEs, meaning that they should not be confused for URIs.