[]byte) (n int, err error) { // If we're still absorbing, pad and apply the permutation. if d.state == spongeAbsorbing { d.padAndPermute() } n = len(out) // Now, do the squeezing. for len(out) > 0 { // Apply the permutation if we've squeezed the sponge dry. if d.n == d.rate { d.permute() } x := copy(out, d.a[d.n:d.rate]) d.n += x out = out[x:] } return } // Sum appends the current hash to b and returns the resulting slice. // It does not change the underlying hash state. func (d *Digest) Sum(b []byte)...