Implementing dm-verity

In this document


dm-verity protection lives in the kernel. So if rooting software compromises the system before the kernel comes up, it will retain that access. To mitigate this risk, most manufacturers verify the kernel using a key burned into the device. That key is not changeable once the device leaves the factory.

Manufacturers use that key to verify the signature on the first-level bootloader, which in turn verifies the signature on subsequent levels, the application bootloader and eventually the kernel. Each manufacturer wishing to take advantage of verified boot should have a method for verifying the integrity of the kernel. Assuming the kernel has been verified, the kernel can look at a block device and verify it as it is mounted.

One way of verifying a block device is to directly hash its contents and compare them to a stored value. However, attempting to verify an entire block device can take an extended period and consume much of a device's power. Devices would take long periods to boot and then be significantly drained prior to use.

Instead, dm-verity verifies blocks individually and only when each one is accessed. When read into memory, the block is hashed in parallel. The hash is then verified up the tree. And since reading the block is such an expensive operation, the latency introduced by this block-level verification is comparatively nominal.

If verification fails, the device generates an I/O error indicating the block cannot be read. It will appear as if the filesystem has been corrupted, as is expected.

Applications may choose to proceed without the resulting data, such as when those results are not required to the application's primary function. However, if the application cannot continue without the data, it will fail.



  1. Generate an ext4 system image.
  2. Generate a hash tree for that image.
  3. Build a dm-verity table for that hash tree.
  4. Sign that dm-verity table to produce a table signature.
  5. Bundle the table signature and dm-verity table into verity metadata.
  6. Concatenate the system image, the verity metadata, and the hash tree.

See the The Chromium Projects - Verified Boot for a detailed description of the hash tree and dm-verity table.

Generating the hash tree

As described in the Introduction, the hash tree is integral to dm-verity. The cryptsetup tool will generate a hash tree for you. Alternatively, a compatible one is defined here:

<your block device name> <your block device name> <block size> <block size> <image size in blocks> <image size in blocks + 8> <root hash> <salt>

To form the hash, the system image is split at layer 0 into 4k blocks, each assigned a SHA256 hash. Layer 1 is formed by joining only those SHA256 hashes into 4k blocks, resulting in a much smaller image. Layer 2 is formed identically, with the SHA256 hashes of Layer 1.

This is done until the SHA256 hashes of the previous layer can fit in a single block. When get the SHA256 of that block, you have the root hash of the tree.

The size of the hash tree (and corresponding disk space usage) varies with the size of the verified partition. In practice, the size of hash trees tends to be small, often less than 30 MB.

If you have a block in a layer that isn't completely filled naturally by the hashes of the previous layer, you should pad it with zeroes to achieve the expected 4k. This allows you to know the hash tree hasn't been removed and is instead completed with blank data.

To generate the hash tree, concatenate the layer 2 hashes onto those for layer 1, the layer 3 the hashes onto those of layer 2, and so on. Write all of this out to disk. Note that this doesn't reference layer 0 of the root hash.

To recap, the general algorithm to construct the hash tree is as follows:

  1. Choose a random salt (hexadecimal encoding).
  2. Unsparse your system image into 4k blocks.
  3. For each block, get its (salted) SHA256 hash.
  4. Concatenate these hashes to form a level
  5. Pad the level with 0s to a 4k block boundary.
  6. Concatenate the level to your hash tree.
  7. Repeat steps 2-6 using the previous level as the source for the next until you have only a single hash.

The result of this is a single hash, which is your root hash. This and your salt are used during the construction of your dm-verity mapping table.

Building the dm-verity mapping table

Build the dm-verity mapping table, which identifies the block device (or target) for the kernel and the location of the hash tree (which is the same value.) This mapping is used for fstab generation and booting. The table also identifies the size of the blocks and the hash_start, or the offset in hash size blocks (length of layer 0).

See cryptsetup for a detailed description of the verity target mapping table fields.

Signing the dm-verity table

Sign the dm-verity table to produce a table signature. When verifying a partition, the table signature is validated first. This is done against a key on your boot image in a fixed location. Keys are typically included in the manufacturers' build systems for automatic inclusion on devices in a fixed location.

To verify the partition with this signature and key combination:

  1. Add an RSA-2048 key in libmincrypt-compatible format to the /boot partition at /verity_key. Identify the location of the key used to verify the hash tree.
  2. In the fstab for the relevant entry, add 'verify' to the fs_mgr flags.

Bundling the table signature into metadata

Bundle the table signature and dm-verity table into verity metadata. The entire block of metadata is versioned so it may be extended, such as to add a second kind of signature or change some ordering.

As a sanity check, a magic number is associated with each set of table metadata that helps identify the table. Since the length is included in the ext4 system image header, this provides a way to search for the metadata without knowing the contents of the data itself.

This makes sure you haven't elected to verify an unverified partition. If so, the absence of this magic number will halt the verification process. This number resembles:

The byte values in hex are:

  • first byte = b0
  • second byte = 01
  • third byte = b0
  • fourth byte = 01

The following diagram depicts the breakdown of the verity metadata:

<magic number>|<version>|<signature>|<table length>|<table>|<padding>
\----------------------------------------------------------/   |
                            |                                  |
                            |                                 32K
                       block content

And this table describes those metadata fields.

Table 1. Verity metadata fields

Field Purpose Size Value
magic number used by fs_mgr as a sanity check 4 bytes 0xb001b001
version used to version the metadata block 4 bytes currently 0
signature the signature of the table in PKCS1.5 padded form 256 bytes
table length the length of the dm-verity table in bytes 4 bytes
table the dm-verity table described earlier `table length` bytes
padding this structure is 0-padded to 32k in length 0

Optimizing dm-verity

To get the best performance out of dm-verity, you should:

  • In the kernel, turn on NEON SHA-2 for ARMv7 and the SHA-2 extensions for ARMv8.
  • Experiment with different read-ahead and prefetch_cluster settings to find the best configuration for your device.