How to efficiently hash (SHA 256) in golang data where only the last few bytes changes

Assuming you had 80 bytes of data and only the last 4 bytes was constantly changing, how would you efficiently hash the total 80 bytes using Go. In essence, the first 76 bytes are the same, while the last 4 bytes keeps changing. Ideally, you want to keep a copy of the hash digest for the first 76 bytes and just keep changing the last 4.

You can try the following examples on the Go Playground. Benchmark results is at the end.

Note: the implementations below are not safe for concurrent use; I intentionally made them like this to be simpler and faster.

Fastest when using only public API (always hashes all input)

The general concept and interface of Go's hash algorithms is the hash.Hash interface. This does not allow you to save the state of the hasher and to return or rewind to the saved state. So using the public hash APIs of the Go standard lib, you always have to calculate the hash from start.

What the public API offers is to reuse an already constructed hasher to calculate the hash of a new input, using the Hash.Reset() method. This is nice so that no (memory) allocations will be needed to calculate multiple hash values. Also you may take advantage of the optional slice that may be passed to Hash.Sum() which is used to append the current hash to. This is nice so that no allocations will be needed to receive the hash results either.

Here's an example that takes advantage of these:

type Cached1 struct {
	hasher hash.Hash
	result [sha256.Size]byte
}

func NewCached1() *Cached1 {
	return &Cached1{hasher: sha256.New()}
}

func (c *Cached1) Sum(data []byte) []byte {
	c.hasher.Reset()
	c.hasher.Write(data)
	return c.hasher.Sum(c.result[:0])
}

Test data

We'll use the following test data:

var fixed = bytes.Repeat([]byte{1}, 76)
var variantA = []byte{1, 1, 1, 1}
var variantB = []byte{2, 2, 2, 2}

var data = append(append([]byte{}, fixed...), variantA...)
var data2 = append(append([]byte{}, fixed...), variantB...)

var c1 = NewCached1()

First let's get authentic results (to verify if our hasher works correctly):

fmt.Printf("%x\n", sha256.Sum256(data))
fmt.Printf("%x\n", sha256.Sum256(data2))

Output:

fb8e69bdfa2ad15be7cc8a346b74e773d059f96cfc92da89e631895422fe966a
10ef52823dad5d1212e8ac83b54c001bfb9a03dc0c7c3c83246fb988aa788c0c

Now let's check our Cached1 hasher:

fmt.Printf("%x\n", c1.Sum(data))
fmt.Printf("%x\n", c1.Sum(data2))

Output is the same:

fb8e69bdfa2ad15be7cc8a346b74e773d059f96cfc92da89e631895422fe966a
10ef52823dad5d1212e8ac83b54c001bfb9a03dc0c7c3c83246fb988aa788c0c

Even faster but may break (in future Go releases): hashes only the last 4 bytes

Now let's see a less flexible solution which truly calculates the hash of the first 76 fixed part only once.

The hasher of the crypto/sha256 package is the unexported sha256.digest type (more precisely a pointer to this type):

// digest represents the partial evaluation of a checksum.
type digest struct {
    h     [8]uint32
    x     [chunk]byte
    nx    int
    len   uint64
    is224 bool // mark if this digest is SHA-224
}

A value of the digest struct type basically holds the current state of the hasher.

What we may do is feed the hasher the fixed, first 76 bytes, and then save this struct value. When we need to caclulate the hash of some 80 bytes data where the first 76 is the same, we use this saved value as a starting point, and then feed the varying last 4 bytes.

Note that it's enough to simply save this struct value as it contains no pointers and no descriptor types like slices and maps. Else we would also have to make a copy of those, but we're "lucky". So this solution would need adjustment if a future implementation of crypto/sha256 would add a pointer or slice field for example.

Since sha256.digest is unexported, we can only use reflection (reflect package) to achieve our goals, which inherently will add some delays to computation.

Example implementation that does this:

