Flake produces 128-bit, k-ordered ids (read time-ordered lexically). Run one on each node in your infrastructure and they will generate conflict-free ids on-demand without coordination.
Read the original post on the Boundary blog.
To get started
git clone git://github.com/boundary/flake.git
Then edit rel/files/sys.config to fit your environment.
- interface - set to an available network interface from which to pull a 48-bit mac address as the worker id.
- timestamp_path - set to a location where flake can periodically save the current time. If flake detects on startup that this file contains timestamps in the future or the distant past, it will refuse to startup. This is to prevent problematic ids from being distributed.
- allowable_downtime - an added safeguard to prevent flake from starting up if it sees it hasn't run in a long period of time according to the system clock since this might be an indication that the clock has been skewed far into the future.
Example configuration:
[
{flake, [
{interface, "en0"},
{timestamp_path, "/srv/flake/timestamp-dets"},
{allowable_downtime, 2592000000}
]}
]Then simply run the server inline
./start.sh
And use the embedded test harness to ensure that you are able to generate ids.
Generate 1 id and receive the erlang binary (flake@localhost)1> flake_harness:generate(1).
[<<0,0,1,52,212,33,45,67,16,154,221,94,14,143,0,0>>]
Generate 10 base-62 encoded ids
(flake@localhost)2> flake_harness:generate(10,62).
["8HFaR8qWtRlGDHnO57","8HFaR8qWtRlGDHnO56",
"8HFaR8qWtRlGDHnO55","8HFaR8qWtRlGDHnO54",
"8HFaR8qWtRlGDHnO53","8HFaR8qWtRlGDHnO52",
"8HFaR8qAulTgCBd6Wp","8HFaR8qAulTgCBd6Wo",
"8HFaR8qAulTgCBd6Wn","8HFaR8qAulTgCBd6Wm"]
Time how long it takes to generate 100,000 ids
(flake@localhost)3> flake_harness:timed_generate(100000).
src/flake_harness.erl:33: generating ids: 0.402 s
These last steps simple ensure that a flake application is up and running. Next we'll talk more about operational use.
Flake is a standalone application. Request ids with a gen_server:call from another Erlang VM (or application that speaks Erlang distribution a la Scalang).
Example usage from your application.
flake() ->
Node = {flake, flake@localhost},
{ok, FlakeId} = gen_server:call(Node, get),
{ok, FlakeIdBase62} = gen_server:call(Node, {get,62}),
%% example id decomposition for demonstration only
<<_Time:64/integer,_WorkerId:48/integer,_Sequence:16/integer>> = FlakeId,
FlakeId.Flake ids are 128-bits wide described here from most significant to least significant bits.
- 64-bit timestamp - milliseconds since the epoch (Jan 1 1970)
- 48-bit worker id - MAC address from a configurable device
- 16-bit sequence # - usually 0, incremented when more than one id is requested in the same millisecond and reset to 0 when the clock ticks forward
- Bulk id generation
- HTTP interface
- Client library (Erlang, possibly others)
- Provide an abstraction for the messaging format to avoid using gen_server calls as the public API.
- Will generate a notional flake id (with an empty worker id) given a timestamp. This is useful for generating a lexical range of values that could have been generated in a span of time. At Boundary we store data in Riak keyed by flake ids and use keyfilters to page out blocks of data using this technique.
What if I'm not using Erlang?
An HTTP interface is on the roadmap. For applications written in Scala, Scalang is an option.
How does this differ from snowflake developed at Twitter?
The differences stem primarily from the fact that Twitter snowflake ids are 64-bits wide. This means that additional coordination is required to pick a worker id (twitter does this via a ZooKeeper ensemble). Their scheme works great when your ids must fit into 64-bits. However this comes at the cost of additional coordination among nodes and a system that is generally a little more difficult to reason about. It is a fine system though and we were able to learn from it in our efforts.
How is flake different from rearranging the bits of a UUID-1 id?
First, successive UUID versions aim to make ids increasingly opaque in nature through various means. We have actually found a great deal of utility in structurally transparent unique ids and that has motivated much of this work. The most transparent variant is UUID-1 (for which it has received a fair bit of criticism) and thus the nearest relative to a flake id. There are some important differences though.
UUID-1 is an odd beast. First, the timestamp is based on the number of 100 nanosecond intervals since October 15, 1582. This is not how most of us familiar with Unix timestamps reason about time. If that isn't bad enough, the timestamp is an odd 60-bits in length with the most significant bits shifted to the least significant bits of the UUID. This property makes lexical ordering essentially meaningless. The remaining bits contain a clock id (initially set to a random number) and a node id (usually the MAC address).
The first problem is the timestamp. We could rearrange the bits to get some k-ordering love, but reasoning on timestamps of this nature makes reasoning about the resulting ids more complex than it needs to be. This is why flake uses a standard 64-bit Unix timestamp, unaltered, as the most significant bits.
The next problem is clock skew and protection against replaying ids for a time in the past. The UUID-1 spec dictates that the clock id be incremented in such an event, but this behavior is implementation-specific and we aren't aware of any Erlang implementations that met our safety goals. Flake durably writes a timestamp to a dets table periodically while running. Following a restart, flake will refuse to startup if the timestamp written there is from the future. Furthermore, flake will refuse to generate ids if it detects that the system clock is running backwards.
When are flake ids not appropriate?
Flake ids are predictable by design. Don't use use flake to generate ids that you'd rather be unpredictable. Don't use flake to generate passwords, security tokens, or anything else you wouldn't want someone to be able to guess.
Flake ids expose the identity of the machine which generated the id (by way of its MAC address) and the time at which it did so. This could be a problem for some security-sensitive applications.
Don't do modulo 2 arithmetic on flake ids with the expectation of random distribution. The least significant 16-bits are usually going to be 0 on a machine that is generating an average of one or fewer ids per millisecond.