fix: move ics23 to correct folder (cosmos#13549)

(cherry picked from commit d118681)

go.mod

@@ -126,7 +126,7 @@ replace (
 	github.com/99designs/keyring => github.com/cosmos/keyring v1.1.7-0.20210622111912-ef00f8ac3d76
 
 	// vendor ics23
-	github.com/confio/ics23/go => ./ics23
+	github.com/confio/ics23/go => ./ics23/go
 
 	// Fix upstream GHSA-h395-qcrw-5vmq vulnerability.
 	// TODO Remove it: https://github.com/cosmos/cosmos-sdk/issues/10409

ics23/ics23.go → ics23/go/ics23.go

@@ -1,20 +1,21 @@
-/**
+/*
+*
 This implements the client side functions as specified in
 https://github.com/cosmos/ics/tree/master/spec/ics-023-vector-commitments
 
 In particular:
 
-  // Assumes ExistenceProof
-  type verifyMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key, value: Value) => boolean
+	// Assumes ExistenceProof
+	type verifyMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key, value: Value) => boolean
 
-  // Assumes NonExistenceProof
-  type verifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key) => boolean
+	// Assumes NonExistenceProof
+	type verifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, key: Key) => boolean
 
-  // Assumes BatchProof - required ExistenceProofs may be a subset of all items proven
-  type batchVerifyMembership = (root: CommitmentRoot, proof: CommitmentProof, items: Map<Key, Value>) => boolean
+	// Assumes BatchProof - required ExistenceProofs may be a subset of all items proven
+	type batchVerifyMembership = (root: CommitmentRoot, proof: CommitmentProof, items: Map<Key, Value>) => boolean
 
-  // Assumes BatchProof - required NonExistenceProofs may be a subset of all items proven
-  type batchVerifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, keys: Set<Key>) => boolean
+	// Assumes BatchProof - required NonExistenceProofs may be a subset of all items proven
+	type batchVerifyNonMembership = (root: CommitmentRoot, proof: CommitmentProof, keys: Set<Key>) => boolean
 
 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

ics23/ops.go → ics23/go/ops.go

@@ -207,7 +207,8 @@ type opType interface {
 }
 
 // doLengthOp will calculate the proper prefix and return it prepended
-//   doLengthOp(op, data) -> length(data) || data
+//
+//	doLengthOp(op, data) -> length(data) || data
 func doLengthOp(lengthOp LengthOp, data []byte) ([]byte, error) {
 	switch lengthOp {
 	case LengthOp_NO_PREFIX:

ics23/proof.go → ics23/go/proof.go

@@ -287,10 +287,10 @@ func IsRightMost(spec *InnerSpec, path []*InnerOp) bool {
 
 // IsLeftNeighbor returns true if `right` is the next possible path right of `left`
 //
-//   Find the common suffix from the Left.Path and Right.Path and remove it. We have LPath and RPath now, which must be neighbors.
-//   Validate that LPath[len-1] is the left neighbor of RPath[len-1]
-//   For step in LPath[0..len-1], validate step is right-most node
-//   For step in RPath[0..len-1], validate step is left-most node
+//	Find the common suffix from the Left.Path and Right.Path and remove it. We have LPath and RPath now, which must be neighbors.
+//	Validate that LPath[len-1] is the left neighbor of RPath[len-1]
+//	For step in LPath[0..len-1], validate step is right-most node
+//	For step in RPath[0..len-1], validate step is left-most node
 func IsLeftNeighbor(spec *InnerSpec, left []*InnerOp, right []*InnerOp) bool {
 	// count common tail (from end, near root)
 	left, topleft := left[:len(left)-1], left[len(left)-1]