type Cached2 struct {
	origv   reflect.Value
	hasherv reflect.Value
	hasher  hash.Hash

	result [sha256.Size]byte
}

func NewCached2(fixed []byte) *Cached2 {
	h := sha256.New()
	h.Write(fixed)

	c := &Cached2{origv: reflect.ValueOf(h).Elem()}
	hasherv := reflect.New(c.origv.Type())
	c.hasher = hasherv.Interface().(hash.Hash)
	c.hasherv = hasherv.Elem()

	return c
}

func (c *Cached2) Sum(data []byte) []byte {
	// Set state of the fixed hash:
	c.hasherv.Set(c.origv)

	c.hasher.Write(data)
	return c.hasher.Sum(c.result[:0])
}

Testing it:

var c2 = NewCached2(fixed)
fmt.Printf("%x\n", c2.Sum(variantA))
fmt.Printf("%x\n", c2.Sum(variantB))

Output is again the same:

fb8e69bdfa2ad15be7cc8a346b74e773d059f96cfc92da89e631895422fe966a
10ef52823dad5d1212e8ac83b54c001bfb9a03dc0c7c3c83246fb988aa788c0c

So it works.

The "ultimate", fastest solution

Cached2 could be faster if reflection would not be involved. If we want an even faster solution, simply we can make a copy of the sha256.digest type and its methods into our package, so we can directly use it without having to resort to reflection.

If we do this, we will have access to the digest struct value, and we can simply make a copy of it like:

var d digest
// init d
saved := d

And restoring it is like:

d = saved

I simply "cloned" the crypto/sha256 package to my workspace, and changed / exported the digest type as Digest just for demonstration purposes. Then using this mysha256.Digest type I implemented Cached3 like this:

type Cached3 struct {
	orig   mysha256.Digest
	result [sha256.Size]byte
}

func NewCached3(fixed []byte) *Cached3 {
	var d mysha256.Digest
	d.Reset()
	d.Write(fixed)

	return &Cached3{orig: d}
}

func (c *Cached3) Sum(data []byte) []byte {
	// Make a copy of the fixed hash:
	d := c.orig
	d.Write(data)
	return d.Sum(c.result[:0])
}

Testing it:

var c3 = NewCached3(fixed)

fmt.Printf("%x\n", c3.Sum(variantA))
fmt.Printf("%x\n", c3.Sum(variantB))

Output again is the same. So this works too.

Benchmarks

We can benchmark performance with this code:

func BenchmarkCached1(b *testing.B) {
	for i := 0; i < b.N; i++ {
		c1.Sum(data)
		c1.Sum(data2)
	}
}

func BenchmarkCached2(b *testing.B) {
	for i := 0; i < b.N; i++ {
		c2.Sum(variantA)
		c2.Sum(variantB)
	}
}

func BenchmarkCached3(b *testing.B) {
	for i := 0; i < b.N; i++ {
		c3.Sum(variantA)
		c3.Sum(variantB)
	}
}

Benchmark results (go test -bench . -benchmem):

BenchmarkCached1-4   1000000     1569 ns/op     0 B/op    0 allocs/op
BenchmarkCached2-4   2000000      926 ns/op     0 B/op    0 allocs/op
BenchmarkCached3-4   2000000      872 ns/op     0 B/op    0 allocs/op

Cached2 is approximately 41% faster than Cached1 which is quite noticable and nice. Cached3 only gives a "little" performance boost compared to Cached2, another 6%. Cached3 is 44% faster than Cached1.

Also note that none of the solutions use any allocations which is also nice.

Conclusion

For that extra 40% or 44%, I would probably not go for the Cached2 or Cached3 solutions. Of course it really depends on how important the performance is to you. If it is important, I think the Cached2 solution presents a fine compromise between minimum added complexity and the noticeable performance gain. It does pose a threat as future Go implementations may break it; if it is a problem, Cached3 solves this by copying the current implementation (and also improves its performance a little).