@agoric/cosmic-proto 0.5.0-u19.2 → 0.5.0-u20.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/address-hooks.d.ts +4 -3
- package/dist/address-hooks.js +1 -217
- package/dist/address-hooks.js.map +1 -1
- package/dist/codegen/agoric/bundle.js +1 -51
- package/dist/codegen/agoric/lien/genesis.js +1 -143
- package/dist/codegen/agoric/lien/lien.js +1 -87
- package/dist/codegen/agoric/swingset/genesis.js +1 -181
- package/dist/codegen/agoric/swingset/msgs.js +1 -700
- package/dist/codegen/agoric/swingset/query.js +1 -356
- package/dist/codegen/agoric/swingset/swingset.js +1 -816
- package/dist/codegen/agoric/vbank/genesis.js +1 -82
- package/dist/codegen/agoric/vbank/msgs.js +1 -2
- package/dist/codegen/agoric/vbank/query.js +1 -222
- package/dist/codegen/agoric/vbank/vbank.js +1 -237
- package/dist/codegen/agoric/vibc/msgs.js +1 -127
- package/dist/codegen/agoric/vlocalchain/vlocalchain.js +1 -307
- package/dist/codegen/agoric/vstorage/genesis.js +1 -138
- package/dist/codegen/agoric/vstorage/query.js +1 -441
- package/dist/codegen/agoric/vstorage/vstorage.js +1 -128
- package/dist/codegen/agoric/vtransfer/genesis.js +1 -70
- package/dist/codegen/amino/amino.js +1 -2
- package/dist/codegen/amino/bundle.js +1 -6
- package/dist/codegen/binary.js +1 -367
- package/dist/codegen/circle/bundle.d.ts +0 -506
- package/dist/codegen/circle/bundle.js +1 -40
- package/dist/codegen/circle/cctp/v1/attester.js +1 -63
- package/dist/codegen/circle/cctp/v1/burn_message.js +1 -117
- package/dist/codegen/circle/cctp/v1/burning_and_minting_paused.js +1 -63
- package/dist/codegen/circle/cctp/v1/events.js +1 -1612
- package/dist/codegen/circle/cctp/v1/genesis.js +1 -295
- package/dist/codegen/circle/cctp/v1/max_message_body_size.js +1 -69
- package/dist/codegen/circle/cctp/v1/message.js +1 -160
- package/dist/codegen/circle/cctp/v1/nonce.js +1 -80
- package/dist/codegen/circle/cctp/v1/per_message_burn_limit.js +1 -73
- package/dist/codegen/circle/cctp/v1/query.js +1 -2421
- package/dist/codegen/circle/cctp/v1/remote_token_messenger.js +1 -77
- package/dist/codegen/circle/cctp/v1/sending_and_receiving_messages_paused.js +1 -63
- package/dist/codegen/circle/cctp/v1/signature_threshold.js +1 -63
- package/dist/codegen/circle/cctp/v1/token_pair.js +1 -91
- package/dist/codegen/circle/cctp/v1/tx.d.ts +0 -998
- package/dist/codegen/circle/cctp/v1/tx.js +1 -3264
- package/dist/codegen/circle/cctp/v1/tx.js.map +1 -1
- package/dist/codegen/cosmos/auth/v1beta1/auth.js +1 -337
- package/dist/codegen/cosmos/auth/v1beta1/genesis.js +1 -86
- package/dist/codegen/cosmos/auth/v1beta1/query.js +1 -1113
- package/dist/codegen/cosmos/authz/v1beta1/authz.js +1 -334
- package/dist/codegen/cosmos/authz/v1beta1/event.js +1 -161
- package/dist/codegen/cosmos/authz/v1beta1/genesis.js +1 -71
- package/dist/codegen/cosmos/authz/v1beta1/query.js +1 -506
- package/dist/codegen/cosmos/authz/v1beta1/tx.js +1 -415
- package/dist/codegen/cosmos/bank/v1beta1/authz.js +1 -71
- package/dist/codegen/cosmos/bank/v1beta1/bank.js +1 -592
- package/dist/codegen/cosmos/bank/v1beta1/genesis.js +1 -196
- package/dist/codegen/cosmos/bank/v1beta1/query.js +1 -1347
- package/dist/codegen/cosmos/bank/v1beta1/tx.js +1 -267
- package/dist/codegen/cosmos/base/abci/v1beta1/abci.js +1 -1012
- package/dist/codegen/cosmos/base/node/v1beta1/query.js +1 -112
- package/dist/codegen/cosmos/base/query/v1beta1/pagination.js +1 -189
- package/dist/codegen/cosmos/base/reflection/v2alpha1/reflection.js +1 -1755
- package/dist/codegen/cosmos/base/v1beta1/coin.js +1 -257
- package/dist/codegen/cosmos/bundle.js +1 -249
- package/dist/codegen/cosmos/crypto/ed25519/keys.js +1 -123
- package/dist/codegen/cosmos/crypto/hd/v1/hd.js +1 -109
- package/dist/codegen/cosmos/crypto/keyring/v1/record.js +1 -367
- package/dist/codegen/cosmos/crypto/multisig/keys.js +1 -82
- package/dist/codegen/cosmos/crypto/multisig/v1beta1/multisig.js +1 -144
- package/dist/codegen/cosmos/crypto/secp256k1/keys.js +1 -123
- package/dist/codegen/cosmos/crypto/secp256r1/keys.js +1 -125
- package/dist/codegen/cosmos/distribution/v1beta1/distribution.js +1 -978
- package/dist/codegen/cosmos/distribution/v1beta1/genesis.js +1 -837
- package/dist/codegen/cosmos/distribution/v1beta1/query.js +1 -1207
- package/dist/codegen/cosmos/distribution/v1beta1/tx.js +1 -512
- package/dist/codegen/cosmos/feegrant/v1beta1/feegrant.js +1 -412
- package/dist/codegen/cosmos/feegrant/v1beta1/genesis.js +1 -71
- package/dist/codegen/cosmos/feegrant/v1beta1/query.js +1 -461
- package/dist/codegen/cosmos/feegrant/v1beta1/tx.js +1 -267
- package/dist/codegen/cosmos/gov/v1/genesis.js +1 -177
- package/dist/codegen/cosmos/gov/v1/gov.js +1 -928
- package/dist/codegen/cosmos/gov/v1/query.js +1 -1216
- package/dist/codegen/cosmos/gov/v1/tx.js +1 -730
- package/dist/codegen/cosmos/gov/v1beta1/genesis.js +1 -177
- package/dist/codegen/cosmos/gov/v1beta1/gov.js +1 -1003
- package/dist/codegen/cosmos/gov/v1beta1/query.js +1 -1216
- package/dist/codegen/cosmos/gov/v1beta1/tx.js +1 -578
- package/dist/codegen/cosmos/group/v1/events.js +1 -696
- package/dist/codegen/cosmos/group/v1/genesis.js +1 -190
- package/dist/codegen/cosmos/group/v1/query.js +1 -2096
- package/dist/codegen/cosmos/group/v1/tx.js +1 -2073
- package/dist/codegen/cosmos/group/v1/types.js +1 -1387
- package/dist/codegen/cosmos/mint/v1beta1/genesis.js +1 -82
- package/dist/codegen/cosmos/mint/v1beta1/mint.js +1 -211
- package/dist/codegen/cosmos/mint/v1beta1/query.js +1 -330
- package/dist/codegen/cosmos/msg/v1/msg.js +1 -2
- package/dist/codegen/cosmos/params/v1beta1/params.js +1 -171
- package/dist/codegen/cosmos/params/v1beta1/query.js +1 -327
- package/dist/codegen/cosmos/staking/v1beta1/authz.js +1 -240
- package/dist/codegen/cosmos/staking/v1beta1/genesis.js +1 -256
- package/dist/codegen/cosmos/staking/v1beta1/query.js +1 -2069
- package/dist/codegen/cosmos/staking/v1beta1/staking.js +1 -1915
- package/dist/codegen/cosmos/staking/v1beta1/tx.js +1 -968
- package/dist/codegen/cosmos/tx/signing/v1beta1/signing.js +1 -516
- package/dist/codegen/cosmos/tx/v1beta1/service.js +1 -975
- package/dist/codegen/cosmos/tx/v1beta1/tx.js +1 -1256
- package/dist/codegen/cosmos/upgrade/v1beta1/query.js +1 -592
- package/dist/codegen/cosmos/upgrade/v1beta1/tx.js +1 -228
- package/dist/codegen/cosmos/upgrade/v1beta1/upgrade.js +1 -352
- package/dist/codegen/cosmos/vesting/v1beta1/tx.js +1 -865
- package/dist/codegen/cosmos/vesting/v1beta1/vesting.js +1 -674
- package/dist/codegen/cosmos_proto/bundle.js +1 -6
- package/dist/codegen/cosmos_proto/cosmos.js +1 -208
- package/dist/codegen/gogoproto/bundle.js +1 -6
- package/dist/codegen/gogoproto/gogo.js +1 -2
- package/dist/codegen/google/api/annotations.js +1 -2
- package/dist/codegen/google/api/http.js +1 -319
- package/dist/codegen/google/bundle.js +1 -17
- package/dist/codegen/google/protobuf/any.js +1 -77
- package/dist/codegen/google/protobuf/descriptor.js +1 -3421
- package/dist/codegen/google/protobuf/duration.js +1 -79
- package/dist/codegen/google/protobuf/empty.js +1 -50
- package/dist/codegen/google/protobuf/timestamp.js +1 -79
- package/dist/codegen/helpers.js +1 -196
- package/dist/codegen/ibc/applications/interchain_accounts/controller/v1/controller.js +1 -66
- package/dist/codegen/ibc/applications/interchain_accounts/controller/v1/query.js +1 -243
- package/dist/codegen/ibc/applications/interchain_accounts/controller/v1/tx.js +1 -314
- package/dist/codegen/ibc/applications/interchain_accounts/genesis/v1/genesis.js +1 -503
- package/dist/codegen/ibc/applications/interchain_accounts/host/v1/host.js +1 -83
- package/dist/codegen/ibc/applications/interchain_accounts/host/v1/query.js +1 -114
- package/dist/codegen/ibc/applications/interchain_accounts/v1/account.js +1 -86
- package/dist/codegen/ibc/applications/interchain_accounts/v1/metadata.js +1 -119
- package/dist/codegen/ibc/applications/interchain_accounts/v1/packet.js +1 -190
- package/dist/codegen/ibc/applications/transfer/v1/authz.js +1 -178
- package/dist/codegen/ibc/applications/transfer/v1/genesis.js +1 -96
- package/dist/codegen/ibc/applications/transfer/v1/query.js +1 -634
- package/dist/codegen/ibc/applications/transfer/v1/transfer.js +1 -147
- package/dist/codegen/ibc/applications/transfer/v1/tx.js +1 -220
- package/dist/codegen/ibc/applications/transfer/v2/packet.js +1 -103
- package/dist/codegen/ibc/bundle.js +1 -142
- package/dist/codegen/ibc/core/channel/v1/channel.js +1 -845
- package/dist/codegen/ibc/core/channel/v1/genesis.js +1 -281
- package/dist/codegen/ibc/core/channel/v1/query.js +1 -2344
- package/dist/codegen/ibc/core/channel/v1/tx.js +1 -1745
- package/dist/codegen/ibc/core/client/v1/client.js +1 -583
- package/dist/codegen/ibc/core/client/v1/genesis.js +1 -301
- package/dist/codegen/ibc/core/client/v1/query.js +1 -1283
- package/dist/codegen/ibc/core/client/v1/tx.js +1 -587
- package/dist/codegen/ibc/core/commitment/v1/commitment.js +1 -259
- package/dist/codegen/ibc/core/connection/v1/connection.js +1 -678
- package/dist/codegen/ibc/core/connection/v1/genesis.js +1 -122
- package/dist/codegen/ibc/core/connection/v1/query.js +1 -952
- package/dist/codegen/ibc/core/connection/v1/tx.js +1 -843
- package/dist/codegen/ibc/lightclients/localhost/v1/localhost.js +1 -78
- package/dist/codegen/ibc/lightclients/solomachine/v1/solomachine.js +1 -1520
- package/dist/codegen/ibc/lightclients/solomachine/v2/solomachine.js +1 -1514
- package/dist/codegen/ibc/lightclients/tendermint/v1/tendermint.js +1 -628
- package/dist/codegen/icq/bundle.js +1 -17
- package/dist/codegen/icq/v1/genesis.js +1 -78
- package/dist/codegen/icq/v1/icq.js +1 -83
- package/dist/codegen/icq/v1/packet.js +1 -270
- package/dist/codegen/icq/v1/query.js +1 -114
- package/dist/codegen/icq/v1/tx.js +1 -124
- package/dist/codegen/ics23/bundle.js +1 -6
- package/dist/codegen/index.js +1 -23
- package/dist/codegen/json-safe.js +1 -8
- package/dist/codegen/proofs.js +1 -1436
- package/dist/codegen/stride/bundle.js +1 -71
- package/dist/codegen/stride/epochs/genesis.js +1 -227
- package/dist/codegen/stride/epochs/query.js +1 -398
- package/dist/codegen/stride/records/callbacks.js +1 -136
- package/dist/codegen/stride/records/genesis.js +1 -186
- package/dist/codegen/stride/records/params.js +1 -50
- package/dist/codegen/stride/records/query.js +1 -1552
- package/dist/codegen/stride/records/records.js +1 -939
- package/dist/codegen/stride/stakedym/genesis.js +1 -312
- package/dist/codegen/stride/stakedym/query.js +1 -887
- package/dist/codegen/stride/stakedym/stakedym.js +1 -909
- package/dist/codegen/stride/stakedym/tx.js +1 -1661
- package/dist/codegen/stride/stakeibc/address_unbonding.js +1 -135
- package/dist/codegen/stride/stakeibc/callbacks.js +1 -1191
- package/dist/codegen/stride/stakeibc/epoch_tracker.js +1 -115
- package/dist/codegen/stride/stakeibc/genesis.js +1 -135
- package/dist/codegen/stride/stakeibc/gov.js +1 -212
- package/dist/codegen/stride/stakeibc/host_zone.js +1 -544
- package/dist/codegen/stride/stakeibc/ica_account.js +1 -165
- package/dist/codegen/stride/stakeibc/packet.js +1 -113
- package/dist/codegen/stride/stakeibc/params.js +1 -317
- package/dist/codegen/stride/stakeibc/query.js +1 -1372
- package/dist/codegen/stride/stakeibc/trade_route.js +1 -377
- package/dist/codegen/stride/stakeibc/tx.js +1 -3392
- package/dist/codegen/stride/stakeibc/validator.js +1 -170
- package/dist/codegen/stride/staketia/genesis.js +1 -312
- package/dist/codegen/stride/staketia/query.js +1 -887
- package/dist/codegen/stride/staketia/staketia.js +1 -819
- package/dist/codegen/stride/staketia/tx.js +1 -1671
- package/dist/codegen/tendermint/abci/types.d.ts +264 -692
- package/dist/codegen/tendermint/abci/types.js +1 -4434
- package/dist/codegen/tendermint/abci/types.js.map +1 -1
- package/dist/codegen/tendermint/bundle.d.ts +0 -272
- package/dist/codegen/tendermint/bundle.js +1 -42
- package/dist/codegen/tendermint/crypto/keys.js +1 -85
- package/dist/codegen/tendermint/crypto/proof.js +1 -409
- package/dist/codegen/tendermint/libs/bits/types.js +1 -94
- package/dist/codegen/tendermint/p2p/types.js +1 -506
- package/dist/codegen/tendermint/types/block.js +1 -119
- package/dist/codegen/tendermint/types/evidence.js +1 -415
- package/dist/codegen/tendermint/types/params.js +1 -529
- package/dist/codegen/tendermint/types/types.js +1 -1534
- package/dist/codegen/tendermint/types/validator.js +1 -299
- package/dist/codegen/tendermint/version/types.js +1 -155
- package/dist/codegen/utf8.js +1 -138
- package/dist/codegen/varint.js +1 -409
- package/dist/helpers.js +1 -22
- package/dist/index.js +1 -6
- package/package.json +12 -10
package/dist/codegen/proofs.js
CHANGED
|
@@ -1,1436 +1 @@
|
|
|
1
|
-
//@ts-nocheck
|
|
2
|
-
import { BinaryReader, BinaryWriter } from './binary.js';
|
|
3
|
-
import { isSet, bytesFromBase64, base64FromBytes } from './helpers.js';
|
|
4
|
-
import {} from './json-safe.js';
|
|
5
|
-
export var HashOp;
|
|
6
|
-
(function (HashOp) {
|
|
7
|
-
/** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
|
|
8
|
-
HashOp[HashOp["NO_HASH"] = 0] = "NO_HASH";
|
|
9
|
-
HashOp[HashOp["SHA256"] = 1] = "SHA256";
|
|
10
|
-
HashOp[HashOp["SHA512"] = 2] = "SHA512";
|
|
11
|
-
HashOp[HashOp["KECCAK"] = 3] = "KECCAK";
|
|
12
|
-
HashOp[HashOp["RIPEMD160"] = 4] = "RIPEMD160";
|
|
13
|
-
/** BITCOIN - ripemd160(sha256(x)) */
|
|
14
|
-
HashOp[HashOp["BITCOIN"] = 5] = "BITCOIN";
|
|
15
|
-
HashOp[HashOp["SHA512_256"] = 6] = "SHA512_256";
|
|
16
|
-
HashOp[HashOp["UNRECOGNIZED"] = -1] = "UNRECOGNIZED";
|
|
17
|
-
})(HashOp || (HashOp = {}));
|
|
18
|
-
export const HashOpSDKType = HashOp;
|
|
19
|
-
export function hashOpFromJSON(object) {
|
|
20
|
-
switch (object) {
|
|
21
|
-
case 0:
|
|
22
|
-
case 'NO_HASH':
|
|
23
|
-
return HashOp.NO_HASH;
|
|
24
|
-
case 1:
|
|
25
|
-
case 'SHA256':
|
|
26
|
-
return HashOp.SHA256;
|
|
27
|
-
case 2:
|
|
28
|
-
case 'SHA512':
|
|
29
|
-
return HashOp.SHA512;
|
|
30
|
-
case 3:
|
|
31
|
-
case 'KECCAK':
|
|
32
|
-
return HashOp.KECCAK;
|
|
33
|
-
case 4:
|
|
34
|
-
case 'RIPEMD160':
|
|
35
|
-
return HashOp.RIPEMD160;
|
|
36
|
-
case 5:
|
|
37
|
-
case 'BITCOIN':
|
|
38
|
-
return HashOp.BITCOIN;
|
|
39
|
-
case 6:
|
|
40
|
-
case 'SHA512_256':
|
|
41
|
-
return HashOp.SHA512_256;
|
|
42
|
-
case -1:
|
|
43
|
-
case 'UNRECOGNIZED':
|
|
44
|
-
default:
|
|
45
|
-
return HashOp.UNRECOGNIZED;
|
|
46
|
-
}
|
|
47
|
-
}
|
|
48
|
-
export function hashOpToJSON(object) {
|
|
49
|
-
switch (object) {
|
|
50
|
-
case HashOp.NO_HASH:
|
|
51
|
-
return 'NO_HASH';
|
|
52
|
-
case HashOp.SHA256:
|
|
53
|
-
return 'SHA256';
|
|
54
|
-
case HashOp.SHA512:
|
|
55
|
-
return 'SHA512';
|
|
56
|
-
case HashOp.KECCAK:
|
|
57
|
-
return 'KECCAK';
|
|
58
|
-
case HashOp.RIPEMD160:
|
|
59
|
-
return 'RIPEMD160';
|
|
60
|
-
case HashOp.BITCOIN:
|
|
61
|
-
return 'BITCOIN';
|
|
62
|
-
case HashOp.SHA512_256:
|
|
63
|
-
return 'SHA512_256';
|
|
64
|
-
case HashOp.UNRECOGNIZED:
|
|
65
|
-
default:
|
|
66
|
-
return 'UNRECOGNIZED';
|
|
67
|
-
}
|
|
68
|
-
}
|
|
69
|
-
/**
|
|
70
|
-
* LengthOp defines how to process the key and value of the LeafOp
|
|
71
|
-
* to include length information. After encoding the length with the given
|
|
72
|
-
* algorithm, the length will be prepended to the key and value bytes.
|
|
73
|
-
* (Each one with it's own encoded length)
|
|
74
|
-
*/
|
|
75
|
-
export var LengthOp;
|
|
76
|
-
(function (LengthOp) {
|
|
77
|
-
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
|
78
|
-
LengthOp[LengthOp["NO_PREFIX"] = 0] = "NO_PREFIX";
|
|
79
|
-
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
|
80
|
-
LengthOp[LengthOp["VAR_PROTO"] = 1] = "VAR_PROTO";
|
|
81
|
-
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
|
82
|
-
LengthOp[LengthOp["VAR_RLP"] = 2] = "VAR_RLP";
|
|
83
|
-
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
|
84
|
-
LengthOp[LengthOp["FIXED32_BIG"] = 3] = "FIXED32_BIG";
|
|
85
|
-
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
|
86
|
-
LengthOp[LengthOp["FIXED32_LITTLE"] = 4] = "FIXED32_LITTLE";
|
|
87
|
-
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
|
88
|
-
LengthOp[LengthOp["FIXED64_BIG"] = 5] = "FIXED64_BIG";
|
|
89
|
-
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
|
90
|
-
LengthOp[LengthOp["FIXED64_LITTLE"] = 6] = "FIXED64_LITTLE";
|
|
91
|
-
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
|
92
|
-
LengthOp[LengthOp["REQUIRE_32_BYTES"] = 7] = "REQUIRE_32_BYTES";
|
|
93
|
-
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
|
94
|
-
LengthOp[LengthOp["REQUIRE_64_BYTES"] = 8] = "REQUIRE_64_BYTES";
|
|
95
|
-
LengthOp[LengthOp["UNRECOGNIZED"] = -1] = "UNRECOGNIZED";
|
|
96
|
-
})(LengthOp || (LengthOp = {}));
|
|
97
|
-
export const LengthOpSDKType = LengthOp;
|
|
98
|
-
export function lengthOpFromJSON(object) {
|
|
99
|
-
switch (object) {
|
|
100
|
-
case 0:
|
|
101
|
-
case 'NO_PREFIX':
|
|
102
|
-
return LengthOp.NO_PREFIX;
|
|
103
|
-
case 1:
|
|
104
|
-
case 'VAR_PROTO':
|
|
105
|
-
return LengthOp.VAR_PROTO;
|
|
106
|
-
case 2:
|
|
107
|
-
case 'VAR_RLP':
|
|
108
|
-
return LengthOp.VAR_RLP;
|
|
109
|
-
case 3:
|
|
110
|
-
case 'FIXED32_BIG':
|
|
111
|
-
return LengthOp.FIXED32_BIG;
|
|
112
|
-
case 4:
|
|
113
|
-
case 'FIXED32_LITTLE':
|
|
114
|
-
return LengthOp.FIXED32_LITTLE;
|
|
115
|
-
case 5:
|
|
116
|
-
case 'FIXED64_BIG':
|
|
117
|
-
return LengthOp.FIXED64_BIG;
|
|
118
|
-
case 6:
|
|
119
|
-
case 'FIXED64_LITTLE':
|
|
120
|
-
return LengthOp.FIXED64_LITTLE;
|
|
121
|
-
case 7:
|
|
122
|
-
case 'REQUIRE_32_BYTES':
|
|
123
|
-
return LengthOp.REQUIRE_32_BYTES;
|
|
124
|
-
case 8:
|
|
125
|
-
case 'REQUIRE_64_BYTES':
|
|
126
|
-
return LengthOp.REQUIRE_64_BYTES;
|
|
127
|
-
case -1:
|
|
128
|
-
case 'UNRECOGNIZED':
|
|
129
|
-
default:
|
|
130
|
-
return LengthOp.UNRECOGNIZED;
|
|
131
|
-
}
|
|
132
|
-
}
|
|
133
|
-
export function lengthOpToJSON(object) {
|
|
134
|
-
switch (object) {
|
|
135
|
-
case LengthOp.NO_PREFIX:
|
|
136
|
-
return 'NO_PREFIX';
|
|
137
|
-
case LengthOp.VAR_PROTO:
|
|
138
|
-
return 'VAR_PROTO';
|
|
139
|
-
case LengthOp.VAR_RLP:
|
|
140
|
-
return 'VAR_RLP';
|
|
141
|
-
case LengthOp.FIXED32_BIG:
|
|
142
|
-
return 'FIXED32_BIG';
|
|
143
|
-
case LengthOp.FIXED32_LITTLE:
|
|
144
|
-
return 'FIXED32_LITTLE';
|
|
145
|
-
case LengthOp.FIXED64_BIG:
|
|
146
|
-
return 'FIXED64_BIG';
|
|
147
|
-
case LengthOp.FIXED64_LITTLE:
|
|
148
|
-
return 'FIXED64_LITTLE';
|
|
149
|
-
case LengthOp.REQUIRE_32_BYTES:
|
|
150
|
-
return 'REQUIRE_32_BYTES';
|
|
151
|
-
case LengthOp.REQUIRE_64_BYTES:
|
|
152
|
-
return 'REQUIRE_64_BYTES';
|
|
153
|
-
case LengthOp.UNRECOGNIZED:
|
|
154
|
-
default:
|
|
155
|
-
return 'UNRECOGNIZED';
|
|
156
|
-
}
|
|
157
|
-
}
|
|
158
|
-
function createBaseExistenceProof() {
|
|
159
|
-
return {
|
|
160
|
-
key: new Uint8Array(),
|
|
161
|
-
value: new Uint8Array(),
|
|
162
|
-
leaf: undefined,
|
|
163
|
-
path: [],
|
|
164
|
-
};
|
|
165
|
-
}
|
|
166
|
-
export const ExistenceProof = {
|
|
167
|
-
typeUrl: '/ics23.ExistenceProof',
|
|
168
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
169
|
-
if (message.key.length !== 0) {
|
|
170
|
-
writer.uint32(10).bytes(message.key);
|
|
171
|
-
}
|
|
172
|
-
if (message.value.length !== 0) {
|
|
173
|
-
writer.uint32(18).bytes(message.value);
|
|
174
|
-
}
|
|
175
|
-
if (message.leaf !== undefined) {
|
|
176
|
-
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
|
177
|
-
}
|
|
178
|
-
for (const v of message.path) {
|
|
179
|
-
InnerOp.encode(v, writer.uint32(34).fork()).ldelim();
|
|
180
|
-
}
|
|
181
|
-
return writer;
|
|
182
|
-
},
|
|
183
|
-
decode(input, length) {
|
|
184
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
185
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
186
|
-
const message = createBaseExistenceProof();
|
|
187
|
-
while (reader.pos < end) {
|
|
188
|
-
const tag = reader.uint32();
|
|
189
|
-
switch (tag >>> 3) {
|
|
190
|
-
case 1:
|
|
191
|
-
message.key = reader.bytes();
|
|
192
|
-
break;
|
|
193
|
-
case 2:
|
|
194
|
-
message.value = reader.bytes();
|
|
195
|
-
break;
|
|
196
|
-
case 3:
|
|
197
|
-
message.leaf = LeafOp.decode(reader, reader.uint32());
|
|
198
|
-
break;
|
|
199
|
-
case 4:
|
|
200
|
-
message.path.push(InnerOp.decode(reader, reader.uint32()));
|
|
201
|
-
break;
|
|
202
|
-
default:
|
|
203
|
-
reader.skipType(tag & 7);
|
|
204
|
-
break;
|
|
205
|
-
}
|
|
206
|
-
}
|
|
207
|
-
return message;
|
|
208
|
-
},
|
|
209
|
-
fromJSON(object) {
|
|
210
|
-
return {
|
|
211
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
212
|
-
value: isSet(object.value)
|
|
213
|
-
? bytesFromBase64(object.value)
|
|
214
|
-
: new Uint8Array(),
|
|
215
|
-
leaf: isSet(object.leaf) ? LeafOp.fromJSON(object.leaf) : undefined,
|
|
216
|
-
path: Array.isArray(object?.path)
|
|
217
|
-
? object.path.map((e) => InnerOp.fromJSON(e))
|
|
218
|
-
: [],
|
|
219
|
-
};
|
|
220
|
-
},
|
|
221
|
-
toJSON(message) {
|
|
222
|
-
const obj = {};
|
|
223
|
-
message.key !== undefined &&
|
|
224
|
-
(obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
225
|
-
message.value !== undefined &&
|
|
226
|
-
(obj.value = base64FromBytes(message.value !== undefined ? message.value : new Uint8Array()));
|
|
227
|
-
message.leaf !== undefined &&
|
|
228
|
-
(obj.leaf = message.leaf ? LeafOp.toJSON(message.leaf) : undefined);
|
|
229
|
-
if (message.path) {
|
|
230
|
-
obj.path = message.path.map(e => (e ? InnerOp.toJSON(e) : undefined));
|
|
231
|
-
}
|
|
232
|
-
else {
|
|
233
|
-
obj.path = [];
|
|
234
|
-
}
|
|
235
|
-
return obj;
|
|
236
|
-
},
|
|
237
|
-
fromPartial(object) {
|
|
238
|
-
const message = createBaseExistenceProof();
|
|
239
|
-
message.key = object.key ?? new Uint8Array();
|
|
240
|
-
message.value = object.value ?? new Uint8Array();
|
|
241
|
-
message.leaf =
|
|
242
|
-
object.leaf !== undefined && object.leaf !== null
|
|
243
|
-
? LeafOp.fromPartial(object.leaf)
|
|
244
|
-
: undefined;
|
|
245
|
-
message.path = object.path?.map(e => InnerOp.fromPartial(e)) || [];
|
|
246
|
-
return message;
|
|
247
|
-
},
|
|
248
|
-
fromProtoMsg(message) {
|
|
249
|
-
return ExistenceProof.decode(message.value);
|
|
250
|
-
},
|
|
251
|
-
toProto(message) {
|
|
252
|
-
return ExistenceProof.encode(message).finish();
|
|
253
|
-
},
|
|
254
|
-
toProtoMsg(message) {
|
|
255
|
-
return {
|
|
256
|
-
typeUrl: '/ics23.ExistenceProof',
|
|
257
|
-
value: ExistenceProof.encode(message).finish(),
|
|
258
|
-
};
|
|
259
|
-
},
|
|
260
|
-
};
|
|
261
|
-
function createBaseNonExistenceProof() {
|
|
262
|
-
return {
|
|
263
|
-
key: new Uint8Array(),
|
|
264
|
-
left: undefined,
|
|
265
|
-
right: undefined,
|
|
266
|
-
};
|
|
267
|
-
}
|
|
268
|
-
export const NonExistenceProof = {
|
|
269
|
-
typeUrl: '/ics23.NonExistenceProof',
|
|
270
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
271
|
-
if (message.key.length !== 0) {
|
|
272
|
-
writer.uint32(10).bytes(message.key);
|
|
273
|
-
}
|
|
274
|
-
if (message.left !== undefined) {
|
|
275
|
-
ExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
|
276
|
-
}
|
|
277
|
-
if (message.right !== undefined) {
|
|
278
|
-
ExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
|
279
|
-
}
|
|
280
|
-
return writer;
|
|
281
|
-
},
|
|
282
|
-
decode(input, length) {
|
|
283
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
284
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
285
|
-
const message = createBaseNonExistenceProof();
|
|
286
|
-
while (reader.pos < end) {
|
|
287
|
-
const tag = reader.uint32();
|
|
288
|
-
switch (tag >>> 3) {
|
|
289
|
-
case 1:
|
|
290
|
-
message.key = reader.bytes();
|
|
291
|
-
break;
|
|
292
|
-
case 2:
|
|
293
|
-
message.left = ExistenceProof.decode(reader, reader.uint32());
|
|
294
|
-
break;
|
|
295
|
-
case 3:
|
|
296
|
-
message.right = ExistenceProof.decode(reader, reader.uint32());
|
|
297
|
-
break;
|
|
298
|
-
default:
|
|
299
|
-
reader.skipType(tag & 7);
|
|
300
|
-
break;
|
|
301
|
-
}
|
|
302
|
-
}
|
|
303
|
-
return message;
|
|
304
|
-
},
|
|
305
|
-
fromJSON(object) {
|
|
306
|
-
return {
|
|
307
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
308
|
-
left: isSet(object.left)
|
|
309
|
-
? ExistenceProof.fromJSON(object.left)
|
|
310
|
-
: undefined,
|
|
311
|
-
right: isSet(object.right)
|
|
312
|
-
? ExistenceProof.fromJSON(object.right)
|
|
313
|
-
: undefined,
|
|
314
|
-
};
|
|
315
|
-
},
|
|
316
|
-
toJSON(message) {
|
|
317
|
-
const obj = {};
|
|
318
|
-
message.key !== undefined &&
|
|
319
|
-
(obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
320
|
-
message.left !== undefined &&
|
|
321
|
-
(obj.left = message.left
|
|
322
|
-
? ExistenceProof.toJSON(message.left)
|
|
323
|
-
: undefined);
|
|
324
|
-
message.right !== undefined &&
|
|
325
|
-
(obj.right = message.right
|
|
326
|
-
? ExistenceProof.toJSON(message.right)
|
|
327
|
-
: undefined);
|
|
328
|
-
return obj;
|
|
329
|
-
},
|
|
330
|
-
fromPartial(object) {
|
|
331
|
-
const message = createBaseNonExistenceProof();
|
|
332
|
-
message.key = object.key ?? new Uint8Array();
|
|
333
|
-
message.left =
|
|
334
|
-
object.left !== undefined && object.left !== null
|
|
335
|
-
? ExistenceProof.fromPartial(object.left)
|
|
336
|
-
: undefined;
|
|
337
|
-
message.right =
|
|
338
|
-
object.right !== undefined && object.right !== null
|
|
339
|
-
? ExistenceProof.fromPartial(object.right)
|
|
340
|
-
: undefined;
|
|
341
|
-
return message;
|
|
342
|
-
},
|
|
343
|
-
fromProtoMsg(message) {
|
|
344
|
-
return NonExistenceProof.decode(message.value);
|
|
345
|
-
},
|
|
346
|
-
toProto(message) {
|
|
347
|
-
return NonExistenceProof.encode(message).finish();
|
|
348
|
-
},
|
|
349
|
-
toProtoMsg(message) {
|
|
350
|
-
return {
|
|
351
|
-
typeUrl: '/ics23.NonExistenceProof',
|
|
352
|
-
value: NonExistenceProof.encode(message).finish(),
|
|
353
|
-
};
|
|
354
|
-
},
|
|
355
|
-
};
|
|
356
|
-
function createBaseCommitmentProof() {
|
|
357
|
-
return {
|
|
358
|
-
exist: undefined,
|
|
359
|
-
nonexist: undefined,
|
|
360
|
-
batch: undefined,
|
|
361
|
-
compressed: undefined,
|
|
362
|
-
};
|
|
363
|
-
}
|
|
364
|
-
export const CommitmentProof = {
|
|
365
|
-
typeUrl: '/ics23.CommitmentProof',
|
|
366
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
367
|
-
if (message.exist !== undefined) {
|
|
368
|
-
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
369
|
-
}
|
|
370
|
-
if (message.nonexist !== undefined) {
|
|
371
|
-
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
372
|
-
}
|
|
373
|
-
if (message.batch !== undefined) {
|
|
374
|
-
BatchProof.encode(message.batch, writer.uint32(26).fork()).ldelim();
|
|
375
|
-
}
|
|
376
|
-
if (message.compressed !== undefined) {
|
|
377
|
-
CompressedBatchProof.encode(message.compressed, writer.uint32(34).fork()).ldelim();
|
|
378
|
-
}
|
|
379
|
-
return writer;
|
|
380
|
-
},
|
|
381
|
-
decode(input, length) {
|
|
382
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
383
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
384
|
-
const message = createBaseCommitmentProof();
|
|
385
|
-
while (reader.pos < end) {
|
|
386
|
-
const tag = reader.uint32();
|
|
387
|
-
switch (tag >>> 3) {
|
|
388
|
-
case 1:
|
|
389
|
-
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
|
390
|
-
break;
|
|
391
|
-
case 2:
|
|
392
|
-
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
|
393
|
-
break;
|
|
394
|
-
case 3:
|
|
395
|
-
message.batch = BatchProof.decode(reader, reader.uint32());
|
|
396
|
-
break;
|
|
397
|
-
case 4:
|
|
398
|
-
message.compressed = CompressedBatchProof.decode(reader, reader.uint32());
|
|
399
|
-
break;
|
|
400
|
-
default:
|
|
401
|
-
reader.skipType(tag & 7);
|
|
402
|
-
break;
|
|
403
|
-
}
|
|
404
|
-
}
|
|
405
|
-
return message;
|
|
406
|
-
},
|
|
407
|
-
fromJSON(object) {
|
|
408
|
-
return {
|
|
409
|
-
exist: isSet(object.exist)
|
|
410
|
-
? ExistenceProof.fromJSON(object.exist)
|
|
411
|
-
: undefined,
|
|
412
|
-
nonexist: isSet(object.nonexist)
|
|
413
|
-
? NonExistenceProof.fromJSON(object.nonexist)
|
|
414
|
-
: undefined,
|
|
415
|
-
batch: isSet(object.batch)
|
|
416
|
-
? BatchProof.fromJSON(object.batch)
|
|
417
|
-
: undefined,
|
|
418
|
-
compressed: isSet(object.compressed)
|
|
419
|
-
? CompressedBatchProof.fromJSON(object.compressed)
|
|
420
|
-
: undefined,
|
|
421
|
-
};
|
|
422
|
-
},
|
|
423
|
-
toJSON(message) {
|
|
424
|
-
const obj = {};
|
|
425
|
-
message.exist !== undefined &&
|
|
426
|
-
(obj.exist = message.exist
|
|
427
|
-
? ExistenceProof.toJSON(message.exist)
|
|
428
|
-
: undefined);
|
|
429
|
-
message.nonexist !== undefined &&
|
|
430
|
-
(obj.nonexist = message.nonexist
|
|
431
|
-
? NonExistenceProof.toJSON(message.nonexist)
|
|
432
|
-
: undefined);
|
|
433
|
-
message.batch !== undefined &&
|
|
434
|
-
(obj.batch = message.batch
|
|
435
|
-
? BatchProof.toJSON(message.batch)
|
|
436
|
-
: undefined);
|
|
437
|
-
message.compressed !== undefined &&
|
|
438
|
-
(obj.compressed = message.compressed
|
|
439
|
-
? CompressedBatchProof.toJSON(message.compressed)
|
|
440
|
-
: undefined);
|
|
441
|
-
return obj;
|
|
442
|
-
},
|
|
443
|
-
fromPartial(object) {
|
|
444
|
-
const message = createBaseCommitmentProof();
|
|
445
|
-
message.exist =
|
|
446
|
-
object.exist !== undefined && object.exist !== null
|
|
447
|
-
? ExistenceProof.fromPartial(object.exist)
|
|
448
|
-
: undefined;
|
|
449
|
-
message.nonexist =
|
|
450
|
-
object.nonexist !== undefined && object.nonexist !== null
|
|
451
|
-
? NonExistenceProof.fromPartial(object.nonexist)
|
|
452
|
-
: undefined;
|
|
453
|
-
message.batch =
|
|
454
|
-
object.batch !== undefined && object.batch !== null
|
|
455
|
-
? BatchProof.fromPartial(object.batch)
|
|
456
|
-
: undefined;
|
|
457
|
-
message.compressed =
|
|
458
|
-
object.compressed !== undefined && object.compressed !== null
|
|
459
|
-
? CompressedBatchProof.fromPartial(object.compressed)
|
|
460
|
-
: undefined;
|
|
461
|
-
return message;
|
|
462
|
-
},
|
|
463
|
-
fromProtoMsg(message) {
|
|
464
|
-
return CommitmentProof.decode(message.value);
|
|
465
|
-
},
|
|
466
|
-
toProto(message) {
|
|
467
|
-
return CommitmentProof.encode(message).finish();
|
|
468
|
-
},
|
|
469
|
-
toProtoMsg(message) {
|
|
470
|
-
return {
|
|
471
|
-
typeUrl: '/ics23.CommitmentProof',
|
|
472
|
-
value: CommitmentProof.encode(message).finish(),
|
|
473
|
-
};
|
|
474
|
-
},
|
|
475
|
-
};
|
|
476
|
-
function createBaseLeafOp() {
|
|
477
|
-
return {
|
|
478
|
-
hash: 0,
|
|
479
|
-
prehashKey: 0,
|
|
480
|
-
prehashValue: 0,
|
|
481
|
-
length: 0,
|
|
482
|
-
prefix: new Uint8Array(),
|
|
483
|
-
};
|
|
484
|
-
}
|
|
485
|
-
export const LeafOp = {
|
|
486
|
-
typeUrl: '/ics23.LeafOp',
|
|
487
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
488
|
-
if (message.hash !== 0) {
|
|
489
|
-
writer.uint32(8).int32(message.hash);
|
|
490
|
-
}
|
|
491
|
-
if (message.prehashKey !== 0) {
|
|
492
|
-
writer.uint32(16).int32(message.prehashKey);
|
|
493
|
-
}
|
|
494
|
-
if (message.prehashValue !== 0) {
|
|
495
|
-
writer.uint32(24).int32(message.prehashValue);
|
|
496
|
-
}
|
|
497
|
-
if (message.length !== 0) {
|
|
498
|
-
writer.uint32(32).int32(message.length);
|
|
499
|
-
}
|
|
500
|
-
if (message.prefix.length !== 0) {
|
|
501
|
-
writer.uint32(42).bytes(message.prefix);
|
|
502
|
-
}
|
|
503
|
-
return writer;
|
|
504
|
-
},
|
|
505
|
-
decode(input, length) {
|
|
506
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
507
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
508
|
-
const message = createBaseLeafOp();
|
|
509
|
-
while (reader.pos < end) {
|
|
510
|
-
const tag = reader.uint32();
|
|
511
|
-
switch (tag >>> 3) {
|
|
512
|
-
case 1:
|
|
513
|
-
message.hash = reader.int32();
|
|
514
|
-
break;
|
|
515
|
-
case 2:
|
|
516
|
-
message.prehashKey = reader.int32();
|
|
517
|
-
break;
|
|
518
|
-
case 3:
|
|
519
|
-
message.prehashValue = reader.int32();
|
|
520
|
-
break;
|
|
521
|
-
case 4:
|
|
522
|
-
message.length = reader.int32();
|
|
523
|
-
break;
|
|
524
|
-
case 5:
|
|
525
|
-
message.prefix = reader.bytes();
|
|
526
|
-
break;
|
|
527
|
-
default:
|
|
528
|
-
reader.skipType(tag & 7);
|
|
529
|
-
break;
|
|
530
|
-
}
|
|
531
|
-
}
|
|
532
|
-
return message;
|
|
533
|
-
},
|
|
534
|
-
fromJSON(object) {
|
|
535
|
-
return {
|
|
536
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : -1,
|
|
537
|
-
prehashKey: isSet(object.prehashKey)
|
|
538
|
-
? hashOpFromJSON(object.prehashKey)
|
|
539
|
-
: -1,
|
|
540
|
-
prehashValue: isSet(object.prehashValue)
|
|
541
|
-
? hashOpFromJSON(object.prehashValue)
|
|
542
|
-
: -1,
|
|
543
|
-
length: isSet(object.length) ? lengthOpFromJSON(object.length) : -1,
|
|
544
|
-
prefix: isSet(object.prefix)
|
|
545
|
-
? bytesFromBase64(object.prefix)
|
|
546
|
-
: new Uint8Array(),
|
|
547
|
-
};
|
|
548
|
-
},
|
|
549
|
-
toJSON(message) {
|
|
550
|
-
const obj = {};
|
|
551
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
552
|
-
message.prehashKey !== undefined &&
|
|
553
|
-
(obj.prehashKey = hashOpToJSON(message.prehashKey));
|
|
554
|
-
message.prehashValue !== undefined &&
|
|
555
|
-
(obj.prehashValue = hashOpToJSON(message.prehashValue));
|
|
556
|
-
message.length !== undefined &&
|
|
557
|
-
(obj.length = lengthOpToJSON(message.length));
|
|
558
|
-
message.prefix !== undefined &&
|
|
559
|
-
(obj.prefix = base64FromBytes(message.prefix !== undefined ? message.prefix : new Uint8Array()));
|
|
560
|
-
return obj;
|
|
561
|
-
},
|
|
562
|
-
fromPartial(object) {
|
|
563
|
-
const message = createBaseLeafOp();
|
|
564
|
-
message.hash = object.hash ?? 0;
|
|
565
|
-
message.prehashKey = object.prehashKey ?? 0;
|
|
566
|
-
message.prehashValue = object.prehashValue ?? 0;
|
|
567
|
-
message.length = object.length ?? 0;
|
|
568
|
-
message.prefix = object.prefix ?? new Uint8Array();
|
|
569
|
-
return message;
|
|
570
|
-
},
|
|
571
|
-
fromProtoMsg(message) {
|
|
572
|
-
return LeafOp.decode(message.value);
|
|
573
|
-
},
|
|
574
|
-
toProto(message) {
|
|
575
|
-
return LeafOp.encode(message).finish();
|
|
576
|
-
},
|
|
577
|
-
toProtoMsg(message) {
|
|
578
|
-
return {
|
|
579
|
-
typeUrl: '/ics23.LeafOp',
|
|
580
|
-
value: LeafOp.encode(message).finish(),
|
|
581
|
-
};
|
|
582
|
-
},
|
|
583
|
-
};
|
|
584
|
-
function createBaseInnerOp() {
|
|
585
|
-
return {
|
|
586
|
-
hash: 0,
|
|
587
|
-
prefix: new Uint8Array(),
|
|
588
|
-
suffix: new Uint8Array(),
|
|
589
|
-
};
|
|
590
|
-
}
|
|
591
|
-
export const InnerOp = {
|
|
592
|
-
typeUrl: '/ics23.InnerOp',
|
|
593
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
594
|
-
if (message.hash !== 0) {
|
|
595
|
-
writer.uint32(8).int32(message.hash);
|
|
596
|
-
}
|
|
597
|
-
if (message.prefix.length !== 0) {
|
|
598
|
-
writer.uint32(18).bytes(message.prefix);
|
|
599
|
-
}
|
|
600
|
-
if (message.suffix.length !== 0) {
|
|
601
|
-
writer.uint32(26).bytes(message.suffix);
|
|
602
|
-
}
|
|
603
|
-
return writer;
|
|
604
|
-
},
|
|
605
|
-
decode(input, length) {
|
|
606
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
607
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
608
|
-
const message = createBaseInnerOp();
|
|
609
|
-
while (reader.pos < end) {
|
|
610
|
-
const tag = reader.uint32();
|
|
611
|
-
switch (tag >>> 3) {
|
|
612
|
-
case 1:
|
|
613
|
-
message.hash = reader.int32();
|
|
614
|
-
break;
|
|
615
|
-
case 2:
|
|
616
|
-
message.prefix = reader.bytes();
|
|
617
|
-
break;
|
|
618
|
-
case 3:
|
|
619
|
-
message.suffix = reader.bytes();
|
|
620
|
-
break;
|
|
621
|
-
default:
|
|
622
|
-
reader.skipType(tag & 7);
|
|
623
|
-
break;
|
|
624
|
-
}
|
|
625
|
-
}
|
|
626
|
-
return message;
|
|
627
|
-
},
|
|
628
|
-
fromJSON(object) {
|
|
629
|
-
return {
|
|
630
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : -1,
|
|
631
|
-
prefix: isSet(object.prefix)
|
|
632
|
-
? bytesFromBase64(object.prefix)
|
|
633
|
-
: new Uint8Array(),
|
|
634
|
-
suffix: isSet(object.suffix)
|
|
635
|
-
? bytesFromBase64(object.suffix)
|
|
636
|
-
: new Uint8Array(),
|
|
637
|
-
};
|
|
638
|
-
},
|
|
639
|
-
toJSON(message) {
|
|
640
|
-
const obj = {};
|
|
641
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
642
|
-
message.prefix !== undefined &&
|
|
643
|
-
(obj.prefix = base64FromBytes(message.prefix !== undefined ? message.prefix : new Uint8Array()));
|
|
644
|
-
message.suffix !== undefined &&
|
|
645
|
-
(obj.suffix = base64FromBytes(message.suffix !== undefined ? message.suffix : new Uint8Array()));
|
|
646
|
-
return obj;
|
|
647
|
-
},
|
|
648
|
-
fromPartial(object) {
|
|
649
|
-
const message = createBaseInnerOp();
|
|
650
|
-
message.hash = object.hash ?? 0;
|
|
651
|
-
message.prefix = object.prefix ?? new Uint8Array();
|
|
652
|
-
message.suffix = object.suffix ?? new Uint8Array();
|
|
653
|
-
return message;
|
|
654
|
-
},
|
|
655
|
-
fromProtoMsg(message) {
|
|
656
|
-
return InnerOp.decode(message.value);
|
|
657
|
-
},
|
|
658
|
-
toProto(message) {
|
|
659
|
-
return InnerOp.encode(message).finish();
|
|
660
|
-
},
|
|
661
|
-
toProtoMsg(message) {
|
|
662
|
-
return {
|
|
663
|
-
typeUrl: '/ics23.InnerOp',
|
|
664
|
-
value: InnerOp.encode(message).finish(),
|
|
665
|
-
};
|
|
666
|
-
},
|
|
667
|
-
};
|
|
668
|
-
function createBaseProofSpec() {
|
|
669
|
-
return {
|
|
670
|
-
leafSpec: undefined,
|
|
671
|
-
innerSpec: undefined,
|
|
672
|
-
maxDepth: 0,
|
|
673
|
-
minDepth: 0,
|
|
674
|
-
};
|
|
675
|
-
}
|
|
676
|
-
export const ProofSpec = {
|
|
677
|
-
typeUrl: '/ics23.ProofSpec',
|
|
678
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
679
|
-
if (message.leafSpec !== undefined) {
|
|
680
|
-
LeafOp.encode(message.leafSpec, writer.uint32(10).fork()).ldelim();
|
|
681
|
-
}
|
|
682
|
-
if (message.innerSpec !== undefined) {
|
|
683
|
-
InnerSpec.encode(message.innerSpec, writer.uint32(18).fork()).ldelim();
|
|
684
|
-
}
|
|
685
|
-
if (message.maxDepth !== 0) {
|
|
686
|
-
writer.uint32(24).int32(message.maxDepth);
|
|
687
|
-
}
|
|
688
|
-
if (message.minDepth !== 0) {
|
|
689
|
-
writer.uint32(32).int32(message.minDepth);
|
|
690
|
-
}
|
|
691
|
-
return writer;
|
|
692
|
-
},
|
|
693
|
-
decode(input, length) {
|
|
694
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
695
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
696
|
-
const message = createBaseProofSpec();
|
|
697
|
-
while (reader.pos < end) {
|
|
698
|
-
const tag = reader.uint32();
|
|
699
|
-
switch (tag >>> 3) {
|
|
700
|
-
case 1:
|
|
701
|
-
message.leafSpec = LeafOp.decode(reader, reader.uint32());
|
|
702
|
-
break;
|
|
703
|
-
case 2:
|
|
704
|
-
message.innerSpec = InnerSpec.decode(reader, reader.uint32());
|
|
705
|
-
break;
|
|
706
|
-
case 3:
|
|
707
|
-
message.maxDepth = reader.int32();
|
|
708
|
-
break;
|
|
709
|
-
case 4:
|
|
710
|
-
message.minDepth = reader.int32();
|
|
711
|
-
break;
|
|
712
|
-
default:
|
|
713
|
-
reader.skipType(tag & 7);
|
|
714
|
-
break;
|
|
715
|
-
}
|
|
716
|
-
}
|
|
717
|
-
return message;
|
|
718
|
-
},
|
|
719
|
-
fromJSON(object) {
|
|
720
|
-
return {
|
|
721
|
-
leafSpec: isSet(object.leafSpec)
|
|
722
|
-
? LeafOp.fromJSON(object.leafSpec)
|
|
723
|
-
: undefined,
|
|
724
|
-
innerSpec: isSet(object.innerSpec)
|
|
725
|
-
? InnerSpec.fromJSON(object.innerSpec)
|
|
726
|
-
: undefined,
|
|
727
|
-
maxDepth: isSet(object.maxDepth) ? Number(object.maxDepth) : 0,
|
|
728
|
-
minDepth: isSet(object.minDepth) ? Number(object.minDepth) : 0,
|
|
729
|
-
};
|
|
730
|
-
},
|
|
731
|
-
toJSON(message) {
|
|
732
|
-
const obj = {};
|
|
733
|
-
message.leafSpec !== undefined &&
|
|
734
|
-
(obj.leafSpec = message.leafSpec
|
|
735
|
-
? LeafOp.toJSON(message.leafSpec)
|
|
736
|
-
: undefined);
|
|
737
|
-
message.innerSpec !== undefined &&
|
|
738
|
-
(obj.innerSpec = message.innerSpec
|
|
739
|
-
? InnerSpec.toJSON(message.innerSpec)
|
|
740
|
-
: undefined);
|
|
741
|
-
message.maxDepth !== undefined &&
|
|
742
|
-
(obj.maxDepth = Math.round(message.maxDepth));
|
|
743
|
-
message.minDepth !== undefined &&
|
|
744
|
-
(obj.minDepth = Math.round(message.minDepth));
|
|
745
|
-
return obj;
|
|
746
|
-
},
|
|
747
|
-
fromPartial(object) {
|
|
748
|
-
const message = createBaseProofSpec();
|
|
749
|
-
message.leafSpec =
|
|
750
|
-
object.leafSpec !== undefined && object.leafSpec !== null
|
|
751
|
-
? LeafOp.fromPartial(object.leafSpec)
|
|
752
|
-
: undefined;
|
|
753
|
-
message.innerSpec =
|
|
754
|
-
object.innerSpec !== undefined && object.innerSpec !== null
|
|
755
|
-
? InnerSpec.fromPartial(object.innerSpec)
|
|
756
|
-
: undefined;
|
|
757
|
-
message.maxDepth = object.maxDepth ?? 0;
|
|
758
|
-
message.minDepth = object.minDepth ?? 0;
|
|
759
|
-
return message;
|
|
760
|
-
},
|
|
761
|
-
fromProtoMsg(message) {
|
|
762
|
-
return ProofSpec.decode(message.value);
|
|
763
|
-
},
|
|
764
|
-
toProto(message) {
|
|
765
|
-
return ProofSpec.encode(message).finish();
|
|
766
|
-
},
|
|
767
|
-
toProtoMsg(message) {
|
|
768
|
-
return {
|
|
769
|
-
typeUrl: '/ics23.ProofSpec',
|
|
770
|
-
value: ProofSpec.encode(message).finish(),
|
|
771
|
-
};
|
|
772
|
-
},
|
|
773
|
-
};
|
|
774
|
-
function createBaseInnerSpec() {
|
|
775
|
-
return {
|
|
776
|
-
childOrder: [],
|
|
777
|
-
childSize: 0,
|
|
778
|
-
minPrefixLength: 0,
|
|
779
|
-
maxPrefixLength: 0,
|
|
780
|
-
emptyChild: new Uint8Array(),
|
|
781
|
-
hash: 0,
|
|
782
|
-
};
|
|
783
|
-
}
|
|
784
|
-
export const InnerSpec = {
|
|
785
|
-
typeUrl: '/ics23.InnerSpec',
|
|
786
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
787
|
-
writer.uint32(10).fork();
|
|
788
|
-
for (const v of message.childOrder) {
|
|
789
|
-
writer.int32(v);
|
|
790
|
-
}
|
|
791
|
-
writer.ldelim();
|
|
792
|
-
if (message.childSize !== 0) {
|
|
793
|
-
writer.uint32(16).int32(message.childSize);
|
|
794
|
-
}
|
|
795
|
-
if (message.minPrefixLength !== 0) {
|
|
796
|
-
writer.uint32(24).int32(message.minPrefixLength);
|
|
797
|
-
}
|
|
798
|
-
if (message.maxPrefixLength !== 0) {
|
|
799
|
-
writer.uint32(32).int32(message.maxPrefixLength);
|
|
800
|
-
}
|
|
801
|
-
if (message.emptyChild.length !== 0) {
|
|
802
|
-
writer.uint32(42).bytes(message.emptyChild);
|
|
803
|
-
}
|
|
804
|
-
if (message.hash !== 0) {
|
|
805
|
-
writer.uint32(48).int32(message.hash);
|
|
806
|
-
}
|
|
807
|
-
return writer;
|
|
808
|
-
},
|
|
809
|
-
decode(input, length) {
|
|
810
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
811
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
812
|
-
const message = createBaseInnerSpec();
|
|
813
|
-
while (reader.pos < end) {
|
|
814
|
-
const tag = reader.uint32();
|
|
815
|
-
switch (tag >>> 3) {
|
|
816
|
-
case 1:
|
|
817
|
-
if ((tag & 7) === 2) {
|
|
818
|
-
const end2 = reader.uint32() + reader.pos;
|
|
819
|
-
while (reader.pos < end2) {
|
|
820
|
-
message.childOrder.push(reader.int32());
|
|
821
|
-
}
|
|
822
|
-
}
|
|
823
|
-
else {
|
|
824
|
-
message.childOrder.push(reader.int32());
|
|
825
|
-
}
|
|
826
|
-
break;
|
|
827
|
-
case 2:
|
|
828
|
-
message.childSize = reader.int32();
|
|
829
|
-
break;
|
|
830
|
-
case 3:
|
|
831
|
-
message.minPrefixLength = reader.int32();
|
|
832
|
-
break;
|
|
833
|
-
case 4:
|
|
834
|
-
message.maxPrefixLength = reader.int32();
|
|
835
|
-
break;
|
|
836
|
-
case 5:
|
|
837
|
-
message.emptyChild = reader.bytes();
|
|
838
|
-
break;
|
|
839
|
-
case 6:
|
|
840
|
-
message.hash = reader.int32();
|
|
841
|
-
break;
|
|
842
|
-
default:
|
|
843
|
-
reader.skipType(tag & 7);
|
|
844
|
-
break;
|
|
845
|
-
}
|
|
846
|
-
}
|
|
847
|
-
return message;
|
|
848
|
-
},
|
|
849
|
-
fromJSON(object) {
|
|
850
|
-
return {
|
|
851
|
-
childOrder: Array.isArray(object?.childOrder)
|
|
852
|
-
? object.childOrder.map((e) => Number(e))
|
|
853
|
-
: [],
|
|
854
|
-
childSize: isSet(object.childSize) ? Number(object.childSize) : 0,
|
|
855
|
-
minPrefixLength: isSet(object.minPrefixLength)
|
|
856
|
-
? Number(object.minPrefixLength)
|
|
857
|
-
: 0,
|
|
858
|
-
maxPrefixLength: isSet(object.maxPrefixLength)
|
|
859
|
-
? Number(object.maxPrefixLength)
|
|
860
|
-
: 0,
|
|
861
|
-
emptyChild: isSet(object.emptyChild)
|
|
862
|
-
? bytesFromBase64(object.emptyChild)
|
|
863
|
-
: new Uint8Array(),
|
|
864
|
-
hash: isSet(object.hash) ? hashOpFromJSON(object.hash) : -1,
|
|
865
|
-
};
|
|
866
|
-
},
|
|
867
|
-
toJSON(message) {
|
|
868
|
-
const obj = {};
|
|
869
|
-
if (message.childOrder) {
|
|
870
|
-
obj.childOrder = message.childOrder.map(e => Math.round(e));
|
|
871
|
-
}
|
|
872
|
-
else {
|
|
873
|
-
obj.childOrder = [];
|
|
874
|
-
}
|
|
875
|
-
message.childSize !== undefined &&
|
|
876
|
-
(obj.childSize = Math.round(message.childSize));
|
|
877
|
-
message.minPrefixLength !== undefined &&
|
|
878
|
-
(obj.minPrefixLength = Math.round(message.minPrefixLength));
|
|
879
|
-
message.maxPrefixLength !== undefined &&
|
|
880
|
-
(obj.maxPrefixLength = Math.round(message.maxPrefixLength));
|
|
881
|
-
message.emptyChild !== undefined &&
|
|
882
|
-
(obj.emptyChild = base64FromBytes(message.emptyChild !== undefined
|
|
883
|
-
? message.emptyChild
|
|
884
|
-
: new Uint8Array()));
|
|
885
|
-
message.hash !== undefined && (obj.hash = hashOpToJSON(message.hash));
|
|
886
|
-
return obj;
|
|
887
|
-
},
|
|
888
|
-
fromPartial(object) {
|
|
889
|
-
const message = createBaseInnerSpec();
|
|
890
|
-
message.childOrder = object.childOrder?.map(e => e) || [];
|
|
891
|
-
message.childSize = object.childSize ?? 0;
|
|
892
|
-
message.minPrefixLength = object.minPrefixLength ?? 0;
|
|
893
|
-
message.maxPrefixLength = object.maxPrefixLength ?? 0;
|
|
894
|
-
message.emptyChild = object.emptyChild ?? new Uint8Array();
|
|
895
|
-
message.hash = object.hash ?? 0;
|
|
896
|
-
return message;
|
|
897
|
-
},
|
|
898
|
-
fromProtoMsg(message) {
|
|
899
|
-
return InnerSpec.decode(message.value);
|
|
900
|
-
},
|
|
901
|
-
toProto(message) {
|
|
902
|
-
return InnerSpec.encode(message).finish();
|
|
903
|
-
},
|
|
904
|
-
toProtoMsg(message) {
|
|
905
|
-
return {
|
|
906
|
-
typeUrl: '/ics23.InnerSpec',
|
|
907
|
-
value: InnerSpec.encode(message).finish(),
|
|
908
|
-
};
|
|
909
|
-
},
|
|
910
|
-
};
|
|
911
|
-
function createBaseBatchProof() {
|
|
912
|
-
return {
|
|
913
|
-
entries: [],
|
|
914
|
-
};
|
|
915
|
-
}
|
|
916
|
-
export const BatchProof = {
|
|
917
|
-
typeUrl: '/ics23.BatchProof',
|
|
918
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
919
|
-
for (const v of message.entries) {
|
|
920
|
-
BatchEntry.encode(v, writer.uint32(10).fork()).ldelim();
|
|
921
|
-
}
|
|
922
|
-
return writer;
|
|
923
|
-
},
|
|
924
|
-
decode(input, length) {
|
|
925
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
926
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
927
|
-
const message = createBaseBatchProof();
|
|
928
|
-
while (reader.pos < end) {
|
|
929
|
-
const tag = reader.uint32();
|
|
930
|
-
switch (tag >>> 3) {
|
|
931
|
-
case 1:
|
|
932
|
-
message.entries.push(BatchEntry.decode(reader, reader.uint32()));
|
|
933
|
-
break;
|
|
934
|
-
default:
|
|
935
|
-
reader.skipType(tag & 7);
|
|
936
|
-
break;
|
|
937
|
-
}
|
|
938
|
-
}
|
|
939
|
-
return message;
|
|
940
|
-
},
|
|
941
|
-
fromJSON(object) {
|
|
942
|
-
return {
|
|
943
|
-
entries: Array.isArray(object?.entries)
|
|
944
|
-
? object.entries.map((e) => BatchEntry.fromJSON(e))
|
|
945
|
-
: [],
|
|
946
|
-
};
|
|
947
|
-
},
|
|
948
|
-
toJSON(message) {
|
|
949
|
-
const obj = {};
|
|
950
|
-
if (message.entries) {
|
|
951
|
-
obj.entries = message.entries.map(e => e ? BatchEntry.toJSON(e) : undefined);
|
|
952
|
-
}
|
|
953
|
-
else {
|
|
954
|
-
obj.entries = [];
|
|
955
|
-
}
|
|
956
|
-
return obj;
|
|
957
|
-
},
|
|
958
|
-
fromPartial(object) {
|
|
959
|
-
const message = createBaseBatchProof();
|
|
960
|
-
message.entries = object.entries?.map(e => BatchEntry.fromPartial(e)) || [];
|
|
961
|
-
return message;
|
|
962
|
-
},
|
|
963
|
-
fromProtoMsg(message) {
|
|
964
|
-
return BatchProof.decode(message.value);
|
|
965
|
-
},
|
|
966
|
-
toProto(message) {
|
|
967
|
-
return BatchProof.encode(message).finish();
|
|
968
|
-
},
|
|
969
|
-
toProtoMsg(message) {
|
|
970
|
-
return {
|
|
971
|
-
typeUrl: '/ics23.BatchProof',
|
|
972
|
-
value: BatchProof.encode(message).finish(),
|
|
973
|
-
};
|
|
974
|
-
},
|
|
975
|
-
};
|
|
976
|
-
function createBaseBatchEntry() {
|
|
977
|
-
return {
|
|
978
|
-
exist: undefined,
|
|
979
|
-
nonexist: undefined,
|
|
980
|
-
};
|
|
981
|
-
}
|
|
982
|
-
export const BatchEntry = {
|
|
983
|
-
typeUrl: '/ics23.BatchEntry',
|
|
984
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
985
|
-
if (message.exist !== undefined) {
|
|
986
|
-
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
987
|
-
}
|
|
988
|
-
if (message.nonexist !== undefined) {
|
|
989
|
-
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
990
|
-
}
|
|
991
|
-
return writer;
|
|
992
|
-
},
|
|
993
|
-
decode(input, length) {
|
|
994
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
995
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
996
|
-
const message = createBaseBatchEntry();
|
|
997
|
-
while (reader.pos < end) {
|
|
998
|
-
const tag = reader.uint32();
|
|
999
|
-
switch (tag >>> 3) {
|
|
1000
|
-
case 1:
|
|
1001
|
-
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
|
1002
|
-
break;
|
|
1003
|
-
case 2:
|
|
1004
|
-
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
|
1005
|
-
break;
|
|
1006
|
-
default:
|
|
1007
|
-
reader.skipType(tag & 7);
|
|
1008
|
-
break;
|
|
1009
|
-
}
|
|
1010
|
-
}
|
|
1011
|
-
return message;
|
|
1012
|
-
},
|
|
1013
|
-
fromJSON(object) {
|
|
1014
|
-
return {
|
|
1015
|
-
exist: isSet(object.exist)
|
|
1016
|
-
? ExistenceProof.fromJSON(object.exist)
|
|
1017
|
-
: undefined,
|
|
1018
|
-
nonexist: isSet(object.nonexist)
|
|
1019
|
-
? NonExistenceProof.fromJSON(object.nonexist)
|
|
1020
|
-
: undefined,
|
|
1021
|
-
};
|
|
1022
|
-
},
|
|
1023
|
-
toJSON(message) {
|
|
1024
|
-
const obj = {};
|
|
1025
|
-
message.exist !== undefined &&
|
|
1026
|
-
(obj.exist = message.exist
|
|
1027
|
-
? ExistenceProof.toJSON(message.exist)
|
|
1028
|
-
: undefined);
|
|
1029
|
-
message.nonexist !== undefined &&
|
|
1030
|
-
(obj.nonexist = message.nonexist
|
|
1031
|
-
? NonExistenceProof.toJSON(message.nonexist)
|
|
1032
|
-
: undefined);
|
|
1033
|
-
return obj;
|
|
1034
|
-
},
|
|
1035
|
-
fromPartial(object) {
|
|
1036
|
-
const message = createBaseBatchEntry();
|
|
1037
|
-
message.exist =
|
|
1038
|
-
object.exist !== undefined && object.exist !== null
|
|
1039
|
-
? ExistenceProof.fromPartial(object.exist)
|
|
1040
|
-
: undefined;
|
|
1041
|
-
message.nonexist =
|
|
1042
|
-
object.nonexist !== undefined && object.nonexist !== null
|
|
1043
|
-
? NonExistenceProof.fromPartial(object.nonexist)
|
|
1044
|
-
: undefined;
|
|
1045
|
-
return message;
|
|
1046
|
-
},
|
|
1047
|
-
fromProtoMsg(message) {
|
|
1048
|
-
return BatchEntry.decode(message.value);
|
|
1049
|
-
},
|
|
1050
|
-
toProto(message) {
|
|
1051
|
-
return BatchEntry.encode(message).finish();
|
|
1052
|
-
},
|
|
1053
|
-
toProtoMsg(message) {
|
|
1054
|
-
return {
|
|
1055
|
-
typeUrl: '/ics23.BatchEntry',
|
|
1056
|
-
value: BatchEntry.encode(message).finish(),
|
|
1057
|
-
};
|
|
1058
|
-
},
|
|
1059
|
-
};
|
|
1060
|
-
function createBaseCompressedBatchProof() {
|
|
1061
|
-
return {
|
|
1062
|
-
entries: [],
|
|
1063
|
-
lookupInners: [],
|
|
1064
|
-
};
|
|
1065
|
-
}
|
|
1066
|
-
export const CompressedBatchProof = {
|
|
1067
|
-
typeUrl: '/ics23.CompressedBatchProof',
|
|
1068
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
1069
|
-
for (const v of message.entries) {
|
|
1070
|
-
CompressedBatchEntry.encode(v, writer.uint32(10).fork()).ldelim();
|
|
1071
|
-
}
|
|
1072
|
-
for (const v of message.lookupInners) {
|
|
1073
|
-
InnerOp.encode(v, writer.uint32(18).fork()).ldelim();
|
|
1074
|
-
}
|
|
1075
|
-
return writer;
|
|
1076
|
-
},
|
|
1077
|
-
decode(input, length) {
|
|
1078
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1079
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
1080
|
-
const message = createBaseCompressedBatchProof();
|
|
1081
|
-
while (reader.pos < end) {
|
|
1082
|
-
const tag = reader.uint32();
|
|
1083
|
-
switch (tag >>> 3) {
|
|
1084
|
-
case 1:
|
|
1085
|
-
message.entries.push(CompressedBatchEntry.decode(reader, reader.uint32()));
|
|
1086
|
-
break;
|
|
1087
|
-
case 2:
|
|
1088
|
-
message.lookupInners.push(InnerOp.decode(reader, reader.uint32()));
|
|
1089
|
-
break;
|
|
1090
|
-
default:
|
|
1091
|
-
reader.skipType(tag & 7);
|
|
1092
|
-
break;
|
|
1093
|
-
}
|
|
1094
|
-
}
|
|
1095
|
-
return message;
|
|
1096
|
-
},
|
|
1097
|
-
fromJSON(object) {
|
|
1098
|
-
return {
|
|
1099
|
-
entries: Array.isArray(object?.entries)
|
|
1100
|
-
? object.entries.map((e) => CompressedBatchEntry.fromJSON(e))
|
|
1101
|
-
: [],
|
|
1102
|
-
lookupInners: Array.isArray(object?.lookupInners)
|
|
1103
|
-
? object.lookupInners.map((e) => InnerOp.fromJSON(e))
|
|
1104
|
-
: [],
|
|
1105
|
-
};
|
|
1106
|
-
},
|
|
1107
|
-
toJSON(message) {
|
|
1108
|
-
const obj = {};
|
|
1109
|
-
if (message.entries) {
|
|
1110
|
-
obj.entries = message.entries.map(e => e ? CompressedBatchEntry.toJSON(e) : undefined);
|
|
1111
|
-
}
|
|
1112
|
-
else {
|
|
1113
|
-
obj.entries = [];
|
|
1114
|
-
}
|
|
1115
|
-
if (message.lookupInners) {
|
|
1116
|
-
obj.lookupInners = message.lookupInners.map(e => e ? InnerOp.toJSON(e) : undefined);
|
|
1117
|
-
}
|
|
1118
|
-
else {
|
|
1119
|
-
obj.lookupInners = [];
|
|
1120
|
-
}
|
|
1121
|
-
return obj;
|
|
1122
|
-
},
|
|
1123
|
-
fromPartial(object) {
|
|
1124
|
-
const message = createBaseCompressedBatchProof();
|
|
1125
|
-
message.entries =
|
|
1126
|
-
object.entries?.map(e => CompressedBatchEntry.fromPartial(e)) || [];
|
|
1127
|
-
message.lookupInners =
|
|
1128
|
-
object.lookupInners?.map(e => InnerOp.fromPartial(e)) || [];
|
|
1129
|
-
return message;
|
|
1130
|
-
},
|
|
1131
|
-
fromProtoMsg(message) {
|
|
1132
|
-
return CompressedBatchProof.decode(message.value);
|
|
1133
|
-
},
|
|
1134
|
-
toProto(message) {
|
|
1135
|
-
return CompressedBatchProof.encode(message).finish();
|
|
1136
|
-
},
|
|
1137
|
-
toProtoMsg(message) {
|
|
1138
|
-
return {
|
|
1139
|
-
typeUrl: '/ics23.CompressedBatchProof',
|
|
1140
|
-
value: CompressedBatchProof.encode(message).finish(),
|
|
1141
|
-
};
|
|
1142
|
-
},
|
|
1143
|
-
};
|
|
1144
|
-
function createBaseCompressedBatchEntry() {
|
|
1145
|
-
return {
|
|
1146
|
-
exist: undefined,
|
|
1147
|
-
nonexist: undefined,
|
|
1148
|
-
};
|
|
1149
|
-
}
|
|
1150
|
-
export const CompressedBatchEntry = {
|
|
1151
|
-
typeUrl: '/ics23.CompressedBatchEntry',
|
|
1152
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
1153
|
-
if (message.exist !== undefined) {
|
|
1154
|
-
CompressedExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
|
1155
|
-
}
|
|
1156
|
-
if (message.nonexist !== undefined) {
|
|
1157
|
-
CompressedNonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
|
1158
|
-
}
|
|
1159
|
-
return writer;
|
|
1160
|
-
},
|
|
1161
|
-
decode(input, length) {
|
|
1162
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1163
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
1164
|
-
const message = createBaseCompressedBatchEntry();
|
|
1165
|
-
while (reader.pos < end) {
|
|
1166
|
-
const tag = reader.uint32();
|
|
1167
|
-
switch (tag >>> 3) {
|
|
1168
|
-
case 1:
|
|
1169
|
-
message.exist = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
1170
|
-
break;
|
|
1171
|
-
case 2:
|
|
1172
|
-
message.nonexist = CompressedNonExistenceProof.decode(reader, reader.uint32());
|
|
1173
|
-
break;
|
|
1174
|
-
default:
|
|
1175
|
-
reader.skipType(tag & 7);
|
|
1176
|
-
break;
|
|
1177
|
-
}
|
|
1178
|
-
}
|
|
1179
|
-
return message;
|
|
1180
|
-
},
|
|
1181
|
-
fromJSON(object) {
|
|
1182
|
-
return {
|
|
1183
|
-
exist: isSet(object.exist)
|
|
1184
|
-
? CompressedExistenceProof.fromJSON(object.exist)
|
|
1185
|
-
: undefined,
|
|
1186
|
-
nonexist: isSet(object.nonexist)
|
|
1187
|
-
? CompressedNonExistenceProof.fromJSON(object.nonexist)
|
|
1188
|
-
: undefined,
|
|
1189
|
-
};
|
|
1190
|
-
},
|
|
1191
|
-
toJSON(message) {
|
|
1192
|
-
const obj = {};
|
|
1193
|
-
message.exist !== undefined &&
|
|
1194
|
-
(obj.exist = message.exist
|
|
1195
|
-
? CompressedExistenceProof.toJSON(message.exist)
|
|
1196
|
-
: undefined);
|
|
1197
|
-
message.nonexist !== undefined &&
|
|
1198
|
-
(obj.nonexist = message.nonexist
|
|
1199
|
-
? CompressedNonExistenceProof.toJSON(message.nonexist)
|
|
1200
|
-
: undefined);
|
|
1201
|
-
return obj;
|
|
1202
|
-
},
|
|
1203
|
-
fromPartial(object) {
|
|
1204
|
-
const message = createBaseCompressedBatchEntry();
|
|
1205
|
-
message.exist =
|
|
1206
|
-
object.exist !== undefined && object.exist !== null
|
|
1207
|
-
? CompressedExistenceProof.fromPartial(object.exist)
|
|
1208
|
-
: undefined;
|
|
1209
|
-
message.nonexist =
|
|
1210
|
-
object.nonexist !== undefined && object.nonexist !== null
|
|
1211
|
-
? CompressedNonExistenceProof.fromPartial(object.nonexist)
|
|
1212
|
-
: undefined;
|
|
1213
|
-
return message;
|
|
1214
|
-
},
|
|
1215
|
-
fromProtoMsg(message) {
|
|
1216
|
-
return CompressedBatchEntry.decode(message.value);
|
|
1217
|
-
},
|
|
1218
|
-
toProto(message) {
|
|
1219
|
-
return CompressedBatchEntry.encode(message).finish();
|
|
1220
|
-
},
|
|
1221
|
-
toProtoMsg(message) {
|
|
1222
|
-
return {
|
|
1223
|
-
typeUrl: '/ics23.CompressedBatchEntry',
|
|
1224
|
-
value: CompressedBatchEntry.encode(message).finish(),
|
|
1225
|
-
};
|
|
1226
|
-
},
|
|
1227
|
-
};
|
|
1228
|
-
function createBaseCompressedExistenceProof() {
|
|
1229
|
-
return {
|
|
1230
|
-
key: new Uint8Array(),
|
|
1231
|
-
value: new Uint8Array(),
|
|
1232
|
-
leaf: undefined,
|
|
1233
|
-
path: [],
|
|
1234
|
-
};
|
|
1235
|
-
}
|
|
1236
|
-
export const CompressedExistenceProof = {
|
|
1237
|
-
typeUrl: '/ics23.CompressedExistenceProof',
|
|
1238
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
1239
|
-
if (message.key.length !== 0) {
|
|
1240
|
-
writer.uint32(10).bytes(message.key);
|
|
1241
|
-
}
|
|
1242
|
-
if (message.value.length !== 0) {
|
|
1243
|
-
writer.uint32(18).bytes(message.value);
|
|
1244
|
-
}
|
|
1245
|
-
if (message.leaf !== undefined) {
|
|
1246
|
-
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
|
1247
|
-
}
|
|
1248
|
-
writer.uint32(34).fork();
|
|
1249
|
-
for (const v of message.path) {
|
|
1250
|
-
writer.int32(v);
|
|
1251
|
-
}
|
|
1252
|
-
writer.ldelim();
|
|
1253
|
-
return writer;
|
|
1254
|
-
},
|
|
1255
|
-
decode(input, length) {
|
|
1256
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1257
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
1258
|
-
const message = createBaseCompressedExistenceProof();
|
|
1259
|
-
while (reader.pos < end) {
|
|
1260
|
-
const tag = reader.uint32();
|
|
1261
|
-
switch (tag >>> 3) {
|
|
1262
|
-
case 1:
|
|
1263
|
-
message.key = reader.bytes();
|
|
1264
|
-
break;
|
|
1265
|
-
case 2:
|
|
1266
|
-
message.value = reader.bytes();
|
|
1267
|
-
break;
|
|
1268
|
-
case 3:
|
|
1269
|
-
message.leaf = LeafOp.decode(reader, reader.uint32());
|
|
1270
|
-
break;
|
|
1271
|
-
case 4:
|
|
1272
|
-
if ((tag & 7) === 2) {
|
|
1273
|
-
const end2 = reader.uint32() + reader.pos;
|
|
1274
|
-
while (reader.pos < end2) {
|
|
1275
|
-
message.path.push(reader.int32());
|
|
1276
|
-
}
|
|
1277
|
-
}
|
|
1278
|
-
else {
|
|
1279
|
-
message.path.push(reader.int32());
|
|
1280
|
-
}
|
|
1281
|
-
break;
|
|
1282
|
-
default:
|
|
1283
|
-
reader.skipType(tag & 7);
|
|
1284
|
-
break;
|
|
1285
|
-
}
|
|
1286
|
-
}
|
|
1287
|
-
return message;
|
|
1288
|
-
},
|
|
1289
|
-
fromJSON(object) {
|
|
1290
|
-
return {
|
|
1291
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
1292
|
-
value: isSet(object.value)
|
|
1293
|
-
? bytesFromBase64(object.value)
|
|
1294
|
-
: new Uint8Array(),
|
|
1295
|
-
leaf: isSet(object.leaf) ? LeafOp.fromJSON(object.leaf) : undefined,
|
|
1296
|
-
path: Array.isArray(object?.path)
|
|
1297
|
-
? object.path.map((e) => Number(e))
|
|
1298
|
-
: [],
|
|
1299
|
-
};
|
|
1300
|
-
},
|
|
1301
|
-
toJSON(message) {
|
|
1302
|
-
const obj = {};
|
|
1303
|
-
message.key !== undefined &&
|
|
1304
|
-
(obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
1305
|
-
message.value !== undefined &&
|
|
1306
|
-
(obj.value = base64FromBytes(message.value !== undefined ? message.value : new Uint8Array()));
|
|
1307
|
-
message.leaf !== undefined &&
|
|
1308
|
-
(obj.leaf = message.leaf ? LeafOp.toJSON(message.leaf) : undefined);
|
|
1309
|
-
if (message.path) {
|
|
1310
|
-
obj.path = message.path.map(e => Math.round(e));
|
|
1311
|
-
}
|
|
1312
|
-
else {
|
|
1313
|
-
obj.path = [];
|
|
1314
|
-
}
|
|
1315
|
-
return obj;
|
|
1316
|
-
},
|
|
1317
|
-
fromPartial(object) {
|
|
1318
|
-
const message = createBaseCompressedExistenceProof();
|
|
1319
|
-
message.key = object.key ?? new Uint8Array();
|
|
1320
|
-
message.value = object.value ?? new Uint8Array();
|
|
1321
|
-
message.leaf =
|
|
1322
|
-
object.leaf !== undefined && object.leaf !== null
|
|
1323
|
-
? LeafOp.fromPartial(object.leaf)
|
|
1324
|
-
: undefined;
|
|
1325
|
-
message.path = object.path?.map(e => e) || [];
|
|
1326
|
-
return message;
|
|
1327
|
-
},
|
|
1328
|
-
fromProtoMsg(message) {
|
|
1329
|
-
return CompressedExistenceProof.decode(message.value);
|
|
1330
|
-
},
|
|
1331
|
-
toProto(message) {
|
|
1332
|
-
return CompressedExistenceProof.encode(message).finish();
|
|
1333
|
-
},
|
|
1334
|
-
toProtoMsg(message) {
|
|
1335
|
-
return {
|
|
1336
|
-
typeUrl: '/ics23.CompressedExistenceProof',
|
|
1337
|
-
value: CompressedExistenceProof.encode(message).finish(),
|
|
1338
|
-
};
|
|
1339
|
-
},
|
|
1340
|
-
};
|
|
1341
|
-
function createBaseCompressedNonExistenceProof() {
|
|
1342
|
-
return {
|
|
1343
|
-
key: new Uint8Array(),
|
|
1344
|
-
left: undefined,
|
|
1345
|
-
right: undefined,
|
|
1346
|
-
};
|
|
1347
|
-
}
|
|
1348
|
-
export const CompressedNonExistenceProof = {
|
|
1349
|
-
typeUrl: '/ics23.CompressedNonExistenceProof',
|
|
1350
|
-
encode(message, writer = BinaryWriter.create()) {
|
|
1351
|
-
if (message.key.length !== 0) {
|
|
1352
|
-
writer.uint32(10).bytes(message.key);
|
|
1353
|
-
}
|
|
1354
|
-
if (message.left !== undefined) {
|
|
1355
|
-
CompressedExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
|
1356
|
-
}
|
|
1357
|
-
if (message.right !== undefined) {
|
|
1358
|
-
CompressedExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
|
1359
|
-
}
|
|
1360
|
-
return writer;
|
|
1361
|
-
},
|
|
1362
|
-
decode(input, length) {
|
|
1363
|
-
const reader = input instanceof BinaryReader ? input : new BinaryReader(input);
|
|
1364
|
-
let end = length === undefined ? reader.len : reader.pos + length;
|
|
1365
|
-
const message = createBaseCompressedNonExistenceProof();
|
|
1366
|
-
while (reader.pos < end) {
|
|
1367
|
-
const tag = reader.uint32();
|
|
1368
|
-
switch (tag >>> 3) {
|
|
1369
|
-
case 1:
|
|
1370
|
-
message.key = reader.bytes();
|
|
1371
|
-
break;
|
|
1372
|
-
case 2:
|
|
1373
|
-
message.left = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
1374
|
-
break;
|
|
1375
|
-
case 3:
|
|
1376
|
-
message.right = CompressedExistenceProof.decode(reader, reader.uint32());
|
|
1377
|
-
break;
|
|
1378
|
-
default:
|
|
1379
|
-
reader.skipType(tag & 7);
|
|
1380
|
-
break;
|
|
1381
|
-
}
|
|
1382
|
-
}
|
|
1383
|
-
return message;
|
|
1384
|
-
},
|
|
1385
|
-
fromJSON(object) {
|
|
1386
|
-
return {
|
|
1387
|
-
key: isSet(object.key) ? bytesFromBase64(object.key) : new Uint8Array(),
|
|
1388
|
-
left: isSet(object.left)
|
|
1389
|
-
? CompressedExistenceProof.fromJSON(object.left)
|
|
1390
|
-
: undefined,
|
|
1391
|
-
right: isSet(object.right)
|
|
1392
|
-
? CompressedExistenceProof.fromJSON(object.right)
|
|
1393
|
-
: undefined,
|
|
1394
|
-
};
|
|
1395
|
-
},
|
|
1396
|
-
toJSON(message) {
|
|
1397
|
-
const obj = {};
|
|
1398
|
-
message.key !== undefined &&
|
|
1399
|
-
(obj.key = base64FromBytes(message.key !== undefined ? message.key : new Uint8Array()));
|
|
1400
|
-
message.left !== undefined &&
|
|
1401
|
-
(obj.left = message.left
|
|
1402
|
-
? CompressedExistenceProof.toJSON(message.left)
|
|
1403
|
-
: undefined);
|
|
1404
|
-
message.right !== undefined &&
|
|
1405
|
-
(obj.right = message.right
|
|
1406
|
-
? CompressedExistenceProof.toJSON(message.right)
|
|
1407
|
-
: undefined);
|
|
1408
|
-
return obj;
|
|
1409
|
-
},
|
|
1410
|
-
fromPartial(object) {
|
|
1411
|
-
const message = createBaseCompressedNonExistenceProof();
|
|
1412
|
-
message.key = object.key ?? new Uint8Array();
|
|
1413
|
-
message.left =
|
|
1414
|
-
object.left !== undefined && object.left !== null
|
|
1415
|
-
? CompressedExistenceProof.fromPartial(object.left)
|
|
1416
|
-
: undefined;
|
|
1417
|
-
message.right =
|
|
1418
|
-
object.right !== undefined && object.right !== null
|
|
1419
|
-
? CompressedExistenceProof.fromPartial(object.right)
|
|
1420
|
-
: undefined;
|
|
1421
|
-
return message;
|
|
1422
|
-
},
|
|
1423
|
-
fromProtoMsg(message) {
|
|
1424
|
-
return CompressedNonExistenceProof.decode(message.value);
|
|
1425
|
-
},
|
|
1426
|
-
toProto(message) {
|
|
1427
|
-
return CompressedNonExistenceProof.encode(message).finish();
|
|
1428
|
-
},
|
|
1429
|
-
toProtoMsg(message) {
|
|
1430
|
-
return {
|
|
1431
|
-
typeUrl: '/ics23.CompressedNonExistenceProof',
|
|
1432
|
-
value: CompressedNonExistenceProof.encode(message).finish(),
|
|
1433
|
-
};
|
|
1434
|
-
},
|
|
1435
|
-
};
|
|
1436
|
-
//# sourceMappingURL=proofs.js.map
|
|
1
|
+
import{BinaryReader as e,BinaryWriter as o}from"./binary.js";import{isSet as t,bytesFromBase64 as r,base64FromBytes as n}from"./helpers.js";import{}from"./json-safe.js";export var HashOp;!function(e){e[e.NO_HASH=0]="NO_HASH",e[e.SHA256=1]="SHA256",e[e.SHA512=2]="SHA512",e[e.KECCAK=3]="KECCAK",e[e.RIPEMD160=4]="RIPEMD160",e[e.BITCOIN=5]="BITCOIN",e[e.SHA512_256=6]="SHA512_256",e[e.UNRECOGNIZED=-1]="UNRECOGNIZED"}(HashOp||(HashOp={}));export const HashOpSDKType=HashOp;export function hashOpFromJSON(e){switch(e){case 0:case"NO_HASH":return HashOp.NO_HASH;case 1:case"SHA256":return HashOp.SHA256;case 2:case"SHA512":return HashOp.SHA512;case 3:case"KECCAK":return HashOp.KECCAK;case 4:case"RIPEMD160":return HashOp.RIPEMD160;case 5:case"BITCOIN":return HashOp.BITCOIN;case 6:case"SHA512_256":return HashOp.SHA512_256;default:return HashOp.UNRECOGNIZED}}export function hashOpToJSON(e){switch(e){case HashOp.NO_HASH:return"NO_HASH";case HashOp.SHA256:return"SHA256";case HashOp.SHA512:return"SHA512";case HashOp.KECCAK:return"KECCAK";case HashOp.RIPEMD160:return"RIPEMD160";case HashOp.BITCOIN:return"BITCOIN";case HashOp.SHA512_256:return"SHA512_256";case HashOp.UNRECOGNIZED:default:return"UNRECOGNIZED"}}export var LengthOp;!function(e){e[e.NO_PREFIX=0]="NO_PREFIX",e[e.VAR_PROTO=1]="VAR_PROTO",e[e.VAR_RLP=2]="VAR_RLP",e[e.FIXED32_BIG=3]="FIXED32_BIG",e[e.FIXED32_LITTLE=4]="FIXED32_LITTLE",e[e.FIXED64_BIG=5]="FIXED64_BIG",e[e.FIXED64_LITTLE=6]="FIXED64_LITTLE",e[e.REQUIRE_32_BYTES=7]="REQUIRE_32_BYTES",e[e.REQUIRE_64_BYTES=8]="REQUIRE_64_BYTES",e[e.UNRECOGNIZED=-1]="UNRECOGNIZED"}(LengthOp||(LengthOp={}));export const LengthOpSDKType=LengthOp;export function lengthOpFromJSON(e){switch(e){case 0:case"NO_PREFIX":return LengthOp.NO_PREFIX;case 1:case"VAR_PROTO":return LengthOp.VAR_PROTO;case 2:case"VAR_RLP":return LengthOp.VAR_RLP;case 3:case"FIXED32_BIG":return LengthOp.FIXED32_BIG;case 4:case"FIXED32_LITTLE":return LengthOp.FIXED32_LITTLE;case 5:case"FIXED64_BIG":return LengthOp.FIXED64_BIG;case 6:case"FIXED64_LITTLE":return LengthOp.FIXED64_LITTLE;case 7:case"REQUIRE_32_BYTES":return LengthOp.REQUIRE_32_BYTES;case 8:case"REQUIRE_64_BYTES":return LengthOp.REQUIRE_64_BYTES;default:return LengthOp.UNRECOGNIZED}}export function lengthOpToJSON(e){switch(e){case LengthOp.NO_PREFIX:return"NO_PREFIX";case LengthOp.VAR_PROTO:return"VAR_PROTO";case LengthOp.VAR_RLP:return"VAR_RLP";case LengthOp.FIXED32_BIG:return"FIXED32_BIG";case LengthOp.FIXED32_LITTLE:return"FIXED32_LITTLE";case LengthOp.FIXED64_BIG:return"FIXED64_BIG";case LengthOp.FIXED64_LITTLE:return"FIXED64_LITTLE";case LengthOp.REQUIRE_32_BYTES:return"REQUIRE_32_BYTES";case LengthOp.REQUIRE_64_BYTES:return"REQUIRE_64_BYTES";case LengthOp.UNRECOGNIZED:default:return"UNRECOGNIZED"}}function i(){return{key:new Uint8Array,value:new Uint8Array,leaf:void 0,path:[]}}export const ExistenceProof={typeUrl:"/ics23.ExistenceProof",encode(e,t=o.create()){0!==e.key.length&&t.uint32(10).bytes(e.key),0!==e.value.length&&t.uint32(18).bytes(e.value),void 0!==e.leaf&&LeafOp.encode(e.leaf,t.uint32(26).fork()).ldelim();for(const o of e.path)InnerOp.encode(o,t.uint32(34).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=i();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.key=r.bytes();break;case 2:s.value=r.bytes();break;case 3:s.leaf=LeafOp.decode(r,r.uint32());break;case 4:s.path.push(InnerOp.decode(r,r.uint32()));break;default:r.skipType(7&e)}}return s},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,value:t(e.value)?r(e.value):new Uint8Array,leaf:t(e.leaf)?LeafOp.fromJSON(e.leaf):void 0,path:Array.isArray(e?.path)?e.path.map((e=>InnerOp.fromJSON(e))):[]}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.value&&(o.value=n(void 0!==e.value?e.value:new Uint8Array)),void 0!==e.leaf&&(o.leaf=e.leaf?LeafOp.toJSON(e.leaf):void 0),e.path?o.path=e.path.map((e=>e?InnerOp.toJSON(e):void 0)):o.path=[],o},fromPartial(e){const o=i();return o.key=e.key??new Uint8Array,o.value=e.value??new Uint8Array,o.leaf=void 0!==e.leaf&&null!==e.leaf?LeafOp.fromPartial(e.leaf):void 0,o.path=e.path?.map((e=>InnerOp.fromPartial(e)))||[],o},fromProtoMsg:e=>ExistenceProof.decode(e.value),toProto:e=>ExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.ExistenceProof",value:ExistenceProof.encode(e).finish()})};function s(){return{key:new Uint8Array,left:void 0,right:void 0}}export const NonExistenceProof={typeUrl:"/ics23.NonExistenceProof",encode:(e,t=o.create())=>(0!==e.key.length&&t.uint32(10).bytes(e.key),void 0!==e.left&&ExistenceProof.encode(e.left,t.uint32(18).fork()).ldelim(),void 0!==e.right&&ExistenceProof.encode(e.right,t.uint32(26).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=s();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.key=r.bytes();break;case 2:i.left=ExistenceProof.decode(r,r.uint32());break;case 3:i.right=ExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,left:t(e.left)?ExistenceProof.fromJSON(e.left):void 0,right:t(e.right)?ExistenceProof.fromJSON(e.right):void 0}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.left&&(o.left=e.left?ExistenceProof.toJSON(e.left):void 0),void 0!==e.right&&(o.right=e.right?ExistenceProof.toJSON(e.right):void 0),o},fromPartial(e){const o=s();return o.key=e.key??new Uint8Array,o.left=void 0!==e.left&&null!==e.left?ExistenceProof.fromPartial(e.left):void 0,o.right=void 0!==e.right&&null!==e.right?ExistenceProof.fromPartial(e.right):void 0,o},fromProtoMsg:e=>NonExistenceProof.decode(e.value),toProto:e=>NonExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.NonExistenceProof",value:NonExistenceProof.encode(e).finish()})};export const CommitmentProof={typeUrl:"/ics23.CommitmentProof",encode:(e,t=o.create())=>(void 0!==e.exist&&ExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&NonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),void 0!==e.batch&&BatchProof.encode(e.batch,t.uint32(26).fork()).ldelim(),void 0!==e.compressed&&CompressedBatchProof.encode(e.compressed,t.uint32(34).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={exist:void 0,nonexist:void 0,batch:void 0,compressed:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.exist=ExistenceProof.decode(r,r.uint32());break;case 2:i.nonexist=NonExistenceProof.decode(r,r.uint32());break;case 3:i.batch=BatchProof.decode(r,r.uint32());break;case 4:i.compressed=CompressedBatchProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({exist:t(e.exist)?ExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?NonExistenceProof.fromJSON(e.nonexist):void 0,batch:t(e.batch)?BatchProof.fromJSON(e.batch):void 0,compressed:t(e.compressed)?CompressedBatchProof.fromJSON(e.compressed):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?ExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?NonExistenceProof.toJSON(e.nonexist):void 0),void 0!==e.batch&&(o.batch=e.batch?BatchProof.toJSON(e.batch):void 0),void 0!==e.compressed&&(o.compressed=e.compressed?CompressedBatchProof.toJSON(e.compressed):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0,batch:void 0,compressed:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?ExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?NonExistenceProof.fromPartial(e.nonexist):void 0,o.batch=void 0!==e.batch&&null!==e.batch?BatchProof.fromPartial(e.batch):void 0,o.compressed=void 0!==e.compressed&&null!==e.compressed?CompressedBatchProof.fromPartial(e.compressed):void 0,o},fromProtoMsg:e=>CommitmentProof.decode(e.value),toProto:e=>CommitmentProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.CommitmentProof",value:CommitmentProof.encode(e).finish()})};function a(){return{hash:0,prehashKey:0,prehashValue:0,length:0,prefix:new Uint8Array}}export const LeafOp={typeUrl:"/ics23.LeafOp",encode:(e,t=o.create())=>(0!==e.hash&&t.uint32(8).int32(e.hash),0!==e.prehashKey&&t.uint32(16).int32(e.prehashKey),0!==e.prehashValue&&t.uint32(24).int32(e.prehashValue),0!==e.length&&t.uint32(32).int32(e.length),0!==e.prefix.length&&t.uint32(42).bytes(e.prefix),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=a();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.hash=r.int32();break;case 2:i.prehashKey=r.int32();break;case 3:i.prehashValue=r.int32();break;case 4:i.length=r.int32();break;case 5:i.prefix=r.bytes();break;default:r.skipType(7&e)}}return i},fromJSON:e=>({hash:t(e.hash)?hashOpFromJSON(e.hash):-1,prehashKey:t(e.prehashKey)?hashOpFromJSON(e.prehashKey):-1,prehashValue:t(e.prehashValue)?hashOpFromJSON(e.prehashValue):-1,length:t(e.length)?lengthOpFromJSON(e.length):-1,prefix:t(e.prefix)?r(e.prefix):new Uint8Array}),toJSON(e){const o={};return void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),void 0!==e.prehashKey&&(o.prehashKey=hashOpToJSON(e.prehashKey)),void 0!==e.prehashValue&&(o.prehashValue=hashOpToJSON(e.prehashValue)),void 0!==e.length&&(o.length=lengthOpToJSON(e.length)),void 0!==e.prefix&&(o.prefix=n(void 0!==e.prefix?e.prefix:new Uint8Array)),o},fromPartial(e){const o=a();return o.hash=e.hash??0,o.prehashKey=e.prehashKey??0,o.prehashValue=e.prehashValue??0,o.length=e.length??0,o.prefix=e.prefix??new Uint8Array,o},fromProtoMsg:e=>LeafOp.decode(e.value),toProto:e=>LeafOp.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.LeafOp",value:LeafOp.encode(e).finish()})};function c(){return{hash:0,prefix:new Uint8Array,suffix:new Uint8Array}}export const InnerOp={typeUrl:"/ics23.InnerOp",encode:(e,t=o.create())=>(0!==e.hash&&t.uint32(8).int32(e.hash),0!==e.prefix.length&&t.uint32(18).bytes(e.prefix),0!==e.suffix.length&&t.uint32(26).bytes(e.suffix),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=c();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.hash=r.int32();break;case 2:i.prefix=r.bytes();break;case 3:i.suffix=r.bytes();break;default:r.skipType(7&e)}}return i},fromJSON:e=>({hash:t(e.hash)?hashOpFromJSON(e.hash):-1,prefix:t(e.prefix)?r(e.prefix):new Uint8Array,suffix:t(e.suffix)?r(e.suffix):new Uint8Array}),toJSON(e){const o={};return void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),void 0!==e.prefix&&(o.prefix=n(void 0!==e.prefix?e.prefix:new Uint8Array)),void 0!==e.suffix&&(o.suffix=n(void 0!==e.suffix?e.suffix:new Uint8Array)),o},fromPartial(e){const o=c();return o.hash=e.hash??0,o.prefix=e.prefix??new Uint8Array,o.suffix=e.suffix??new Uint8Array,o},fromProtoMsg:e=>InnerOp.decode(e.value),toProto:e=>InnerOp.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.InnerOp",value:InnerOp.encode(e).finish()})};export const ProofSpec={typeUrl:"/ics23.ProofSpec",encode:(e,t=o.create())=>(void 0!==e.leafSpec&&LeafOp.encode(e.leafSpec,t.uint32(10).fork()).ldelim(),void 0!==e.innerSpec&&InnerSpec.encode(e.innerSpec,t.uint32(18).fork()).ldelim(),0!==e.maxDepth&&t.uint32(24).int32(e.maxDepth),0!==e.minDepth&&t.uint32(32).int32(e.minDepth),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={leafSpec:void 0,innerSpec:void 0,maxDepth:0,minDepth:0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.leafSpec=LeafOp.decode(r,r.uint32());break;case 2:i.innerSpec=InnerSpec.decode(r,r.uint32());break;case 3:i.maxDepth=r.int32();break;case 4:i.minDepth=r.int32();break;default:r.skipType(7&e)}}return i},fromJSON:e=>({leafSpec:t(e.leafSpec)?LeafOp.fromJSON(e.leafSpec):void 0,innerSpec:t(e.innerSpec)?InnerSpec.fromJSON(e.innerSpec):void 0,maxDepth:t(e.maxDepth)?Number(e.maxDepth):0,minDepth:t(e.minDepth)?Number(e.minDepth):0}),toJSON(e){const o={};return void 0!==e.leafSpec&&(o.leafSpec=e.leafSpec?LeafOp.toJSON(e.leafSpec):void 0),void 0!==e.innerSpec&&(o.innerSpec=e.innerSpec?InnerSpec.toJSON(e.innerSpec):void 0),void 0!==e.maxDepth&&(o.maxDepth=Math.round(e.maxDepth)),void 0!==e.minDepth&&(o.minDepth=Math.round(e.minDepth)),o},fromPartial(e){const o={leafSpec:void 0,innerSpec:void 0,maxDepth:0,minDepth:0};return o.leafSpec=void 0!==e.leafSpec&&null!==e.leafSpec?LeafOp.fromPartial(e.leafSpec):void 0,o.innerSpec=void 0!==e.innerSpec&&null!==e.innerSpec?InnerSpec.fromPartial(e.innerSpec):void 0,o.maxDepth=e.maxDepth??0,o.minDepth=e.minDepth??0,o},fromProtoMsg:e=>ProofSpec.decode(e.value),toProto:e=>ProofSpec.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.ProofSpec",value:ProofSpec.encode(e).finish()})};function d(){return{childOrder:[],childSize:0,minPrefixLength:0,maxPrefixLength:0,emptyChild:new Uint8Array,hash:0}}export const InnerSpec={typeUrl:"/ics23.InnerSpec",encode(e,t=o.create()){t.uint32(10).fork();for(const o of e.childOrder)t.int32(o);return t.ldelim(),0!==e.childSize&&t.uint32(16).int32(e.childSize),0!==e.minPrefixLength&&t.uint32(24).int32(e.minPrefixLength),0!==e.maxPrefixLength&&t.uint32(32).int32(e.maxPrefixLength),0!==e.emptyChild.length&&t.uint32(42).bytes(e.emptyChild),0!==e.hash&&t.uint32(48).int32(e.hash),t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=d();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:if(2==(7&e)){const e=r.uint32()+r.pos;for(;r.pos<e;)i.childOrder.push(r.int32())}else i.childOrder.push(r.int32());break;case 2:i.childSize=r.int32();break;case 3:i.minPrefixLength=r.int32();break;case 4:i.maxPrefixLength=r.int32();break;case 5:i.emptyChild=r.bytes();break;case 6:i.hash=r.int32();break;default:r.skipType(7&e)}}return i},fromJSON:e=>({childOrder:Array.isArray(e?.childOrder)?e.childOrder.map((e=>Number(e))):[],childSize:t(e.childSize)?Number(e.childSize):0,minPrefixLength:t(e.minPrefixLength)?Number(e.minPrefixLength):0,maxPrefixLength:t(e.maxPrefixLength)?Number(e.maxPrefixLength):0,emptyChild:t(e.emptyChild)?r(e.emptyChild):new Uint8Array,hash:t(e.hash)?hashOpFromJSON(e.hash):-1}),toJSON(e){const o={};return e.childOrder?o.childOrder=e.childOrder.map((e=>Math.round(e))):o.childOrder=[],void 0!==e.childSize&&(o.childSize=Math.round(e.childSize)),void 0!==e.minPrefixLength&&(o.minPrefixLength=Math.round(e.minPrefixLength)),void 0!==e.maxPrefixLength&&(o.maxPrefixLength=Math.round(e.maxPrefixLength)),void 0!==e.emptyChild&&(o.emptyChild=n(void 0!==e.emptyChild?e.emptyChild:new Uint8Array)),void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),o},fromPartial(e){const o=d();return o.childOrder=e.childOrder?.map((e=>e))||[],o.childSize=e.childSize??0,o.minPrefixLength=e.minPrefixLength??0,o.maxPrefixLength=e.maxPrefixLength??0,o.emptyChild=e.emptyChild??new Uint8Array,o.hash=e.hash??0,o},fromProtoMsg:e=>InnerSpec.decode(e.value),toProto:e=>InnerSpec.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.InnerSpec",value:InnerSpec.encode(e).finish()})};export const BatchProof={typeUrl:"/ics23.BatchProof",encode(e,t=o.create()){for(const o of e.entries)BatchEntry.encode(o,t.uint32(10).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={entries:[]};for(;r.pos<n;){const e=r.uint32();if(e>>>3==1)i.entries.push(BatchEntry.decode(r,r.uint32()));else r.skipType(7&e)}return i},fromJSON:e=>({entries:Array.isArray(e?.entries)?e.entries.map((e=>BatchEntry.fromJSON(e))):[]}),toJSON(e){const o={};return e.entries?o.entries=e.entries.map((e=>e?BatchEntry.toJSON(e):void 0)):o.entries=[],o},fromPartial(e){const o={entries:[]};return o.entries=e.entries?.map((e=>BatchEntry.fromPartial(e)))||[],o},fromProtoMsg:e=>BatchProof.decode(e.value),toProto:e=>BatchProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.BatchProof",value:BatchProof.encode(e).finish()})};export const BatchEntry={typeUrl:"/ics23.BatchEntry",encode:(e,t=o.create())=>(void 0!==e.exist&&ExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&NonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={exist:void 0,nonexist:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.exist=ExistenceProof.decode(r,r.uint32());break;case 2:i.nonexist=NonExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({exist:t(e.exist)?ExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?NonExistenceProof.fromJSON(e.nonexist):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?ExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?NonExistenceProof.toJSON(e.nonexist):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?ExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?NonExistenceProof.fromPartial(e.nonexist):void 0,o},fromProtoMsg:e=>BatchEntry.decode(e.value),toProto:e=>BatchEntry.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.BatchEntry",value:BatchEntry.encode(e).finish()})};export const CompressedBatchProof={typeUrl:"/ics23.CompressedBatchProof",encode(e,t=o.create()){for(const o of e.entries)CompressedBatchEntry.encode(o,t.uint32(10).fork()).ldelim();for(const o of e.lookupInners)InnerOp.encode(o,t.uint32(18).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={entries:[],lookupInners:[]};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.entries.push(CompressedBatchEntry.decode(r,r.uint32()));break;case 2:i.lookupInners.push(InnerOp.decode(r,r.uint32()));break;default:r.skipType(7&e)}}return i},fromJSON:e=>({entries:Array.isArray(e?.entries)?e.entries.map((e=>CompressedBatchEntry.fromJSON(e))):[],lookupInners:Array.isArray(e?.lookupInners)?e.lookupInners.map((e=>InnerOp.fromJSON(e))):[]}),toJSON(e){const o={};return e.entries?o.entries=e.entries.map((e=>e?CompressedBatchEntry.toJSON(e):void 0)):o.entries=[],e.lookupInners?o.lookupInners=e.lookupInners.map((e=>e?InnerOp.toJSON(e):void 0)):o.lookupInners=[],o},fromPartial(e){const o={entries:[],lookupInners:[]};return o.entries=e.entries?.map((e=>CompressedBatchEntry.fromPartial(e)))||[],o.lookupInners=e.lookupInners?.map((e=>InnerOp.fromPartial(e)))||[],o},fromProtoMsg:e=>CompressedBatchProof.decode(e.value),toProto:e=>CompressedBatchProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.CompressedBatchProof",value:CompressedBatchProof.encode(e).finish()})};export const CompressedBatchEntry={typeUrl:"/ics23.CompressedBatchEntry",encode:(e,t=o.create())=>(void 0!==e.exist&&CompressedExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&CompressedNonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i={exist:void 0,nonexist:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.exist=CompressedExistenceProof.decode(r,r.uint32());break;case 2:i.nonexist=CompressedNonExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({exist:t(e.exist)?CompressedExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?CompressedNonExistenceProof.fromJSON(e.nonexist):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?CompressedExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?CompressedNonExistenceProof.toJSON(e.nonexist):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?CompressedExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?CompressedNonExistenceProof.fromPartial(e.nonexist):void 0,o},fromProtoMsg:e=>CompressedBatchEntry.decode(e.value),toProto:e=>CompressedBatchEntry.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.CompressedBatchEntry",value:CompressedBatchEntry.encode(e).finish()})};function f(){return{key:new Uint8Array,value:new Uint8Array,leaf:void 0,path:[]}}export const CompressedExistenceProof={typeUrl:"/ics23.CompressedExistenceProof",encode(e,t=o.create()){0!==e.key.length&&t.uint32(10).bytes(e.key),0!==e.value.length&&t.uint32(18).bytes(e.value),void 0!==e.leaf&&LeafOp.encode(e.leaf,t.uint32(26).fork()).ldelim(),t.uint32(34).fork();for(const o of e.path)t.int32(o);return t.ldelim(),t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=f();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.key=r.bytes();break;case 2:i.value=r.bytes();break;case 3:i.leaf=LeafOp.decode(r,r.uint32());break;case 4:if(2==(7&e)){const e=r.uint32()+r.pos;for(;r.pos<e;)i.path.push(r.int32())}else i.path.push(r.int32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,value:t(e.value)?r(e.value):new Uint8Array,leaf:t(e.leaf)?LeafOp.fromJSON(e.leaf):void 0,path:Array.isArray(e?.path)?e.path.map((e=>Number(e))):[]}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.value&&(o.value=n(void 0!==e.value?e.value:new Uint8Array)),void 0!==e.leaf&&(o.leaf=e.leaf?LeafOp.toJSON(e.leaf):void 0),e.path?o.path=e.path.map((e=>Math.round(e))):o.path=[],o},fromPartial(e){const o=f();return o.key=e.key??new Uint8Array,o.value=e.value??new Uint8Array,o.leaf=void 0!==e.leaf&&null!==e.leaf?LeafOp.fromPartial(e.leaf):void 0,o.path=e.path?.map((e=>e))||[],o},fromProtoMsg:e=>CompressedExistenceProof.decode(e.value),toProto:e=>CompressedExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.CompressedExistenceProof",value:CompressedExistenceProof.encode(e).finish()})};function p(){return{key:new Uint8Array,left:void 0,right:void 0}}export const CompressedNonExistenceProof={typeUrl:"/ics23.CompressedNonExistenceProof",encode:(e,t=o.create())=>(0!==e.key.length&&t.uint32(10).bytes(e.key),void 0!==e.left&&CompressedExistenceProof.encode(e.left,t.uint32(18).fork()).ldelim(),void 0!==e.right&&CompressedExistenceProof.encode(e.right,t.uint32(26).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=p();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.key=r.bytes();break;case 2:i.left=CompressedExistenceProof.decode(r,r.uint32());break;case 3:i.right=CompressedExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return i},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,left:t(e.left)?CompressedExistenceProof.fromJSON(e.left):void 0,right:t(e.right)?CompressedExistenceProof.fromJSON(e.right):void 0}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.left&&(o.left=e.left?CompressedExistenceProof.toJSON(e.left):void 0),void 0!==e.right&&(o.right=e.right?CompressedExistenceProof.toJSON(e.right):void 0),o},fromPartial(e){const o=p();return o.key=e.key??new Uint8Array,o.left=void 0!==e.left&&null!==e.left?CompressedExistenceProof.fromPartial(e.left):void 0,o.right=void 0!==e.right&&null!==e.right?CompressedExistenceProof.fromPartial(e.right):void 0,o},fromProtoMsg:e=>CompressedNonExistenceProof.decode(e.value),toProto:e=>CompressedNonExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/ics23.CompressedNonExistenceProof",value:CompressedNonExistenceProof.encode(e).finish()})};
|