go fmt

Author: ethanfrey

go/main.go

@@ -18,7 +18,7 @@ In particular:
 
 We make an adjustment to accept a Spec to ensure the provided proof is in the format of the expected merkle store.
 This can avoid an range of attacks on fake preimages, as we need to be careful on how to map key, value -> leaf
-and determine neighbors 
+and determine neighbors
 */
 package proofs
 
@@ -39,10 +39,10 @@ func VerifyMembership(spec *ProofSpec, root CommitmentRoot, proof *CommitmentPro
 }
 
 // VerifyNonMembership returns true iff
-// proof is (contains) a NonExistenceProof 
+// proof is (contains) a NonExistenceProof
 // both left and right sub-proofs are valid existence proofs (see above) or nil
 // left and right proofs are neighbors (or left/right most if one is nil)
-// provided key is between the keys of the two proofs 
+// provided key is between the keys of the two proofs
 func VerifyNonMembership(spec *ProofSpec, root CommitmentRoot, proof CommitmentProof, key []byte) bool {
 	// TODO: handle batch
 	np, ok := proof.Proof.(*CommitmentProof_Nonexist)
@@ -51,4 +51,4 @@ func VerifyNonMembership(spec *ProofSpec, root CommitmentRoot, proof CommitmentP
 	}
 	err := np.Nonexist.Verify(spec, root, key)
 	return err == nil
-}
+}

go/ops.go

@@ -10,7 +10,7 @@ import (
 
 	// adds ripemd160 capability to crypto.RIPEMD160
 	_ "golang.org/x/crypto/ripemd160"
-	
+
 	"github.com/pkg/errors"
 )
 
@@ -36,7 +36,7 @@ func (op *LeafOp) Apply(key []byte, value []byte) ([]byte, error) {
 }
 
 // CheckAgainstSpec will verify the LeafOp is in the format defined in spec
-func (op *LeafOp)CheckAgainstSpec(spec *ProofSpec) error {
+func (op *LeafOp) CheckAgainstSpec(spec *ProofSpec) error {
 	lspec := spec.LeafSpec
 
 	if op.Hash != lspec.Hash {
@@ -68,15 +68,14 @@ func (op *InnerOp) Apply(child []byte) ([]byte, error) {
 }
 
 // CheckAgainstSpec will verify the InnerOp is in the format defined in spec
-func (op *InnerOp)CheckAgainstSpec(spec *ProofSpec) error {
+func (op *InnerOp) CheckAgainstSpec(spec *ProofSpec) error {
 	leafPrefix := spec.LeafSpec.Prefix
 	if bytes.HasPrefix(op.Prefix, leafPrefix) {
 		return errors.Errorf("Inner Prefix starts with %X", leafPrefix)
 	}
 	return nil
 }
 
-
 func prepareLeafData(hashOp HashOp, lengthOp LengthOp, data []byte) ([]byte, error) {
 	// TODO: lengthop before or after hash ???
 	hdata, err := doHashOrNoop(hashOp, data)

go/proof.go

@@ -97,7 +97,7 @@ func (p *ExistenceProof) CheckAgainstSpec(spec *ProofSpec) error {
 // and matches the spec.
 func (p *NonExistenceProof) Verify(spec *ProofSpec, root CommitmentRoot, key []byte) error {
 	// ensure the existence proofs are valid
-	var leftKey, rightKey []byte 
+	var leftKey, rightKey []byte
 	if p.Left != nil {
 		if err := p.Left.Verify(spec, root, p.Left.Key, p.Left.Value); err != nil {
 			return errors.Wrap(err, "left proof")