From 6fc131433ca2626216a03176b20dd3d64318eebe Mon Sep 17 00:00:00 2001 From: Hsiao-Wei Wang Date: Mon, 7 Jan 2019 00:54:40 -0600 Subject: [PATCH] Update specs/simple-serialize.md Co-Authored-By: wemeetagain --- specs/simple-serialize.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/specs/simple-serialize.md b/specs/simple-serialize.md index 93a3597eb..84044318d 100644 --- a/specs/simple-serialize.md +++ b/specs/simple-serialize.md @@ -392,7 +392,7 @@ return typ(**values), item_index The below `hash_tree_root` algorithm is defined recursively in the case of lists and containers, and it outputs a value equal to or less than 32 bytes in size. For the final output only (ie. not intermediate outputs), if the output is less than 32 bytes, right-zero-pad it to 32 bytes. The goal is collision resistance *within* each type, not between types. -Refer to the helper function [hash](https://github.com/ethereum/eth2.0-specs/blob/master/specs/core/0_beacon-chain.md#hash) of Phase 0 of the [Eth2.0 specs](https://github.com/ethereum/eth2.0-specs) for a definition of the hash function used below, `hash(x)`. +Refer to [the helper function `hash`](https://github.com/ethereum/eth2.0-specs/blob/master/specs/core/0_beacon-chain.md#hash) of Phase 0 of the [Eth2.0 specs](https://github.com/ethereum/eth2.0-specs) for a definition of the hash function used below, `hash(x)`. #### `uint8`..`uint256`, `bool`, `address`, `hash1`..`hash32`