juno-network 0.5.3 → 0.6.0
Sign up to get free protection for your applications and to get access to all the features.
- package/README.md +0 -2
- package/main/codegen/JunoSwap.client.js +44 -42
- package/module/codegen/JunoSwap.client.js +180 -0
- package/module/codegen/JunoSwap.types.js +1 -0
- package/module/codegen/confio/proofs.js +1152 -0
- package/module/codegen/contracts.js +18 -0
- package/module/codegen/cosmos/app/v1alpha1/config.js +148 -0
- package/module/codegen/cosmos/app/v1alpha1/module.js +227 -0
- package/module/codegen/cosmos/app/v1alpha1/query.js +104 -0
- package/module/codegen/cosmos/app/v1alpha1/query.rpc.query.js +20 -0
- package/module/codegen/cosmos/auth/v1beta1/auth.js +297 -0
- package/module/codegen/cosmos/auth/v1beta1/genesis.js +82 -0
- package/module/codegen/cosmos/auth/v1beta1/query.js +806 -0
- package/module/codegen/cosmos/auth/v1beta1/query.lcd.js +73 -0
- package/module/codegen/cosmos/auth/v1beta1/query.rpc.query.js +62 -0
- package/module/codegen/cosmos/authz/v1beta1/authz.js +236 -0
- package/module/codegen/cosmos/authz/v1beta1/event.js +135 -0
- package/module/codegen/cosmos/authz/v1beta1/genesis.js +49 -0
- package/module/codegen/cosmos/authz/v1beta1/query.js +365 -0
- package/module/codegen/cosmos/authz/v1beta1/query.lcd.js +76 -0
- package/module/codegen/cosmos/authz/v1beta1/query.rpc.query.js +53 -0
- package/module/codegen/cosmos/authz/v1beta1/tx.amino.js +91 -0
- package/module/codegen/cosmos/authz/v1beta1/tx.js +309 -0
- package/module/codegen/cosmos/authz/v1beta1/tx.registry.js +124 -0
- package/module/codegen/cosmos/authz/v1beta1/tx.rpc.msg.js +34 -0
- package/module/codegen/cosmos/bank/v1beta1/authz.js +49 -0
- package/module/codegen/cosmos/bank/v1beta1/bank.js +461 -0
- package/module/codegen/cosmos/bank/v1beta1/genesis.js +137 -0
- package/module/codegen/cosmos/bank/v1beta1/query.js +972 -0
- package/module/codegen/cosmos/bank/v1beta1/query.lcd.js +147 -0
- package/module/codegen/cosmos/bank/v1beta1/query.rpc.query.js +123 -0
- package/module/codegen/cosmos/bank/v1beta1/tx.amino.js +78 -0
- package/module/codegen/cosmos/bank/v1beta1/tx.js +195 -0
- package/module/codegen/cosmos/bank/v1beta1/tx.registry.js +57 -0
- package/module/codegen/cosmos/bank/v1beta1/tx.rpc.msg.js +27 -0
- package/module/codegen/cosmos/base/abci/v1beta1/abci.js +754 -0
- package/module/codegen/cosmos/base/kv/v1beta1/kv.js +139 -0
- package/module/codegen/cosmos/base/query/v1beta1/pagination.js +155 -0
- package/module/codegen/cosmos/base/reflection/v1beta1/reflection.js +235 -0
- package/module/codegen/cosmos/base/reflection/v2alpha1/reflection.js +1281 -0
- package/module/codegen/cosmos/base/snapshots/v1beta1/snapshot.js +712 -0
- package/module/codegen/cosmos/base/store/v1beta1/commit_info.js +225 -0
- package/module/codegen/cosmos/base/store/v1beta1/listening.js +104 -0
- package/module/codegen/cosmos/base/tendermint/v1beta1/query.js +1091 -0
- package/module/codegen/cosmos/base/tendermint/v1beta1/query.lcd.js +72 -0
- package/module/codegen/cosmos/base/tendermint/v1beta1/query.rpc.svc.js +55 -0
- package/module/codegen/cosmos/base/v1beta1/coin.js +209 -0
- package/module/codegen/cosmos/bundle.js +190 -0
- package/module/codegen/cosmos/capability/v1beta1/capability.js +199 -0
- package/module/codegen/cosmos/capability/v1beta1/genesis.js +150 -0
- package/module/codegen/cosmos/client.js +44 -0
- package/module/codegen/cosmos/crisis/v1beta1/genesis.js +61 -0
- package/module/codegen/cosmos/crisis/v1beta1/tx.amino.js +27 -0
- package/module/codegen/cosmos/crisis/v1beta1/tx.js +129 -0
- package/module/codegen/cosmos/crisis/v1beta1/tx.registry.js +54 -0
- package/module/codegen/cosmos/crisis/v1beta1/tx.rpc.msg.js +20 -0
- package/module/codegen/cosmos/crypto/ed25519/keys.js +95 -0
- package/module/codegen/cosmos/crypto/hd/v1/hd.js +88 -0
- package/module/codegen/cosmos/crypto/keyring/v1/record.js +270 -0
- package/module/codegen/cosmos/crypto/multisig/keys.js +59 -0
- package/module/codegen/cosmos/crypto/multisig/v1beta1/multisig.js +105 -0
- package/module/codegen/cosmos/crypto/secp256k1/keys.js +95 -0
- package/module/codegen/cosmos/crypto/secp256r1/keys.js +95 -0
- package/module/codegen/cosmos/distribution/v1beta1/distribution.js +728 -0
- package/module/codegen/cosmos/distribution/v1beta1/genesis.js +585 -0
- package/module/codegen/cosmos/distribution/v1beta1/query.js +880 -0
- package/module/codegen/cosmos/distribution/v1beta1/query.lcd.js +101 -0
- package/module/codegen/cosmos/distribution/v1beta1/query.rpc.query.js +119 -0
- package/module/codegen/cosmos/distribution/v1beta1/tx.amino.js +88 -0
- package/module/codegen/cosmos/distribution/v1beta1/tx.js +382 -0
- package/module/codegen/cosmos/distribution/v1beta1/tx.registry.js +99 -0
- package/module/codegen/cosmos/distribution/v1beta1/tx.rpc.msg.js +41 -0
- package/module/codegen/cosmos/evidence/v1beta1/evidence.js +102 -0
- package/module/codegen/cosmos/evidence/v1beta1/genesis.js +67 -0
- package/module/codegen/cosmos/evidence/v1beta1/query.js +255 -0
- package/module/codegen/cosmos/evidence/v1beta1/query.lcd.js +36 -0
- package/module/codegen/cosmos/evidence/v1beta1/query.rpc.query.js +27 -0
- package/module/codegen/cosmos/evidence/v1beta1/tx.amino.js +29 -0
- package/module/codegen/cosmos/evidence/v1beta1/tx.js +137 -0
- package/module/codegen/cosmos/evidence/v1beta1/tx.registry.js +54 -0
- package/module/codegen/cosmos/evidence/v1beta1/tx.rpc.msg.js +20 -0
- package/module/codegen/cosmos/feegrant/v1beta1/feegrant.js +365 -0
- package/module/codegen/cosmos/feegrant/v1beta1/genesis.js +67 -0
- package/module/codegen/cosmos/feegrant/v1beta1/query.js +429 -0
- package/module/codegen/cosmos/feegrant/v1beta1/query.lcd.js +50 -0
- package/module/codegen/cosmos/feegrant/v1beta1/query.rpc.query.js +34 -0
- package/module/codegen/cosmos/feegrant/v1beta1/tx.amino.js +54 -0
- package/module/codegen/cosmos/feegrant/v1beta1/tx.js +247 -0
- package/module/codegen/cosmos/feegrant/v1beta1/tx.registry.js +89 -0
- package/module/codegen/cosmos/feegrant/v1beta1/tx.rpc.msg.js +27 -0
- package/module/codegen/cosmos/genutil/v1beta1/genesis.js +68 -0
- package/module/codegen/cosmos/gov/v1/genesis.js +111 -0
- package/module/codegen/cosmos/gov/v1/gov.js +750 -0
- package/module/codegen/cosmos/gov/v1/query.js +859 -0
- package/module/codegen/cosmos/gov/v1/query.lcd.js +112 -0
- package/module/codegen/cosmos/gov/v1/query.rpc.query.js +108 -0
- package/module/codegen/cosmos/gov/v1/tx.amino.js +167 -0
- package/module/codegen/cosmos/gov/v1/tx.js +545 -0
- package/module/codegen/cosmos/gov/v1/tx.registry.js +120 -0
- package/module/codegen/cosmos/gov/v1/tx.rpc.msg.js +48 -0
- package/module/codegen/cosmos/gov/v1beta1/genesis.js +111 -0
- package/module/codegen/cosmos/gov/v1beta1/gov.js +801 -0
- package/module/codegen/cosmos/gov/v1beta1/query.js +859 -0
- package/module/codegen/cosmos/gov/v1beta1/query.lcd.js +112 -0
- package/module/codegen/cosmos/gov/v1beta1/query.rpc.query.js +108 -0
- package/module/codegen/cosmos/gov/v1beta1/tx.amino.js +128 -0
- package/module/codegen/cosmos/gov/v1beta1/tx.js +424 -0
- package/module/codegen/cosmos/gov/v1beta1/tx.registry.js +99 -0
- package/module/codegen/cosmos/gov/v1beta1/tx.rpc.msg.js +41 -0
- package/module/codegen/cosmos/group/v1/events.js +549 -0
- package/module/codegen/cosmos/group/v1/genesis.js +175 -0
- package/module/codegen/cosmos/group/v1/query.js +1769 -0
- package/module/codegen/cosmos/group/v1/query.lcd.js +167 -0
- package/module/codegen/cosmos/group/v1/query.rpc.query.js +104 -0
- package/module/codegen/cosmos/group/v1/tx.amino.js +429 -0
- package/module/codegen/cosmos/group/v1/tx.js +1969 -0
- package/module/codegen/cosmos/group/v1/tx.registry.js +509 -0
- package/module/codegen/cosmos/group/v1/tx.rpc.msg.js +111 -0
- package/module/codegen/cosmos/group/v1/types.js +1350 -0
- package/module/codegen/cosmos/lcd.js +50 -0
- package/module/codegen/cosmos/mint/v1beta1/genesis.js +73 -0
- package/module/codegen/cosmos/mint/v1beta1/mint.js +193 -0
- package/module/codegen/cosmos/mint/v1beta1/query.js +308 -0
- package/module/codegen/cosmos/mint/v1beta1/query.lcd.js +32 -0
- package/module/codegen/cosmos/mint/v1beta1/query.rpc.query.js +34 -0
- package/module/codegen/cosmos/msg/v1/msg.js +1 -0
- package/module/codegen/cosmos/nft/v1beta1/event.js +264 -0
- package/module/codegen/cosmos/nft/v1beta1/genesis.js +163 -0
- package/module/codegen/cosmos/nft/v1beta1/nft.js +242 -0
- package/module/codegen/cosmos/nft/v1beta1/query.js +917 -0
- package/module/codegen/cosmos/nft/v1beta1/query.lcd.js +88 -0
- package/module/codegen/cosmos/nft/v1beta1/query.rpc.query.js +62 -0
- package/module/codegen/cosmos/nft/v1beta1/tx.amino.js +31 -0
- package/module/codegen/cosmos/nft/v1beta1/tx.js +141 -0
- package/module/codegen/cosmos/nft/v1beta1/tx.registry.js +54 -0
- package/module/codegen/cosmos/nft/v1beta1/tx.rpc.msg.js +20 -0
- package/module/codegen/cosmos/orm/v1/orm.js +305 -0
- package/module/codegen/cosmos/orm/v1alpha1/schema.js +225 -0
- package/module/codegen/cosmos/params/v1beta1/params.js +175 -0
- package/module/codegen/cosmos/params/v1beta1/query.js +317 -0
- package/module/codegen/cosmos/params/v1beta1/query.lcd.js +38 -0
- package/module/codegen/cosmos/params/v1beta1/query.rpc.query.js +27 -0
- package/module/codegen/cosmos/rpc.query.js +34 -0
- package/module/codegen/cosmos/rpc.tx.js +25 -0
- package/module/codegen/cosmos/slashing/v1beta1/genesis.js +317 -0
- package/module/codegen/cosmos/slashing/v1beta1/query.js +355 -0
- package/module/codegen/cosmos/slashing/v1beta1/query.lcd.js +43 -0
- package/module/codegen/cosmos/slashing/v1beta1/query.rpc.query.js +34 -0
- package/module/codegen/cosmos/slashing/v1beta1/slashing.js +234 -0
- package/module/codegen/cosmos/slashing/v1beta1/tx.amino.js +19 -0
- package/module/codegen/cosmos/slashing/v1beta1/tx.js +105 -0
- package/module/codegen/cosmos/slashing/v1beta1/tx.registry.js +54 -0
- package/module/codegen/cosmos/slashing/v1beta1/tx.rpc.msg.js +20 -0
- package/module/codegen/cosmos/staking/v1beta1/authz.js +204 -0
- package/module/codegen/cosmos/staking/v1beta1/genesis.js +178 -0
- package/module/codegen/cosmos/staking/v1beta1/query.js +1469 -0
- package/module/codegen/cosmos/staking/v1beta1/query.lcd.js +196 -0
- package/module/codegen/cosmos/staking/v1beta1/query.rpc.query.js +174 -0
- package/module/codegen/cosmos/staking/v1beta1/staking.js +1446 -0
- package/module/codegen/cosmos/staking/v1beta1/tx.amino.js +216 -0
- package/module/codegen/cosmos/staking/v1beta1/tx.js +598 -0
- package/module/codegen/cosmos/staking/v1beta1/tx.registry.js +120 -0
- package/module/codegen/cosmos/staking/v1beta1/tx.rpc.msg.js +48 -0
- package/module/codegen/cosmos/tx/signing/v1beta1/signing.js +378 -0
- package/module/codegen/cosmos/tx/v1beta1/service.js +714 -0
- package/module/codegen/cosmos/tx/v1beta1/service.lcd.js +62 -0
- package/module/codegen/cosmos/tx/v1beta1/service.rpc.svc.js +75 -0
- package/module/codegen/cosmos/tx/v1beta1/tx.js +903 -0
- package/module/codegen/cosmos/upgrade/v1beta1/query.js +445 -0
- package/module/codegen/cosmos/upgrade/v1beta1/query.lcd.js +66 -0
- package/module/codegen/cosmos/upgrade/v1beta1/query.rpc.query.js +75 -0
- package/module/codegen/cosmos/upgrade/v1beta1/tx.amino.js +59 -0
- package/module/codegen/cosmos/upgrade/v1beta1/tx.js +174 -0
- package/module/codegen/cosmos/upgrade/v1beta1/tx.registry.js +57 -0
- package/module/codegen/cosmos/upgrade/v1beta1/tx.rpc.msg.js +27 -0
- package/module/codegen/cosmos/upgrade/v1beta1/upgrade.js +273 -0
- package/module/codegen/cosmos/vesting/v1beta1/tx.amino.js +114 -0
- package/module/codegen/cosmos/vesting/v1beta1/tx.js +440 -0
- package/module/codegen/cosmos/vesting/v1beta1/tx.registry.js +124 -0
- package/module/codegen/cosmos/vesting/v1beta1/tx.rpc.msg.js +34 -0
- package/module/codegen/cosmos/vesting/v1beta1/vesting.js +480 -0
- package/module/codegen/cosmos_proto/bundle.js +8 -0
- package/module/codegen/cosmos_proto/cosmos.js +194 -0
- package/module/codegen/cosmwasm/bundle.js +31 -0
- package/module/codegen/cosmwasm/client.js +39 -0
- package/module/codegen/cosmwasm/lcd.js +57 -0
- package/module/codegen/cosmwasm/rpc.query.js +39 -0
- package/module/codegen/cosmwasm/rpc.tx.js +30 -0
- package/module/codegen/cosmwasm/wasm/v1/genesis.js +358 -0
- package/module/codegen/cosmwasm/wasm/v1/ibc.js +127 -0
- package/module/codegen/cosmwasm/wasm/v1/proposal.js +772 -0
- package/module/codegen/cosmwasm/wasm/v1/query.js +1046 -0
- package/module/codegen/cosmwasm/wasm/v1/query.lcd.js +128 -0
- package/module/codegen/cosmwasm/wasm/v1/query.rpc.query.js +123 -0
- package/module/codegen/cosmwasm/wasm/v1/tx.amino.js +189 -0
- package/module/codegen/cosmwasm/wasm/v1/tx.js +711 -0
- package/module/codegen/cosmwasm/wasm/v1/tx.registry.js +141 -0
- package/module/codegen/cosmwasm/wasm/v1/tx.rpc.msg.js +55 -0
- package/module/codegen/cosmwasm/wasm/v1/types.js +668 -0
- package/module/codegen/gogoproto/bundle.js +8 -0
- package/module/codegen/gogoproto/gogo.js +1 -0
- package/module/codegen/google/api/annotations.js +1 -0
- package/module/codegen/google/api/http.js +328 -0
- package/module/codegen/google/bundle.js +19 -0
- package/module/codegen/google/protobuf/any.js +58 -0
- package/module/codegen/google/protobuf/descriptor.js +2775 -0
- package/module/codegen/google/protobuf/duration.js +119 -0
- package/module/codegen/google/protobuf/empty.js +35 -0
- package/module/codegen/google/protobuf/field_mask.js +48 -0
- package/module/codegen/google/protobuf/struct.js +310 -0
- package/module/codegen/google/protobuf/timestamp.js +143 -0
- package/module/codegen/google/protobuf/wrappers.js +426 -0
- package/module/codegen/ibc/applications/transfer/v1/genesis.js +69 -0
- package/module/codegen/ibc/applications/transfer/v1/query.js +276 -0
- package/module/codegen/ibc/applications/transfer/v1/query.lcd.js +46 -0
- package/module/codegen/ibc/applications/transfer/v1/query.rpc.query.js +55 -0
- package/module/codegen/ibc/applications/transfer/v1/transfer.js +115 -0
- package/module/codegen/ibc/applications/transfer/v1/tx.amino.js +58 -0
- package/module/codegen/ibc/applications/transfer/v1/tx.js +150 -0
- package/module/codegen/ibc/applications/transfer/v1/tx.registry.js +36 -0
- package/module/codegen/ibc/applications/transfer/v1/tx.rpc.msg.js +20 -0
- package/module/codegen/ibc/applications/transfer/v2/packet.js +78 -0
- package/module/codegen/ibc/bundle.js +120 -0
- package/module/codegen/ibc/client.js +45 -0
- package/module/codegen/ibc/core/channel/v1/channel.js +646 -0
- package/module/codegen/ibc/core/channel/v1/genesis.js +188 -0
- package/module/codegen/ibc/core/channel/v1/query.js +1759 -0
- package/module/codegen/ibc/core/channel/v1/query.lcd.js +162 -0
- package/module/codegen/ibc/core/channel/v1/query.rpc.query.js +165 -0
- package/module/codegen/ibc/core/channel/v1/tx.amino.js +530 -0
- package/module/codegen/ibc/core/channel/v1/tx.js +1218 -0
- package/module/codegen/ibc/core/channel/v1/tx.registry.js +225 -0
- package/module/codegen/ibc/core/channel/v1/tx.rpc.msg.js +83 -0
- package/module/codegen/ibc/core/client/v1/client.js +433 -0
- package/module/codegen/ibc/core/client/v1/genesis.js +215 -0
- package/module/codegen/ibc/core/client/v1/query.js +814 -0
- package/module/codegen/ibc/core/client/v1/query.lcd.js +104 -0
- package/module/codegen/ibc/core/client/v1/query.rpc.query.js +110 -0
- package/module/codegen/ibc/core/client/v1/tx.amino.js +150 -0
- package/module/codegen/ibc/core/client/v1/tx.js +436 -0
- package/module/codegen/ibc/core/client/v1/tx.registry.js +99 -0
- package/module/codegen/ibc/core/client/v1/tx.rpc.msg.js +41 -0
- package/module/codegen/ibc/core/commitment/v1/commitment.js +190 -0
- package/module/codegen/ibc/core/connection/v1/connection.js +537 -0
- package/module/codegen/ibc/core/connection/v1/genesis.js +81 -0
- package/module/codegen/ibc/core/connection/v1/query.js +608 -0
- package/module/codegen/ibc/core/connection/v1/query.lcd.js +65 -0
- package/module/codegen/ibc/core/connection/v1/query.rpc.query.js +77 -0
- package/module/codegen/ibc/core/connection/v1/tx.amino.js +269 -0
- package/module/codegen/ibc/core/connection/v1/tx.js +603 -0
- package/module/codegen/ibc/core/connection/v1/tx.registry.js +99 -0
- package/module/codegen/ibc/core/connection/v1/tx.rpc.msg.js +41 -0
- package/module/codegen/ibc/core/port/v1/query.js +182 -0
- package/module/codegen/ibc/core/port/v1/query.rpc.query.js +20 -0
- package/module/codegen/ibc/core/types/v1/genesis.js +87 -0
- package/module/codegen/ibc/lcd.js +76 -0
- package/module/codegen/ibc/lightclients/localhost/v1/localhost.js +59 -0
- package/module/codegen/ibc/lightclients/solomachine/v1/solomachine.js +1166 -0
- package/module/codegen/ibc/lightclients/solomachine/v2/solomachine.js +1166 -0
- package/module/codegen/ibc/lightclients/tendermint/v1/tendermint.js +424 -0
- package/module/codegen/ibc/rpc.query.js +52 -0
- package/module/codegen/ibc/rpc.tx.js +43 -0
- package/module/codegen/ics23/bundle.js +8 -0
- package/module/codegen/index.js +18 -0
- package/module/codegen/juno/bundle.js +20 -0
- package/module/codegen/juno/lcd.js +55 -0
- package/module/codegen/juno/mint/genesis.js +57 -0
- package/module/codegen/juno/mint/mint.js +137 -0
- package/module/codegen/juno/mint/query.js +243 -0
- package/module/codegen/juno/mint/query.lcd.js +35 -0
- package/module/codegen/juno/mint/query.rpc.query.js +53 -0
- package/module/codegen/juno/rpc.query.js +37 -0
- package/module/codegen/tendermint/abci/types.js +3341 -0
- package/module/codegen/tendermint/bundle.js +36 -0
- package/module/codegen/tendermint/crypto/keys.js +58 -0
- package/module/codegen/tendermint/crypto/proof.js +317 -0
- package/module/codegen/tendermint/libs/bits/types.js +71 -0
- package/module/codegen/tendermint/p2p/types.js +386 -0
- package/module/codegen/tendermint/types/block.js +78 -0
- package/module/codegen/tendermint/types/evidence.js +281 -0
- package/module/codegen/tendermint/types/params.js +361 -0
- package/module/codegen/tendermint/types/types.js +1172 -0
- package/module/codegen/tendermint/types/validator.js +202 -0
- package/module/codegen/tendermint/version/types.js +119 -0
- package/module/index.js +1 -0
- package/package.json +8 -3
- package/src/codegen/JunoSwap.client.ts +299 -0
- package/src/codegen/JunoSwap.types.ts +143 -0
- package/src/codegen/confio/proofs.ts +1521 -0
- package/src/codegen/contracts.ts +13 -0
- package/src/codegen/cosmos/app/v1alpha1/config.ts +172 -0
- package/src/codegen/cosmos/app/v1alpha1/module.ts +308 -0
- package/src/codegen/cosmos/app/v1alpha1/query.rpc.query.ts +26 -0
- package/src/codegen/cosmos/app/v1alpha1/query.ts +112 -0
- package/src/codegen/cosmos/auth/v1beta1/auth.ts +316 -0
- package/src/codegen/cosmos/auth/v1beta1/genesis.ts +88 -0
- package/src/codegen/cosmos/auth/v1beta1/query.lcd.ts +72 -0
- package/src/codegen/cosmos/auth/v1beta1/query.rpc.query.ts +90 -0
- package/src/codegen/cosmos/auth/v1beta1/query.ts +865 -0
- package/src/codegen/cosmos/authz/v1beta1/authz.ts +306 -0
- package/src/codegen/cosmos/authz/v1beta1/event.ts +180 -0
- package/src/codegen/cosmos/authz/v1beta1/genesis.ts +58 -0
- package/src/codegen/cosmos/authz/v1beta1/query.lcd.ts +79 -0
- package/src/codegen/cosmos/authz/v1beta1/query.rpc.query.ts +68 -0
- package/src/codegen/cosmos/authz/v1beta1/query.ts +464 -0
- package/src/codegen/cosmos/authz/v1beta1/tx.amino.ts +131 -0
- package/src/codegen/cosmos/authz/v1beta1/tx.registry.ts +127 -0
- package/src/codegen/cosmos/authz/v1beta1/tx.rpc.msg.ts +51 -0
- package/src/codegen/cosmos/authz/v1beta1/tx.ts +396 -0
- package/src/codegen/cosmos/bank/v1beta1/authz.ts +68 -0
- package/src/codegen/cosmos/bank/v1beta1/bank.ts +666 -0
- package/src/codegen/cosmos/bank/v1beta1/genesis.ts +194 -0
- package/src/codegen/cosmos/bank/v1beta1/query.lcd.ts +150 -0
- package/src/codegen/cosmos/bank/v1beta1/query.rpc.query.ts +155 -0
- package/src/codegen/cosmos/bank/v1beta1/query.ts +1301 -0
- package/src/codegen/cosmos/bank/v1beta1/tx.amino.ts +110 -0
- package/src/codegen/cosmos/bank/v1beta1/tx.registry.ts +58 -0
- package/src/codegen/cosmos/bank/v1beta1/tx.rpc.msg.ts +35 -0
- package/src/codegen/cosmos/bank/v1beta1/tx.ts +230 -0
- package/src/codegen/cosmos/base/abci/v1beta1/abci.ts +1106 -0
- package/src/codegen/cosmos/base/kv/v1beta1/kv.ts +145 -0
- package/src/codegen/cosmos/base/query/v1beta1/pagination.ts +282 -0
- package/src/codegen/cosmos/base/reflection/v1beta1/reflection.ts +254 -0
- package/src/codegen/cosmos/base/reflection/v2alpha1/reflection.ts +1708 -0
- package/src/codegen/cosmos/base/snapshots/v1beta1/snapshot.ts +759 -0
- package/src/codegen/cosmos/base/store/v1beta1/commit_info.ts +242 -0
- package/src/codegen/cosmos/base/store/v1beta1/listening.ts +112 -0
- package/src/codegen/cosmos/base/tendermint/v1beta1/query.lcd.ts +74 -0
- package/src/codegen/cosmos/base/tendermint/v1beta1/query.rpc.svc.ts +80 -0
- package/src/codegen/cosmos/base/tendermint/v1beta1/query.ts +1181 -0
- package/src/codegen/cosmos/base/v1beta1/coin.ts +266 -0
- package/src/codegen/cosmos/bundle.ts +214 -0
- package/src/codegen/cosmos/capability/v1beta1/capability.ts +216 -0
- package/src/codegen/cosmos/capability/v1beta1/genesis.ts +168 -0
- package/src/codegen/cosmos/client.ts +51 -0
- package/src/codegen/cosmos/crisis/v1beta1/genesis.ts +69 -0
- package/src/codegen/cosmos/crisis/v1beta1/tx.amino.ts +37 -0
- package/src/codegen/cosmos/crisis/v1beta1/tx.registry.ts +55 -0
- package/src/codegen/cosmos/crisis/v1beta1/tx.rpc.msg.ts +25 -0
- package/src/codegen/cosmos/crisis/v1beta1/tx.ts +136 -0
- package/src/codegen/cosmos/crypto/ed25519/keys.ts +130 -0
- package/src/codegen/cosmos/crypto/hd/v1/hd.ts +129 -0
- package/src/codegen/cosmos/crypto/keyring/v1/record.ts +349 -0
- package/src/codegen/cosmos/crypto/multisig/keys.ts +78 -0
- package/src/codegen/cosmos/crypto/multisig/v1beta1/multisig.ts +142 -0
- package/src/codegen/cosmos/crypto/secp256k1/keys.ts +124 -0
- package/src/codegen/cosmos/crypto/secp256r1/keys.ts +122 -0
- package/src/codegen/cosmos/distribution/v1beta1/distribution.ts +945 -0
- package/src/codegen/cosmos/distribution/v1beta1/genesis.ts +800 -0
- package/src/codegen/cosmos/distribution/v1beta1/query.lcd.ts +104 -0
- package/src/codegen/cosmos/distribution/v1beta1/query.rpc.query.ts +149 -0
- package/src/codegen/cosmos/distribution/v1beta1/query.ts +1187 -0
- package/src/codegen/cosmos/distribution/v1beta1/tx.amino.ts +120 -0
- package/src/codegen/cosmos/distribution/v1beta1/tx.registry.ts +100 -0
- package/src/codegen/cosmos/distribution/v1beta1/tx.rpc.msg.ts +59 -0
- package/src/codegen/cosmos/distribution/v1beta1/tx.ts +473 -0
- package/src/codegen/cosmos/evidence/v1beta1/evidence.ts +107 -0
- package/src/codegen/cosmos/evidence/v1beta1/genesis.ts +72 -0
- package/src/codegen/cosmos/evidence/v1beta1/query.lcd.ts +39 -0
- package/src/codegen/cosmos/evidence/v1beta1/query.rpc.query.ts +37 -0
- package/src/codegen/cosmos/evidence/v1beta1/query.ts +283 -0
- package/src/codegen/cosmos/evidence/v1beta1/tx.amino.ts +42 -0
- package/src/codegen/cosmos/evidence/v1beta1/tx.registry.ts +56 -0
- package/src/codegen/cosmos/evidence/v1beta1/tx.rpc.msg.ts +27 -0
- package/src/codegen/cosmos/evidence/v1beta1/tx.ts +144 -0
- package/src/codegen/cosmos/feegrant/v1beta1/feegrant.ts +421 -0
- package/src/codegen/cosmos/feegrant/v1beta1/genesis.ts +71 -0
- package/src/codegen/cosmos/feegrant/v1beta1/query.lcd.ts +52 -0
- package/src/codegen/cosmos/feegrant/v1beta1/query.rpc.query.ts +48 -0
- package/src/codegen/cosmos/feegrant/v1beta1/query.ts +467 -0
- package/src/codegen/cosmos/feegrant/v1beta1/tx.amino.ts +75 -0
- package/src/codegen/cosmos/feegrant/v1beta1/tx.registry.ts +91 -0
- package/src/codegen/cosmos/feegrant/v1beta1/tx.rpc.msg.ts +38 -0
- package/src/codegen/cosmos/feegrant/v1beta1/tx.ts +269 -0
- package/src/codegen/cosmos/genutil/v1beta1/genesis.ts +71 -0
- package/src/codegen/cosmos/gov/v1/genesis.ts +156 -0
- package/src/codegen/cosmos/gov/v1/gov.ts +983 -0
- package/src/codegen/cosmos/gov/v1/query.lcd.ts +115 -0
- package/src/codegen/cosmos/gov/v1/query.rpc.query.ts +134 -0
- package/src/codegen/cosmos/gov/v1/query.ts +1114 -0
- package/src/codegen/cosmos/gov/v1/tx.amino.ts +226 -0
- package/src/codegen/cosmos/gov/v1/tx.registry.ts +121 -0
- package/src/codegen/cosmos/gov/v1/tx.rpc.msg.ts +66 -0
- package/src/codegen/cosmos/gov/v1/tx.ts +661 -0
- package/src/codegen/cosmos/gov/v1beta1/genesis.ts +156 -0
- package/src/codegen/cosmos/gov/v1beta1/gov.ts +1064 -0
- package/src/codegen/cosmos/gov/v1beta1/query.lcd.ts +115 -0
- package/src/codegen/cosmos/gov/v1beta1/query.rpc.query.ts +134 -0
- package/src/codegen/cosmos/gov/v1beta1/query.ts +1114 -0
- package/src/codegen/cosmos/gov/v1beta1/tx.amino.ts +174 -0
- package/src/codegen/cosmos/gov/v1beta1/tx.registry.ts +100 -0
- package/src/codegen/cosmos/gov/v1beta1/tx.rpc.msg.ts +57 -0
- package/src/codegen/cosmos/gov/v1beta1/tx.ts +518 -0
- package/src/codegen/cosmos/group/v1/events.ts +600 -0
- package/src/codegen/cosmos/group/v1/genesis.ts +208 -0
- package/src/codegen/cosmos/group/v1/query.lcd.ts +159 -0
- package/src/codegen/cosmos/group/v1/query.rpc.query.ts +147 -0
- package/src/codegen/cosmos/group/v1/query.ts +1945 -0
- package/src/codegen/cosmos/group/v1/tx.amino.ts +585 -0
- package/src/codegen/cosmos/group/v1/tx.registry.ts +512 -0
- package/src/codegen/cosmos/group/v1/tx.rpc.msg.ts +157 -0
- package/src/codegen/cosmos/group/v1/tx.ts +2197 -0
- package/src/codegen/cosmos/group/v1/types.ts +1577 -0
- package/src/codegen/cosmos/lcd.ts +52 -0
- package/src/codegen/cosmos/mint/v1beta1/genesis.ts +81 -0
- package/src/codegen/cosmos/mint/v1beta1/mint.ts +218 -0
- package/src/codegen/cosmos/mint/v1beta1/query.lcd.ts +33 -0
- package/src/codegen/cosmos/mint/v1beta1/query.rpc.query.ts +46 -0
- package/src/codegen/cosmos/mint/v1beta1/query.ts +339 -0
- package/src/codegen/cosmos/msg/v1/msg.ts +1 -0
- package/src/codegen/cosmos/nft/v1beta1/event.ts +279 -0
- package/src/codegen/cosmos/nft/v1beta1/genesis.ts +174 -0
- package/src/codegen/cosmos/nft/v1beta1/nft.ts +279 -0
- package/src/codegen/cosmos/nft/v1beta1/query.lcd.ts +86 -0
- package/src/codegen/cosmos/nft/v1beta1/query.rpc.query.ts +88 -0
- package/src/codegen/cosmos/nft/v1beta1/query.ts +976 -0
- package/src/codegen/cosmos/nft/v1beta1/tx.amino.ts +42 -0
- package/src/codegen/cosmos/nft/v1beta1/tx.registry.ts +55 -0
- package/src/codegen/cosmos/nft/v1beta1/tx.rpc.msg.ts +25 -0
- package/src/codegen/cosmos/nft/v1beta1/tx.ts +156 -0
- package/src/codegen/cosmos/orm/v1/orm.ts +392 -0
- package/src/codegen/cosmos/orm/v1alpha1/schema.ts +289 -0
- package/src/codegen/cosmos/params/v1beta1/params.ts +187 -0
- package/src/codegen/cosmos/params/v1beta1/query.lcd.ts +40 -0
- package/src/codegen/cosmos/params/v1beta1/query.rpc.query.ts +37 -0
- package/src/codegen/cosmos/params/v1beta1/query.ts +348 -0
- package/src/codegen/cosmos/rpc.query.ts +36 -0
- package/src/codegen/cosmos/rpc.tx.ts +28 -0
- package/src/codegen/cosmos/slashing/v1beta1/genesis.ts +356 -0
- package/src/codegen/cosmos/slashing/v1beta1/query.lcd.ts +45 -0
- package/src/codegen/cosmos/slashing/v1beta1/query.rpc.query.ts +47 -0
- package/src/codegen/cosmos/slashing/v1beta1/query.ts +394 -0
- package/src/codegen/cosmos/slashing/v1beta1/slashing.ts +268 -0
- package/src/codegen/cosmos/slashing/v1beta1/tx.amino.ts +27 -0
- package/src/codegen/cosmos/slashing/v1beta1/tx.registry.ts +55 -0
- package/src/codegen/cosmos/slashing/v1beta1/tx.rpc.msg.ts +27 -0
- package/src/codegen/cosmos/slashing/v1beta1/tx.ts +110 -0
- package/src/codegen/cosmos/staking/v1beta1/authz.ts +265 -0
- package/src/codegen/cosmos/staking/v1beta1/genesis.ts +253 -0
- package/src/codegen/cosmos/staking/v1beta1/query.lcd.ts +199 -0
- package/src/codegen/cosmos/staking/v1beta1/query.rpc.query.ts +222 -0
- package/src/codegen/cosmos/staking/v1beta1/query.ts +1970 -0
- package/src/codegen/cosmos/staking/v1beta1/staking.ts +1957 -0
- package/src/codegen/cosmos/staking/v1beta1/tx.amino.ts +294 -0
- package/src/codegen/cosmos/staking/v1beta1/tx.registry.ts +121 -0
- package/src/codegen/cosmos/staking/v1beta1/tx.rpc.msg.ts +68 -0
- package/src/codegen/cosmos/staking/v1beta1/tx.ts +735 -0
- package/src/codegen/cosmos/tx/signing/v1beta1/signing.ts +528 -0
- package/src/codegen/cosmos/tx/v1beta1/service.lcd.ts +65 -0
- package/src/codegen/cosmos/tx/v1beta1/service.rpc.svc.ts +94 -0
- package/src/codegen/cosmos/tx/v1beta1/service.ts +984 -0
- package/src/codegen/cosmos/tx/v1beta1/tx.ts +1497 -0
- package/src/codegen/cosmos/upgrade/v1beta1/query.lcd.ts +69 -0
- package/src/codegen/cosmos/upgrade/v1beta1/query.rpc.query.ts +99 -0
- package/src/codegen/cosmos/upgrade/v1beta1/query.ts +631 -0
- package/src/codegen/cosmos/upgrade/v1beta1/tx.amino.ts +86 -0
- package/src/codegen/cosmos/upgrade/v1beta1/tx.registry.ts +58 -0
- package/src/codegen/cosmos/upgrade/v1beta1/tx.rpc.msg.ts +40 -0
- package/src/codegen/cosmos/upgrade/v1beta1/tx.ts +245 -0
- package/src/codegen/cosmos/upgrade/v1beta1/upgrade.ts +432 -0
- package/src/codegen/cosmos/vesting/v1beta1/tx.amino.ts +157 -0
- package/src/codegen/cosmos/vesting/v1beta1/tx.registry.ts +127 -0
- package/src/codegen/cosmos/vesting/v1beta1/tx.rpc.msg.ts +50 -0
- package/src/codegen/cosmos/vesting/v1beta1/tx.ts +475 -0
- package/src/codegen/cosmos/vesting/v1beta1/vesting.ts +527 -0
- package/src/codegen/cosmos_proto/bundle.ts +3 -0
- package/src/codegen/cosmos_proto/cosmos.ts +289 -0
- package/src/codegen/cosmwasm/bundle.ts +34 -0
- package/src/codegen/cosmwasm/client.ts +44 -0
- package/src/codegen/cosmwasm/lcd.ts +59 -0
- package/src/codegen/cosmwasm/rpc.query.ts +41 -0
- package/src/codegen/cosmwasm/rpc.tx.ts +33 -0
- package/src/codegen/cosmwasm/wasm/v1/genesis.ts +433 -0
- package/src/codegen/cosmwasm/wasm/v1/ibc.ts +180 -0
- package/src/codegen/cosmwasm/wasm/v1/proposal.ts +1083 -0
- package/src/codegen/cosmwasm/wasm/v1/query.lcd.ts +131 -0
- package/src/codegen/cosmwasm/wasm/v1/query.rpc.query.ts +152 -0
- package/src/codegen/cosmwasm/wasm/v1/query.ts +1378 -0
- package/src/codegen/cosmwasm/wasm/v1/tx.amino.ts +252 -0
- package/src/codegen/cosmwasm/wasm/v1/tx.registry.ts +142 -0
- package/src/codegen/cosmwasm/wasm/v1/tx.rpc.msg.ts +75 -0
- package/src/codegen/cosmwasm/wasm/v1/tx.ts +944 -0
- package/src/codegen/cosmwasm/wasm/v1/types.ts +861 -0
- package/src/codegen/gogoproto/bundle.ts +3 -0
- package/src/codegen/gogoproto/gogo.ts +1 -0
- package/src/codegen/google/api/annotations.ts +1 -0
- package/src/codegen/google/api/http.ts +683 -0
- package/src/codegen/google/bundle.ts +19 -0
- package/src/codegen/google/protobuf/any.ts +291 -0
- package/src/codegen/google/protobuf/descriptor.ts +4317 -0
- package/src/codegen/google/protobuf/duration.ts +215 -0
- package/src/codegen/google/protobuf/empty.ts +62 -0
- package/src/codegen/google/protobuf/field_mask.ts +459 -0
- package/src/codegen/google/protobuf/struct.ts +420 -0
- package/src/codegen/google/protobuf/timestamp.ts +259 -0
- package/src/codegen/google/protobuf/wrappers.ts +587 -0
- package/src/codegen/ibc/applications/transfer/v1/genesis.ts +82 -0
- package/src/codegen/ibc/applications/transfer/v1/query.lcd.ts +49 -0
- package/src/codegen/ibc/applications/transfer/v1/query.rpc.query.ts +66 -0
- package/src/codegen/ibc/applications/transfer/v1/query.ts +369 -0
- package/src/codegen/ibc/applications/transfer/v1/transfer.ts +182 -0
- package/src/codegen/ibc/applications/transfer/v1/tx.amino.ts +73 -0
- package/src/codegen/ibc/applications/transfer/v1/tx.registry.ts +37 -0
- package/src/codegen/ibc/applications/transfer/v1/tx.rpc.msg.ts +25 -0
- package/src/codegen/ibc/applications/transfer/v1/tx.ts +217 -0
- package/src/codegen/ibc/applications/transfer/v2/packet.ts +115 -0
- package/src/codegen/ibc/bundle.ts +125 -0
- package/src/codegen/ibc/client.ts +53 -0
- package/src/codegen/ibc/core/channel/v1/channel.ts +923 -0
- package/src/codegen/ibc/core/channel/v1/genesis.ts +231 -0
- package/src/codegen/ibc/core/channel/v1/query.lcd.ts +165 -0
- package/src/codegen/ibc/core/channel/v1/query.rpc.query.ts +214 -0
- package/src/codegen/ibc/core/channel/v1/query.ts +2444 -0
- package/src/codegen/ibc/core/channel/v1/tx.amino.ts +670 -0
- package/src/codegen/ibc/core/channel/v1/tx.registry.ts +226 -0
- package/src/codegen/ibc/core/channel/v1/tx.rpc.msg.ts +116 -0
- package/src/codegen/ibc/core/channel/v1/tx.ts +1492 -0
- package/src/codegen/ibc/core/client/v1/client.ts +629 -0
- package/src/codegen/ibc/core/client/v1/genesis.ts +288 -0
- package/src/codegen/ibc/core/client/v1/query.lcd.ts +107 -0
- package/src/codegen/ibc/core/client/v1/query.rpc.query.ts +138 -0
- package/src/codegen/ibc/core/client/v1/query.ts +1130 -0
- package/src/codegen/ibc/core/client/v1/tx.amino.ts +205 -0
- package/src/codegen/ibc/core/client/v1/tx.registry.ts +100 -0
- package/src/codegen/ibc/core/client/v1/tx.rpc.msg.ts +55 -0
- package/src/codegen/ibc/core/client/v1/tx.ts +603 -0
- package/src/codegen/ibc/core/commitment/v1/commitment.ts +257 -0
- package/src/codegen/ibc/core/connection/v1/connection.ts +758 -0
- package/src/codegen/ibc/core/connection/v1/genesis.ts +98 -0
- package/src/codegen/ibc/core/connection/v1/query.lcd.ts +68 -0
- package/src/codegen/ibc/core/connection/v1/query.rpc.query.ts +97 -0
- package/src/codegen/ibc/core/connection/v1/query.ts +836 -0
- package/src/codegen/ibc/core/connection/v1/tx.amino.ts +343 -0
- package/src/codegen/ibc/core/connection/v1/tx.registry.ts +100 -0
- package/src/codegen/ibc/core/connection/v1/tx.rpc.msg.ts +56 -0
- package/src/codegen/ibc/core/connection/v1/tx.ts +795 -0
- package/src/codegen/ibc/core/port/v1/query.rpc.query.ts +26 -0
- package/src/codegen/ibc/core/port/v1/query.ts +204 -0
- package/src/codegen/ibc/core/types/v1/genesis.ts +98 -0
- package/src/codegen/ibc/lcd.ts +78 -0
- package/src/codegen/ibc/lightclients/localhost/v1/localhost.ts +82 -0
- package/src/codegen/ibc/lightclients/solomachine/v1/solomachine.ts +1499 -0
- package/src/codegen/ibc/lightclients/solomachine/v2/solomachine.ts +1499 -0
- package/src/codegen/ibc/lightclients/tendermint/v1/tendermint.ts +626 -0
- package/src/codegen/ibc/rpc.query.ts +54 -0
- package/src/codegen/ibc/rpc.tx.ts +46 -0
- package/src/codegen/ics23/bundle.ts +3 -0
- package/src/codegen/index.ts +19 -0
- package/src/codegen/juno/bundle.ts +18 -0
- package/src/codegen/juno/lcd.ts +57 -0
- package/src/codegen/juno/mint/genesis.ts +76 -0
- package/src/codegen/juno/mint/mint.ts +172 -0
- package/src/codegen/juno/mint/query.lcd.ts +38 -0
- package/src/codegen/juno/mint/query.rpc.query.ts +64 -0
- package/src/codegen/juno/mint/query.ts +312 -0
- package/src/codegen/juno/rpc.query.ts +39 -0
- package/src/codegen/tendermint/abci/types.ts +3943 -0
- package/src/codegen/tendermint/bundle.ts +32 -0
- package/src/codegen/tendermint/crypto/keys.ts +69 -0
- package/src/codegen/tendermint/crypto/proof.ts +375 -0
- package/src/codegen/tendermint/libs/bits/types.ts +77 -0
- package/src/codegen/tendermint/p2p/types.ts +438 -0
- package/src/codegen/tendermint/types/block.ts +91 -0
- package/src/codegen/tendermint/types/evidence.ts +325 -0
- package/src/codegen/tendermint/types/params.ts +521 -0
- package/src/codegen/tendermint/types/types.ts +1399 -0
- package/src/codegen/tendermint/types/validator.ts +228 -0
- package/src/codegen/tendermint/version/types.ts +152 -0
- package/src/index.ts +1 -0
- package/types/codegen/JunoSwap.client.d.ts +29 -27
- package/types/codegen/JunoSwap.types.d.ts +43 -25
@@ -0,0 +1,1521 @@
|
|
1
|
+
import * as _m0 from "protobufjs/minimal";
|
2
|
+
import { DeepPartial } from "@osmonauts/helpers";
|
3
|
+
export enum HashOp {
|
4
|
+
/** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
|
5
|
+
NO_HASH = 0,
|
6
|
+
SHA256 = 1,
|
7
|
+
SHA512 = 2,
|
8
|
+
KECCAK = 3,
|
9
|
+
RIPEMD160 = 4,
|
10
|
+
|
11
|
+
/** BITCOIN - ripemd160(sha256(x)) */
|
12
|
+
BITCOIN = 5,
|
13
|
+
UNRECOGNIZED = -1,
|
14
|
+
}
|
15
|
+
export enum HashOpSDKType {
|
16
|
+
/** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
|
17
|
+
NO_HASH = 0,
|
18
|
+
SHA256 = 1,
|
19
|
+
SHA512 = 2,
|
20
|
+
KECCAK = 3,
|
21
|
+
RIPEMD160 = 4,
|
22
|
+
|
23
|
+
/** BITCOIN - ripemd160(sha256(x)) */
|
24
|
+
BITCOIN = 5,
|
25
|
+
UNRECOGNIZED = -1,
|
26
|
+
}
|
27
|
+
export function hashOpFromJSON(object: any): HashOp {
|
28
|
+
switch (object) {
|
29
|
+
case 0:
|
30
|
+
case "NO_HASH":
|
31
|
+
return HashOp.NO_HASH;
|
32
|
+
|
33
|
+
case 1:
|
34
|
+
case "SHA256":
|
35
|
+
return HashOp.SHA256;
|
36
|
+
|
37
|
+
case 2:
|
38
|
+
case "SHA512":
|
39
|
+
return HashOp.SHA512;
|
40
|
+
|
41
|
+
case 3:
|
42
|
+
case "KECCAK":
|
43
|
+
return HashOp.KECCAK;
|
44
|
+
|
45
|
+
case 4:
|
46
|
+
case "RIPEMD160":
|
47
|
+
return HashOp.RIPEMD160;
|
48
|
+
|
49
|
+
case 5:
|
50
|
+
case "BITCOIN":
|
51
|
+
return HashOp.BITCOIN;
|
52
|
+
|
53
|
+
case -1:
|
54
|
+
case "UNRECOGNIZED":
|
55
|
+
default:
|
56
|
+
return HashOp.UNRECOGNIZED;
|
57
|
+
}
|
58
|
+
}
|
59
|
+
export function hashOpToJSON(object: HashOp): string {
|
60
|
+
switch (object) {
|
61
|
+
case HashOp.NO_HASH:
|
62
|
+
return "NO_HASH";
|
63
|
+
|
64
|
+
case HashOp.SHA256:
|
65
|
+
return "SHA256";
|
66
|
+
|
67
|
+
case HashOp.SHA512:
|
68
|
+
return "SHA512";
|
69
|
+
|
70
|
+
case HashOp.KECCAK:
|
71
|
+
return "KECCAK";
|
72
|
+
|
73
|
+
case HashOp.RIPEMD160:
|
74
|
+
return "RIPEMD160";
|
75
|
+
|
76
|
+
case HashOp.BITCOIN:
|
77
|
+
return "BITCOIN";
|
78
|
+
|
79
|
+
default:
|
80
|
+
return "UNKNOWN";
|
81
|
+
}
|
82
|
+
}
|
83
|
+
/**
|
84
|
+
* LengthOp defines how to process the key and value of the LeafOp
|
85
|
+
* to include length information. After encoding the length with the given
|
86
|
+
* algorithm, the length will be prepended to the key and value bytes.
|
87
|
+
* (Each one with it's own encoded length)
|
88
|
+
*/
|
89
|
+
|
90
|
+
export enum LengthOp {
|
91
|
+
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
92
|
+
NO_PREFIX = 0,
|
93
|
+
|
94
|
+
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
95
|
+
VAR_PROTO = 1,
|
96
|
+
|
97
|
+
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
98
|
+
VAR_RLP = 2,
|
99
|
+
|
100
|
+
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
101
|
+
FIXED32_BIG = 3,
|
102
|
+
|
103
|
+
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
104
|
+
FIXED32_LITTLE = 4,
|
105
|
+
|
106
|
+
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
107
|
+
FIXED64_BIG = 5,
|
108
|
+
|
109
|
+
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
110
|
+
FIXED64_LITTLE = 6,
|
111
|
+
|
112
|
+
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
113
|
+
REQUIRE_32_BYTES = 7,
|
114
|
+
|
115
|
+
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
116
|
+
REQUIRE_64_BYTES = 8,
|
117
|
+
UNRECOGNIZED = -1,
|
118
|
+
}
|
119
|
+
/**
|
120
|
+
* LengthOp defines how to process the key and value of the LeafOp
|
121
|
+
* to include length information. After encoding the length with the given
|
122
|
+
* algorithm, the length will be prepended to the key and value bytes.
|
123
|
+
* (Each one with it's own encoded length)
|
124
|
+
*/
|
125
|
+
|
126
|
+
export enum LengthOpSDKType {
|
127
|
+
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
128
|
+
NO_PREFIX = 0,
|
129
|
+
|
130
|
+
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
131
|
+
VAR_PROTO = 1,
|
132
|
+
|
133
|
+
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
134
|
+
VAR_RLP = 2,
|
135
|
+
|
136
|
+
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
137
|
+
FIXED32_BIG = 3,
|
138
|
+
|
139
|
+
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
140
|
+
FIXED32_LITTLE = 4,
|
141
|
+
|
142
|
+
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
143
|
+
FIXED64_BIG = 5,
|
144
|
+
|
145
|
+
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
146
|
+
FIXED64_LITTLE = 6,
|
147
|
+
|
148
|
+
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
149
|
+
REQUIRE_32_BYTES = 7,
|
150
|
+
|
151
|
+
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
152
|
+
REQUIRE_64_BYTES = 8,
|
153
|
+
UNRECOGNIZED = -1,
|
154
|
+
}
|
155
|
+
export function lengthOpFromJSON(object: any): LengthOp {
|
156
|
+
switch (object) {
|
157
|
+
case 0:
|
158
|
+
case "NO_PREFIX":
|
159
|
+
return LengthOp.NO_PREFIX;
|
160
|
+
|
161
|
+
case 1:
|
162
|
+
case "VAR_PROTO":
|
163
|
+
return LengthOp.VAR_PROTO;
|
164
|
+
|
165
|
+
case 2:
|
166
|
+
case "VAR_RLP":
|
167
|
+
return LengthOp.VAR_RLP;
|
168
|
+
|
169
|
+
case 3:
|
170
|
+
case "FIXED32_BIG":
|
171
|
+
return LengthOp.FIXED32_BIG;
|
172
|
+
|
173
|
+
case 4:
|
174
|
+
case "FIXED32_LITTLE":
|
175
|
+
return LengthOp.FIXED32_LITTLE;
|
176
|
+
|
177
|
+
case 5:
|
178
|
+
case "FIXED64_BIG":
|
179
|
+
return LengthOp.FIXED64_BIG;
|
180
|
+
|
181
|
+
case 6:
|
182
|
+
case "FIXED64_LITTLE":
|
183
|
+
return LengthOp.FIXED64_LITTLE;
|
184
|
+
|
185
|
+
case 7:
|
186
|
+
case "REQUIRE_32_BYTES":
|
187
|
+
return LengthOp.REQUIRE_32_BYTES;
|
188
|
+
|
189
|
+
case 8:
|
190
|
+
case "REQUIRE_64_BYTES":
|
191
|
+
return LengthOp.REQUIRE_64_BYTES;
|
192
|
+
|
193
|
+
case -1:
|
194
|
+
case "UNRECOGNIZED":
|
195
|
+
default:
|
196
|
+
return LengthOp.UNRECOGNIZED;
|
197
|
+
}
|
198
|
+
}
|
199
|
+
export function lengthOpToJSON(object: LengthOp): string {
|
200
|
+
switch (object) {
|
201
|
+
case LengthOp.NO_PREFIX:
|
202
|
+
return "NO_PREFIX";
|
203
|
+
|
204
|
+
case LengthOp.VAR_PROTO:
|
205
|
+
return "VAR_PROTO";
|
206
|
+
|
207
|
+
case LengthOp.VAR_RLP:
|
208
|
+
return "VAR_RLP";
|
209
|
+
|
210
|
+
case LengthOp.FIXED32_BIG:
|
211
|
+
return "FIXED32_BIG";
|
212
|
+
|
213
|
+
case LengthOp.FIXED32_LITTLE:
|
214
|
+
return "FIXED32_LITTLE";
|
215
|
+
|
216
|
+
case LengthOp.FIXED64_BIG:
|
217
|
+
return "FIXED64_BIG";
|
218
|
+
|
219
|
+
case LengthOp.FIXED64_LITTLE:
|
220
|
+
return "FIXED64_LITTLE";
|
221
|
+
|
222
|
+
case LengthOp.REQUIRE_32_BYTES:
|
223
|
+
return "REQUIRE_32_BYTES";
|
224
|
+
|
225
|
+
case LengthOp.REQUIRE_64_BYTES:
|
226
|
+
return "REQUIRE_64_BYTES";
|
227
|
+
|
228
|
+
default:
|
229
|
+
return "UNKNOWN";
|
230
|
+
}
|
231
|
+
}
|
232
|
+
/**
|
233
|
+
* ExistenceProof takes a key and a value and a set of steps to perform on it.
|
234
|
+
* The result of peforming all these steps will provide a "root hash", which can
|
235
|
+
* be compared to the value in a header.
|
236
|
+
*
|
237
|
+
* Since it is computationally infeasible to produce a hash collission for any of the used
|
238
|
+
* cryptographic hash functions, if someone can provide a series of operations to transform
|
239
|
+
* a given key and value into a root hash that matches some trusted root, these key and values
|
240
|
+
* must be in the referenced merkle tree.
|
241
|
+
*
|
242
|
+
* The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
|
243
|
+
* which should be controlled by a spec. Eg. with lengthOp as NONE,
|
244
|
+
* prefix = FOO, key = BAR, value = CHOICE
|
245
|
+
* and
|
246
|
+
* prefix = F, key = OOBAR, value = CHOICE
|
247
|
+
* would produce the same value.
|
248
|
+
*
|
249
|
+
* With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
|
250
|
+
* in the ProofSpec is valuable to prevent this mutability. And why all trees should
|
251
|
+
* length-prefix the data before hashing it.
|
252
|
+
*/
|
253
|
+
|
254
|
+
export interface ExistenceProof {
|
255
|
+
key: Uint8Array;
|
256
|
+
value: Uint8Array;
|
257
|
+
leaf: LeafOp;
|
258
|
+
path: InnerOp[];
|
259
|
+
}
|
260
|
+
/**
|
261
|
+
* ExistenceProof takes a key and a value and a set of steps to perform on it.
|
262
|
+
* The result of peforming all these steps will provide a "root hash", which can
|
263
|
+
* be compared to the value in a header.
|
264
|
+
*
|
265
|
+
* Since it is computationally infeasible to produce a hash collission for any of the used
|
266
|
+
* cryptographic hash functions, if someone can provide a series of operations to transform
|
267
|
+
* a given key and value into a root hash that matches some trusted root, these key and values
|
268
|
+
* must be in the referenced merkle tree.
|
269
|
+
*
|
270
|
+
* The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
|
271
|
+
* which should be controlled by a spec. Eg. with lengthOp as NONE,
|
272
|
+
* prefix = FOO, key = BAR, value = CHOICE
|
273
|
+
* and
|
274
|
+
* prefix = F, key = OOBAR, value = CHOICE
|
275
|
+
* would produce the same value.
|
276
|
+
*
|
277
|
+
* With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
|
278
|
+
* in the ProofSpec is valuable to prevent this mutability. And why all trees should
|
279
|
+
* length-prefix the data before hashing it.
|
280
|
+
*/
|
281
|
+
|
282
|
+
export interface ExistenceProofSDKType {
|
283
|
+
key: Uint8Array;
|
284
|
+
value: Uint8Array;
|
285
|
+
leaf: LeafOpSDKType;
|
286
|
+
path: InnerOpSDKType[];
|
287
|
+
}
|
288
|
+
/**
|
289
|
+
* NonExistenceProof takes a proof of two neighbors, one left of the desired key,
|
290
|
+
* one right of the desired key. If both proofs are valid AND they are neighbors,
|
291
|
+
* then there is no valid proof for the given key.
|
292
|
+
*/
|
293
|
+
|
294
|
+
export interface NonExistenceProof {
|
295
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
296
|
+
key: Uint8Array;
|
297
|
+
left: ExistenceProof;
|
298
|
+
right: ExistenceProof;
|
299
|
+
}
|
300
|
+
/**
|
301
|
+
* NonExistenceProof takes a proof of two neighbors, one left of the desired key,
|
302
|
+
* one right of the desired key. If both proofs are valid AND they are neighbors,
|
303
|
+
* then there is no valid proof for the given key.
|
304
|
+
*/
|
305
|
+
|
306
|
+
export interface NonExistenceProofSDKType {
|
307
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
308
|
+
key: Uint8Array;
|
309
|
+
left: ExistenceProofSDKType;
|
310
|
+
right: ExistenceProofSDKType;
|
311
|
+
}
|
312
|
+
/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
|
313
|
+
|
314
|
+
export interface CommitmentProof {
|
315
|
+
exist?: ExistenceProof;
|
316
|
+
nonexist?: NonExistenceProof;
|
317
|
+
batch?: BatchProof;
|
318
|
+
compressed?: CompressedBatchProof;
|
319
|
+
}
|
320
|
+
/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
|
321
|
+
|
322
|
+
export interface CommitmentProofSDKType {
|
323
|
+
exist?: ExistenceProofSDKType;
|
324
|
+
nonexist?: NonExistenceProofSDKType;
|
325
|
+
batch?: BatchProofSDKType;
|
326
|
+
compressed?: CompressedBatchProofSDKType;
|
327
|
+
}
|
328
|
+
/**
|
329
|
+
* LeafOp represents the raw key-value data we wish to prove, and
|
330
|
+
* must be flexible to represent the internal transformation from
|
331
|
+
* the original key-value pairs into the basis hash, for many existing
|
332
|
+
* merkle trees.
|
333
|
+
*
|
334
|
+
* key and value are passed in. So that the signature of this operation is:
|
335
|
+
* leafOp(key, value) -> output
|
336
|
+
*
|
337
|
+
* To process this, first prehash the keys and values if needed (ANY means no hash in this case):
|
338
|
+
* hkey = prehashKey(key)
|
339
|
+
* hvalue = prehashValue(value)
|
340
|
+
*
|
341
|
+
* Then combine the bytes, and hash it
|
342
|
+
* output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
|
343
|
+
*/
|
344
|
+
|
345
|
+
export interface LeafOp {
|
346
|
+
hash: HashOp;
|
347
|
+
prehashKey: HashOp;
|
348
|
+
prehashValue: HashOp;
|
349
|
+
length: LengthOp;
|
350
|
+
/**
|
351
|
+
* prefix is a fixed bytes that may optionally be included at the beginning to differentiate
|
352
|
+
* a leaf node from an inner node.
|
353
|
+
*/
|
354
|
+
|
355
|
+
prefix: Uint8Array;
|
356
|
+
}
|
357
|
+
/**
|
358
|
+
* LeafOp represents the raw key-value data we wish to prove, and
|
359
|
+
* must be flexible to represent the internal transformation from
|
360
|
+
* the original key-value pairs into the basis hash, for many existing
|
361
|
+
* merkle trees.
|
362
|
+
*
|
363
|
+
* key and value are passed in. So that the signature of this operation is:
|
364
|
+
* leafOp(key, value) -> output
|
365
|
+
*
|
366
|
+
* To process this, first prehash the keys and values if needed (ANY means no hash in this case):
|
367
|
+
* hkey = prehashKey(key)
|
368
|
+
* hvalue = prehashValue(value)
|
369
|
+
*
|
370
|
+
* Then combine the bytes, and hash it
|
371
|
+
* output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
|
372
|
+
*/
|
373
|
+
|
374
|
+
export interface LeafOpSDKType {
|
375
|
+
hash: HashOpSDKType;
|
376
|
+
prehash_key: HashOpSDKType;
|
377
|
+
prehash_value: HashOpSDKType;
|
378
|
+
length: LengthOpSDKType;
|
379
|
+
/**
|
380
|
+
* prefix is a fixed bytes that may optionally be included at the beginning to differentiate
|
381
|
+
* a leaf node from an inner node.
|
382
|
+
*/
|
383
|
+
|
384
|
+
prefix: Uint8Array;
|
385
|
+
}
|
386
|
+
/**
|
387
|
+
* InnerOp represents a merkle-proof step that is not a leaf.
|
388
|
+
* It represents concatenating two children and hashing them to provide the next result.
|
389
|
+
*
|
390
|
+
* The result of the previous step is passed in, so the signature of this op is:
|
391
|
+
* innerOp(child) -> output
|
392
|
+
*
|
393
|
+
* The result of applying InnerOp should be:
|
394
|
+
* output = op.hash(op.prefix || child || op.suffix)
|
395
|
+
*
|
396
|
+
* where the || operator is concatenation of binary data,
|
397
|
+
* and child is the result of hashing all the tree below this step.
|
398
|
+
*
|
399
|
+
* Any special data, like prepending child with the length, or prepending the entire operation with
|
400
|
+
* some value to differentiate from leaf nodes, should be included in prefix and suffix.
|
401
|
+
* If either of prefix or suffix is empty, we just treat it as an empty string
|
402
|
+
*/
|
403
|
+
|
404
|
+
export interface InnerOp {
|
405
|
+
hash: HashOp;
|
406
|
+
prefix: Uint8Array;
|
407
|
+
suffix: Uint8Array;
|
408
|
+
}
|
409
|
+
/**
|
410
|
+
* InnerOp represents a merkle-proof step that is not a leaf.
|
411
|
+
* It represents concatenating two children and hashing them to provide the next result.
|
412
|
+
*
|
413
|
+
* The result of the previous step is passed in, so the signature of this op is:
|
414
|
+
* innerOp(child) -> output
|
415
|
+
*
|
416
|
+
* The result of applying InnerOp should be:
|
417
|
+
* output = op.hash(op.prefix || child || op.suffix)
|
418
|
+
*
|
419
|
+
* where the || operator is concatenation of binary data,
|
420
|
+
* and child is the result of hashing all the tree below this step.
|
421
|
+
*
|
422
|
+
* Any special data, like prepending child with the length, or prepending the entire operation with
|
423
|
+
* some value to differentiate from leaf nodes, should be included in prefix and suffix.
|
424
|
+
* If either of prefix or suffix is empty, we just treat it as an empty string
|
425
|
+
*/
|
426
|
+
|
427
|
+
export interface InnerOpSDKType {
|
428
|
+
hash: HashOpSDKType;
|
429
|
+
prefix: Uint8Array;
|
430
|
+
suffix: Uint8Array;
|
431
|
+
}
|
432
|
+
/**
|
433
|
+
* ProofSpec defines what the expected parameters are for a given proof type.
|
434
|
+
* This can be stored in the client and used to validate any incoming proofs.
|
435
|
+
*
|
436
|
+
* verify(ProofSpec, Proof) -> Proof | Error
|
437
|
+
*
|
438
|
+
* As demonstrated in tests, if we don't fix the algorithm used to calculate the
|
439
|
+
* LeafHash for a given tree, there are many possible key-value pairs that can
|
440
|
+
* generate a given hash (by interpretting the preimage differently).
|
441
|
+
* We need this for proper security, requires client knows a priori what
|
442
|
+
* tree format server uses. But not in code, rather a configuration object.
|
443
|
+
*/
|
444
|
+
|
445
|
+
export interface ProofSpec {
|
446
|
+
/**
|
447
|
+
* any field in the ExistenceProof must be the same as in this spec.
|
448
|
+
* except Prefix, which is just the first bytes of prefix (spec can be longer)
|
449
|
+
*/
|
450
|
+
leafSpec: LeafOp;
|
451
|
+
innerSpec: InnerSpec;
|
452
|
+
/** max_depth (if > 0) is the maximum number of InnerOps allowed (mainly for fixed-depth tries) */
|
453
|
+
|
454
|
+
maxDepth: number;
|
455
|
+
/** min_depth (if > 0) is the minimum number of InnerOps allowed (mainly for fixed-depth tries) */
|
456
|
+
|
457
|
+
minDepth: number;
|
458
|
+
}
|
459
|
+
/**
|
460
|
+
* ProofSpec defines what the expected parameters are for a given proof type.
|
461
|
+
* This can be stored in the client and used to validate any incoming proofs.
|
462
|
+
*
|
463
|
+
* verify(ProofSpec, Proof) -> Proof | Error
|
464
|
+
*
|
465
|
+
* As demonstrated in tests, if we don't fix the algorithm used to calculate the
|
466
|
+
* LeafHash for a given tree, there are many possible key-value pairs that can
|
467
|
+
* generate a given hash (by interpretting the preimage differently).
|
468
|
+
* We need this for proper security, requires client knows a priori what
|
469
|
+
* tree format server uses. But not in code, rather a configuration object.
|
470
|
+
*/
|
471
|
+
|
472
|
+
export interface ProofSpecSDKType {
|
473
|
+
/**
|
474
|
+
* any field in the ExistenceProof must be the same as in this spec.
|
475
|
+
* except Prefix, which is just the first bytes of prefix (spec can be longer)
|
476
|
+
*/
|
477
|
+
leaf_spec: LeafOpSDKType;
|
478
|
+
inner_spec: InnerSpecSDKType;
|
479
|
+
/** max_depth (if > 0) is the maximum number of InnerOps allowed (mainly for fixed-depth tries) */
|
480
|
+
|
481
|
+
max_depth: number;
|
482
|
+
/** min_depth (if > 0) is the minimum number of InnerOps allowed (mainly for fixed-depth tries) */
|
483
|
+
|
484
|
+
min_depth: number;
|
485
|
+
}
|
486
|
+
/**
|
487
|
+
* InnerSpec contains all store-specific structure info to determine if two proofs from a
|
488
|
+
* given store are neighbors.
|
489
|
+
*
|
490
|
+
* This enables:
|
491
|
+
*
|
492
|
+
* isLeftMost(spec: InnerSpec, op: InnerOp)
|
493
|
+
* isRightMost(spec: InnerSpec, op: InnerOp)
|
494
|
+
* isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
|
495
|
+
*/
|
496
|
+
|
497
|
+
export interface InnerSpec {
|
498
|
+
/**
|
499
|
+
* Child order is the ordering of the children node, must count from 0
|
500
|
+
* iavl tree is [0, 1] (left then right)
|
501
|
+
* merk is [0, 2, 1] (left, right, here)
|
502
|
+
*/
|
503
|
+
childOrder: number[];
|
504
|
+
childSize: number;
|
505
|
+
minPrefixLength: number;
|
506
|
+
maxPrefixLength: number;
|
507
|
+
/** empty child is the prehash image that is used when one child is nil (eg. 20 bytes of 0) */
|
508
|
+
|
509
|
+
emptyChild: Uint8Array;
|
510
|
+
/** hash is the algorithm that must be used for each InnerOp */
|
511
|
+
|
512
|
+
hash: HashOp;
|
513
|
+
}
|
514
|
+
/**
|
515
|
+
* InnerSpec contains all store-specific structure info to determine if two proofs from a
|
516
|
+
* given store are neighbors.
|
517
|
+
*
|
518
|
+
* This enables:
|
519
|
+
*
|
520
|
+
* isLeftMost(spec: InnerSpec, op: InnerOp)
|
521
|
+
* isRightMost(spec: InnerSpec, op: InnerOp)
|
522
|
+
* isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
|
523
|
+
*/
|
524
|
+
|
525
|
+
export interface InnerSpecSDKType {
|
526
|
+
/**
|
527
|
+
* Child order is the ordering of the children node, must count from 0
|
528
|
+
* iavl tree is [0, 1] (left then right)
|
529
|
+
* merk is [0, 2, 1] (left, right, here)
|
530
|
+
*/
|
531
|
+
child_order: number[];
|
532
|
+
child_size: number;
|
533
|
+
min_prefix_length: number;
|
534
|
+
max_prefix_length: number;
|
535
|
+
/** empty child is the prehash image that is used when one child is nil (eg. 20 bytes of 0) */
|
536
|
+
|
537
|
+
empty_child: Uint8Array;
|
538
|
+
/** hash is the algorithm that must be used for each InnerOp */
|
539
|
+
|
540
|
+
hash: HashOpSDKType;
|
541
|
+
}
|
542
|
+
/** BatchProof is a group of multiple proof types than can be compressed */
|
543
|
+
|
544
|
+
export interface BatchProof {
|
545
|
+
entries: BatchEntry[];
|
546
|
+
}
|
547
|
+
/** BatchProof is a group of multiple proof types than can be compressed */
|
548
|
+
|
549
|
+
export interface BatchProofSDKType {
|
550
|
+
entries: BatchEntrySDKType[];
|
551
|
+
}
|
552
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
553
|
+
|
554
|
+
export interface BatchEntry {
|
555
|
+
exist?: ExistenceProof;
|
556
|
+
nonexist?: NonExistenceProof;
|
557
|
+
}
|
558
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
559
|
+
|
560
|
+
export interface BatchEntrySDKType {
|
561
|
+
exist?: ExistenceProofSDKType;
|
562
|
+
nonexist?: NonExistenceProofSDKType;
|
563
|
+
}
|
564
|
+
export interface CompressedBatchProof {
|
565
|
+
entries: CompressedBatchEntry[];
|
566
|
+
lookupInners: InnerOp[];
|
567
|
+
}
|
568
|
+
export interface CompressedBatchProofSDKType {
|
569
|
+
entries: CompressedBatchEntrySDKType[];
|
570
|
+
lookup_inners: InnerOpSDKType[];
|
571
|
+
}
|
572
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
573
|
+
|
574
|
+
export interface CompressedBatchEntry {
|
575
|
+
exist?: CompressedExistenceProof;
|
576
|
+
nonexist?: CompressedNonExistenceProof;
|
577
|
+
}
|
578
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
579
|
+
|
580
|
+
export interface CompressedBatchEntrySDKType {
|
581
|
+
exist?: CompressedExistenceProofSDKType;
|
582
|
+
nonexist?: CompressedNonExistenceProofSDKType;
|
583
|
+
}
|
584
|
+
export interface CompressedExistenceProof {
|
585
|
+
key: Uint8Array;
|
586
|
+
value: Uint8Array;
|
587
|
+
leaf: LeafOp;
|
588
|
+
/** these are indexes into the lookup_inners table in CompressedBatchProof */
|
589
|
+
|
590
|
+
path: number[];
|
591
|
+
}
|
592
|
+
export interface CompressedExistenceProofSDKType {
|
593
|
+
key: Uint8Array;
|
594
|
+
value: Uint8Array;
|
595
|
+
leaf: LeafOpSDKType;
|
596
|
+
/** these are indexes into the lookup_inners table in CompressedBatchProof */
|
597
|
+
|
598
|
+
path: number[];
|
599
|
+
}
|
600
|
+
export interface CompressedNonExistenceProof {
|
601
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
602
|
+
key: Uint8Array;
|
603
|
+
left: CompressedExistenceProof;
|
604
|
+
right: CompressedExistenceProof;
|
605
|
+
}
|
606
|
+
export interface CompressedNonExistenceProofSDKType {
|
607
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
608
|
+
key: Uint8Array;
|
609
|
+
left: CompressedExistenceProofSDKType;
|
610
|
+
right: CompressedExistenceProofSDKType;
|
611
|
+
}
|
612
|
+
|
613
|
+
function createBaseExistenceProof(): ExistenceProof {
|
614
|
+
return {
|
615
|
+
key: new Uint8Array(),
|
616
|
+
value: new Uint8Array(),
|
617
|
+
leaf: undefined,
|
618
|
+
path: []
|
619
|
+
};
|
620
|
+
}
|
621
|
+
|
622
|
+
export const ExistenceProof = {
|
623
|
+
encode(message: ExistenceProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
624
|
+
if (message.key.length !== 0) {
|
625
|
+
writer.uint32(10).bytes(message.key);
|
626
|
+
}
|
627
|
+
|
628
|
+
if (message.value.length !== 0) {
|
629
|
+
writer.uint32(18).bytes(message.value);
|
630
|
+
}
|
631
|
+
|
632
|
+
if (message.leaf !== undefined) {
|
633
|
+
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
634
|
+
}
|
635
|
+
|
636
|
+
for (const v of message.path) {
|
637
|
+
InnerOp.encode(v!, writer.uint32(34).fork()).ldelim();
|
638
|
+
}
|
639
|
+
|
640
|
+
return writer;
|
641
|
+
},
|
642
|
+
|
643
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ExistenceProof {
|
644
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
645
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
646
|
+
const message = createBaseExistenceProof();
|
647
|
+
|
648
|
+
while (reader.pos < end) {
|
649
|
+
const tag = reader.uint32();
|
650
|
+
|
651
|
+
switch (tag >>> 3) {
|
652
|
+
case 1:
|
653
|
+
message.key = reader.bytes();
|
654
|
+
break;
|
655
|
+
|
656
|
+
case 2:
|
657
|
+
message.value = reader.bytes();
|
658
|
+
break;
|
659
|
+
|
660
|
+
case 3:
|
661
|
+
message.leaf = LeafOp.decode(reader, reader.uint32());
|
662
|
+
break;
|
663
|
+
|
664
|
+
case 4:
|
665
|
+
message.path.push(InnerOp.decode(reader, reader.uint32()));
|
666
|
+
break;
|
667
|
+
|
668
|
+
default:
|
669
|
+
reader.skipType(tag & 7);
|
670
|
+
break;
|
671
|
+
}
|
672
|
+
}
|
673
|
+
|
674
|
+
return message;
|
675
|
+
},
|
676
|
+
|
677
|
+
fromPartial(object: DeepPartial<ExistenceProof>): ExistenceProof {
|
678
|
+
const message = createBaseExistenceProof();
|
679
|
+
message.key = object.key ?? new Uint8Array();
|
680
|
+
message.value = object.value ?? new Uint8Array();
|
681
|
+
message.leaf = object.leaf !== undefined && object.leaf !== null ? LeafOp.fromPartial(object.leaf) : undefined;
|
682
|
+
message.path = object.path?.map(e => InnerOp.fromPartial(e)) || [];
|
683
|
+
return message;
|
684
|
+
}
|
685
|
+
|
686
|
+
};
|
687
|
+
|
688
|
+
function createBaseNonExistenceProof(): NonExistenceProof {
|
689
|
+
return {
|
690
|
+
key: new Uint8Array(),
|
691
|
+
left: undefined,
|
692
|
+
right: undefined
|
693
|
+
};
|
694
|
+
}
|
695
|
+
|
696
|
+
export const NonExistenceProof = {
|
697
|
+
encode(message: NonExistenceProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
698
|
+
if (message.key.length !== 0) {
|
699
|
+
writer.uint32(10).bytes(message.key);
|
700
|
+
}
|
701
|
+
|
702
|
+
if (message.left !== undefined) {
|
703
|
+
ExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
704
|
+
}
|
705
|
+
|
706
|
+
if (message.right !== undefined) {
|
707
|
+
ExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
708
|
+
}
|
709
|
+
|
710
|
+
return writer;
|
711
|
+
},
|
712
|
+
|
713
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): NonExistenceProof {
|
714
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
715
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
716
|
+
const message = createBaseNonExistenceProof();
|
717
|
+
|
718
|
+
while (reader.pos < end) {
|
719
|
+
const tag = reader.uint32();
|
720
|
+
|
721
|
+
switch (tag >>> 3) {
|
722
|
+
case 1:
|
723
|
+
message.key = reader.bytes();
|
724
|
+
break;
|
725
|
+
|
726
|
+
case 2:
|
727
|
+
message.left = ExistenceProof.decode(reader, reader.uint32());
|
728
|
+
break;
|
729
|
+
|
730
|
+
case 3:
|
731
|
+
message.right = ExistenceProof.decode(reader, reader.uint32());
|
732
|
+
break;
|
733
|
+
|
734
|
+
default:
|
735
|
+
reader.skipType(tag & 7);
|
736
|
+
break;
|
737
|
+
}
|
738
|
+
}
|
739
|
+
|
740
|
+
return message;
|
741
|
+
},
|
742
|
+
|
743
|
+
fromPartial(object: DeepPartial<NonExistenceProof>): NonExistenceProof {
|
744
|
+
const message = createBaseNonExistenceProof();
|
745
|
+
message.key = object.key ?? new Uint8Array();
|
746
|
+
message.left = object.left !== undefined && object.left !== null ? ExistenceProof.fromPartial(object.left) : undefined;
|
747
|
+
message.right = object.right !== undefined && object.right !== null ? ExistenceProof.fromPartial(object.right) : undefined;
|
748
|
+
return message;
|
749
|
+
}
|
750
|
+
|
751
|
+
};
|
752
|
+
|
753
|
+
function createBaseCommitmentProof(): CommitmentProof {
|
754
|
+
return {
|
755
|
+
exist: undefined,
|
756
|
+
nonexist: undefined,
|
757
|
+
batch: undefined,
|
758
|
+
compressed: undefined
|
759
|
+
};
|
760
|
+
}
|
761
|
+
|
762
|
+
export const CommitmentProof = {
|
763
|
+
encode(message: CommitmentProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
764
|
+
if (message.exist !== undefined) {
|
765
|
+
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
766
|
+
}
|
767
|
+
|
768
|
+
if (message.nonexist !== undefined) {
|
769
|
+
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
770
|
+
}
|
771
|
+
|
772
|
+
if (message.batch !== undefined) {
|
773
|
+
BatchProof.encode(message.batch, writer.uint32(26).fork()).ldelim();
|
774
|
+
}
|
775
|
+
|
776
|
+
if (message.compressed !== undefined) {
|
777
|
+
CompressedBatchProof.encode(message.compressed, writer.uint32(34).fork()).ldelim();
|
778
|
+
}
|
779
|
+
|
780
|
+
return writer;
|
781
|
+
},
|
782
|
+
|
783
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CommitmentProof {
|
784
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
785
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
786
|
+
const message = createBaseCommitmentProof();
|
787
|
+
|
788
|
+
while (reader.pos < end) {
|
789
|
+
const tag = reader.uint32();
|
790
|
+
|
791
|
+
switch (tag >>> 3) {
|
792
|
+
case 1:
|
793
|
+
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
794
|
+
break;
|
795
|
+
|
796
|
+
case 2:
|
797
|
+
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
798
|
+
break;
|
799
|
+
|
800
|
+
case 3:
|
801
|
+
message.batch = BatchProof.decode(reader, reader.uint32());
|
802
|
+
break;
|
803
|
+
|
804
|
+
case 4:
|
805
|
+
message.compressed = CompressedBatchProof.decode(reader, reader.uint32());
|
806
|
+
break;
|
807
|
+
|
808
|
+
default:
|
809
|
+
reader.skipType(tag & 7);
|
810
|
+
break;
|
811
|
+
}
|
812
|
+
}
|
813
|
+
|
814
|
+
return message;
|
815
|
+
},
|
816
|
+
|
817
|
+
fromPartial(object: DeepPartial<CommitmentProof>): CommitmentProof {
|
818
|
+
const message = createBaseCommitmentProof();
|
819
|
+
message.exist = object.exist !== undefined && object.exist !== null ? ExistenceProof.fromPartial(object.exist) : undefined;
|
820
|
+
message.nonexist = object.nonexist !== undefined && object.nonexist !== null ? NonExistenceProof.fromPartial(object.nonexist) : undefined;
|
821
|
+
message.batch = object.batch !== undefined && object.batch !== null ? BatchProof.fromPartial(object.batch) : undefined;
|
822
|
+
message.compressed = object.compressed !== undefined && object.compressed !== null ? CompressedBatchProof.fromPartial(object.compressed) : undefined;
|
823
|
+
return message;
|
824
|
+
}
|
825
|
+
|
826
|
+
};
|
827
|
+
|
828
|
+
function createBaseLeafOp(): LeafOp {
|
829
|
+
return {
|
830
|
+
hash: 0,
|
831
|
+
prehashKey: 0,
|
832
|
+
prehashValue: 0,
|
833
|
+
length: 0,
|
834
|
+
prefix: new Uint8Array()
|
835
|
+
};
|
836
|
+
}
|
837
|
+
|
838
|
+
export const LeafOp = {
|
839
|
+
encode(message: LeafOp, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
840
|
+
if (message.hash !== 0) {
|
841
|
+
writer.uint32(8).int32(message.hash);
|
842
|
+
}
|
843
|
+
|
844
|
+
if (message.prehashKey !== 0) {
|
845
|
+
writer.uint32(16).int32(message.prehashKey);
|
846
|
+
}
|
847
|
+
|
848
|
+
if (message.prehashValue !== 0) {
|
849
|
+
writer.uint32(24).int32(message.prehashValue);
|
850
|
+
}
|
851
|
+
|
852
|
+
if (message.length !== 0) {
|
853
|
+
writer.uint32(32).int32(message.length);
|
854
|
+
}
|
855
|
+
|
856
|
+
if (message.prefix.length !== 0) {
|
857
|
+
writer.uint32(42).bytes(message.prefix);
|
858
|
+
}
|
859
|
+
|
860
|
+
return writer;
|
861
|
+
},
|
862
|
+
|
863
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): LeafOp {
|
864
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
865
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
866
|
+
const message = createBaseLeafOp();
|
867
|
+
|
868
|
+
while (reader.pos < end) {
|
869
|
+
const tag = reader.uint32();
|
870
|
+
|
871
|
+
switch (tag >>> 3) {
|
872
|
+
case 1:
|
873
|
+
message.hash = (reader.int32() as any);
|
874
|
+
break;
|
875
|
+
|
876
|
+
case 2:
|
877
|
+
message.prehashKey = (reader.int32() as any);
|
878
|
+
break;
|
879
|
+
|
880
|
+
case 3:
|
881
|
+
message.prehashValue = (reader.int32() as any);
|
882
|
+
break;
|
883
|
+
|
884
|
+
case 4:
|
885
|
+
message.length = (reader.int32() as any);
|
886
|
+
break;
|
887
|
+
|
888
|
+
case 5:
|
889
|
+
message.prefix = reader.bytes();
|
890
|
+
break;
|
891
|
+
|
892
|
+
default:
|
893
|
+
reader.skipType(tag & 7);
|
894
|
+
break;
|
895
|
+
}
|
896
|
+
}
|
897
|
+
|
898
|
+
return message;
|
899
|
+
},
|
900
|
+
|
901
|
+
fromPartial(object: DeepPartial<LeafOp>): LeafOp {
|
902
|
+
const message = createBaseLeafOp();
|
903
|
+
message.hash = object.hash ?? 0;
|
904
|
+
message.prehashKey = object.prehashKey ?? 0;
|
905
|
+
message.prehashValue = object.prehashValue ?? 0;
|
906
|
+
message.length = object.length ?? 0;
|
907
|
+
message.prefix = object.prefix ?? new Uint8Array();
|
908
|
+
return message;
|
909
|
+
}
|
910
|
+
|
911
|
+
};
|
912
|
+
|
913
|
+
function createBaseInnerOp(): InnerOp {
|
914
|
+
return {
|
915
|
+
hash: 0,
|
916
|
+
prefix: new Uint8Array(),
|
917
|
+
suffix: new Uint8Array()
|
918
|
+
};
|
919
|
+
}
|
920
|
+
|
921
|
+
export const InnerOp = {
|
922
|
+
encode(message: InnerOp, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
923
|
+
if (message.hash !== 0) {
|
924
|
+
writer.uint32(8).int32(message.hash);
|
925
|
+
}
|
926
|
+
|
927
|
+
if (message.prefix.length !== 0) {
|
928
|
+
writer.uint32(18).bytes(message.prefix);
|
929
|
+
}
|
930
|
+
|
931
|
+
if (message.suffix.length !== 0) {
|
932
|
+
writer.uint32(26).bytes(message.suffix);
|
933
|
+
}
|
934
|
+
|
935
|
+
return writer;
|
936
|
+
},
|
937
|
+
|
938
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): InnerOp {
|
939
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
940
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
941
|
+
const message = createBaseInnerOp();
|
942
|
+
|
943
|
+
while (reader.pos < end) {
|
944
|
+
const tag = reader.uint32();
|
945
|
+
|
946
|
+
switch (tag >>> 3) {
|
947
|
+
case 1:
|
948
|
+
message.hash = (reader.int32() as any);
|
949
|
+
break;
|
950
|
+
|
951
|
+
case 2:
|
952
|
+
message.prefix = reader.bytes();
|
953
|
+
break;
|
954
|
+
|
955
|
+
case 3:
|
956
|
+
message.suffix = reader.bytes();
|
957
|
+
break;
|
958
|
+
|
959
|
+
default:
|
960
|
+
reader.skipType(tag & 7);
|
961
|
+
break;
|
962
|
+
}
|
963
|
+
}
|
964
|
+
|
965
|
+
return message;
|
966
|
+
},
|
967
|
+
|
968
|
+
fromPartial(object: DeepPartial<InnerOp>): InnerOp {
|
969
|
+
const message = createBaseInnerOp();
|
970
|
+
message.hash = object.hash ?? 0;
|
971
|
+
message.prefix = object.prefix ?? new Uint8Array();
|
972
|
+
message.suffix = object.suffix ?? new Uint8Array();
|
973
|
+
return message;
|
974
|
+
}
|
975
|
+
|
976
|
+
};
|
977
|
+
|
978
|
+
function createBaseProofSpec(): ProofSpec {
|
979
|
+
return {
|
980
|
+
leafSpec: undefined,
|
981
|
+
innerSpec: undefined,
|
982
|
+
maxDepth: 0,
|
983
|
+
minDepth: 0
|
984
|
+
};
|
985
|
+
}
|
986
|
+
|
987
|
+
export const ProofSpec = {
|
988
|
+
encode(message: ProofSpec, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
989
|
+
if (message.leafSpec !== undefined) {
|
990
|
+
LeafOp.encode(message.leafSpec, writer.uint32(10).fork()).ldelim();
|
991
|
+
}
|
992
|
+
|
993
|
+
if (message.innerSpec !== undefined) {
|
994
|
+
InnerSpec.encode(message.innerSpec, writer.uint32(18).fork()).ldelim();
|
995
|
+
}
|
996
|
+
|
997
|
+
if (message.maxDepth !== 0) {
|
998
|
+
writer.uint32(24).int32(message.maxDepth);
|
999
|
+
}
|
1000
|
+
|
1001
|
+
if (message.minDepth !== 0) {
|
1002
|
+
writer.uint32(32).int32(message.minDepth);
|
1003
|
+
}
|
1004
|
+
|
1005
|
+
return writer;
|
1006
|
+
},
|
1007
|
+
|
1008
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ProofSpec {
|
1009
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1010
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1011
|
+
const message = createBaseProofSpec();
|
1012
|
+
|
1013
|
+
while (reader.pos < end) {
|
1014
|
+
const tag = reader.uint32();
|
1015
|
+
|
1016
|
+
switch (tag >>> 3) {
|
1017
|
+
case 1:
|
1018
|
+
message.leafSpec = LeafOp.decode(reader, reader.uint32());
|
1019
|
+
break;
|
1020
|
+
|
1021
|
+
case 2:
|
1022
|
+
message.innerSpec = InnerSpec.decode(reader, reader.uint32());
|
1023
|
+
break;
|
1024
|
+
|
1025
|
+
case 3:
|
1026
|
+
message.maxDepth = reader.int32();
|
1027
|
+
break;
|
1028
|
+
|
1029
|
+
case 4:
|
1030
|
+
message.minDepth = reader.int32();
|
1031
|
+
break;
|
1032
|
+
|
1033
|
+
default:
|
1034
|
+
reader.skipType(tag & 7);
|
1035
|
+
break;
|
1036
|
+
}
|
1037
|
+
}
|
1038
|
+
|
1039
|
+
return message;
|
1040
|
+
},
|
1041
|
+
|
1042
|
+
fromPartial(object: DeepPartial<ProofSpec>): ProofSpec {
|
1043
|
+
const message = createBaseProofSpec();
|
1044
|
+
message.leafSpec = object.leafSpec !== undefined && object.leafSpec !== null ? LeafOp.fromPartial(object.leafSpec) : undefined;
|
1045
|
+
message.innerSpec = object.innerSpec !== undefined && object.innerSpec !== null ? InnerSpec.fromPartial(object.innerSpec) : undefined;
|
1046
|
+
message.maxDepth = object.maxDepth ?? 0;
|
1047
|
+
message.minDepth = object.minDepth ?? 0;
|
1048
|
+
return message;
|
1049
|
+
}
|
1050
|
+
|
1051
|
+
};
|
1052
|
+
|
1053
|
+
function createBaseInnerSpec(): InnerSpec {
|
1054
|
+
return {
|
1055
|
+
childOrder: [],
|
1056
|
+
childSize: 0,
|
1057
|
+
minPrefixLength: 0,
|
1058
|
+
maxPrefixLength: 0,
|
1059
|
+
emptyChild: new Uint8Array(),
|
1060
|
+
hash: 0
|
1061
|
+
};
|
1062
|
+
}
|
1063
|
+
|
1064
|
+
export const InnerSpec = {
|
1065
|
+
encode(message: InnerSpec, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1066
|
+
writer.uint32(10).fork();
|
1067
|
+
|
1068
|
+
for (const v of message.childOrder) {
|
1069
|
+
writer.int32(v);
|
1070
|
+
}
|
1071
|
+
|
1072
|
+
writer.ldelim();
|
1073
|
+
|
1074
|
+
if (message.childSize !== 0) {
|
1075
|
+
writer.uint32(16).int32(message.childSize);
|
1076
|
+
}
|
1077
|
+
|
1078
|
+
if (message.minPrefixLength !== 0) {
|
1079
|
+
writer.uint32(24).int32(message.minPrefixLength);
|
1080
|
+
}
|
1081
|
+
|
1082
|
+
if (message.maxPrefixLength !== 0) {
|
1083
|
+
writer.uint32(32).int32(message.maxPrefixLength);
|
1084
|
+
}
|
1085
|
+
|
1086
|
+
if (message.emptyChild.length !== 0) {
|
1087
|
+
writer.uint32(42).bytes(message.emptyChild);
|
1088
|
+
}
|
1089
|
+
|
1090
|
+
if (message.hash !== 0) {
|
1091
|
+
writer.uint32(48).int32(message.hash);
|
1092
|
+
}
|
1093
|
+
|
1094
|
+
return writer;
|
1095
|
+
},
|
1096
|
+
|
1097
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): InnerSpec {
|
1098
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1099
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1100
|
+
const message = createBaseInnerSpec();
|
1101
|
+
|
1102
|
+
while (reader.pos < end) {
|
1103
|
+
const tag = reader.uint32();
|
1104
|
+
|
1105
|
+
switch (tag >>> 3) {
|
1106
|
+
case 1:
|
1107
|
+
if ((tag & 7) === 2) {
|
1108
|
+
const end2 = reader.uint32() + reader.pos;
|
1109
|
+
|
1110
|
+
while (reader.pos < end2) {
|
1111
|
+
message.childOrder.push(reader.int32());
|
1112
|
+
}
|
1113
|
+
} else {
|
1114
|
+
message.childOrder.push(reader.int32());
|
1115
|
+
}
|
1116
|
+
|
1117
|
+
break;
|
1118
|
+
|
1119
|
+
case 2:
|
1120
|
+
message.childSize = reader.int32();
|
1121
|
+
break;
|
1122
|
+
|
1123
|
+
case 3:
|
1124
|
+
message.minPrefixLength = reader.int32();
|
1125
|
+
break;
|
1126
|
+
|
1127
|
+
case 4:
|
1128
|
+
message.maxPrefixLength = reader.int32();
|
1129
|
+
break;
|
1130
|
+
|
1131
|
+
case 5:
|
1132
|
+
message.emptyChild = reader.bytes();
|
1133
|
+
break;
|
1134
|
+
|
1135
|
+
case 6:
|
1136
|
+
message.hash = (reader.int32() as any);
|
1137
|
+
break;
|
1138
|
+
|
1139
|
+
default:
|
1140
|
+
reader.skipType(tag & 7);
|
1141
|
+
break;
|
1142
|
+
}
|
1143
|
+
}
|
1144
|
+
|
1145
|
+
return message;
|
1146
|
+
},
|
1147
|
+
|
1148
|
+
fromPartial(object: DeepPartial<InnerSpec>): InnerSpec {
|
1149
|
+
const message = createBaseInnerSpec();
|
1150
|
+
message.childOrder = object.childOrder?.map(e => e) || [];
|
1151
|
+
message.childSize = object.childSize ?? 0;
|
1152
|
+
message.minPrefixLength = object.minPrefixLength ?? 0;
|
1153
|
+
message.maxPrefixLength = object.maxPrefixLength ?? 0;
|
1154
|
+
message.emptyChild = object.emptyChild ?? new Uint8Array();
|
1155
|
+
message.hash = object.hash ?? 0;
|
1156
|
+
return message;
|
1157
|
+
}
|
1158
|
+
|
1159
|
+
};
|
1160
|
+
|
1161
|
+
function createBaseBatchProof(): BatchProof {
|
1162
|
+
return {
|
1163
|
+
entries: []
|
1164
|
+
};
|
1165
|
+
}
|
1166
|
+
|
1167
|
+
export const BatchProof = {
|
1168
|
+
encode(message: BatchProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1169
|
+
for (const v of message.entries) {
|
1170
|
+
BatchEntry.encode(v!, writer.uint32(10).fork()).ldelim();
|
1171
|
+
}
|
1172
|
+
|
1173
|
+
return writer;
|
1174
|
+
},
|
1175
|
+
|
1176
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): BatchProof {
|
1177
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1178
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1179
|
+
const message = createBaseBatchProof();
|
1180
|
+
|
1181
|
+
while (reader.pos < end) {
|
1182
|
+
const tag = reader.uint32();
|
1183
|
+
|
1184
|
+
switch (tag >>> 3) {
|
1185
|
+
case 1:
|
1186
|
+
message.entries.push(BatchEntry.decode(reader, reader.uint32()));
|
1187
|
+
break;
|
1188
|
+
|
1189
|
+
default:
|
1190
|
+
reader.skipType(tag & 7);
|
1191
|
+
break;
|
1192
|
+
}
|
1193
|
+
}
|
1194
|
+
|
1195
|
+
return message;
|
1196
|
+
},
|
1197
|
+
|
1198
|
+
fromPartial(object: DeepPartial<BatchProof>): BatchProof {
|
1199
|
+
const message = createBaseBatchProof();
|
1200
|
+
message.entries = object.entries?.map(e => BatchEntry.fromPartial(e)) || [];
|
1201
|
+
return message;
|
1202
|
+
}
|
1203
|
+
|
1204
|
+
};
|
1205
|
+
|
1206
|
+
function createBaseBatchEntry(): BatchEntry {
|
1207
|
+
return {
|
1208
|
+
exist: undefined,
|
1209
|
+
nonexist: undefined
|
1210
|
+
};
|
1211
|
+
}
|
1212
|
+
|
1213
|
+
export const BatchEntry = {
|
1214
|
+
encode(message: BatchEntry, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1215
|
+
if (message.exist !== undefined) {
|
1216
|
+
ExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
1217
|
+
}
|
1218
|
+
|
1219
|
+
if (message.nonexist !== undefined) {
|
1220
|
+
NonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
1221
|
+
}
|
1222
|
+
|
1223
|
+
return writer;
|
1224
|
+
},
|
1225
|
+
|
1226
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): BatchEntry {
|
1227
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1228
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1229
|
+
const message = createBaseBatchEntry();
|
1230
|
+
|
1231
|
+
while (reader.pos < end) {
|
1232
|
+
const tag = reader.uint32();
|
1233
|
+
|
1234
|
+
switch (tag >>> 3) {
|
1235
|
+
case 1:
|
1236
|
+
message.exist = ExistenceProof.decode(reader, reader.uint32());
|
1237
|
+
break;
|
1238
|
+
|
1239
|
+
case 2:
|
1240
|
+
message.nonexist = NonExistenceProof.decode(reader, reader.uint32());
|
1241
|
+
break;
|
1242
|
+
|
1243
|
+
default:
|
1244
|
+
reader.skipType(tag & 7);
|
1245
|
+
break;
|
1246
|
+
}
|
1247
|
+
}
|
1248
|
+
|
1249
|
+
return message;
|
1250
|
+
},
|
1251
|
+
|
1252
|
+
fromPartial(object: DeepPartial<BatchEntry>): BatchEntry {
|
1253
|
+
const message = createBaseBatchEntry();
|
1254
|
+
message.exist = object.exist !== undefined && object.exist !== null ? ExistenceProof.fromPartial(object.exist) : undefined;
|
1255
|
+
message.nonexist = object.nonexist !== undefined && object.nonexist !== null ? NonExistenceProof.fromPartial(object.nonexist) : undefined;
|
1256
|
+
return message;
|
1257
|
+
}
|
1258
|
+
|
1259
|
+
};
|
1260
|
+
|
1261
|
+
function createBaseCompressedBatchProof(): CompressedBatchProof {
|
1262
|
+
return {
|
1263
|
+
entries: [],
|
1264
|
+
lookupInners: []
|
1265
|
+
};
|
1266
|
+
}
|
1267
|
+
|
1268
|
+
export const CompressedBatchProof = {
|
1269
|
+
encode(message: CompressedBatchProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1270
|
+
for (const v of message.entries) {
|
1271
|
+
CompressedBatchEntry.encode(v!, writer.uint32(10).fork()).ldelim();
|
1272
|
+
}
|
1273
|
+
|
1274
|
+
for (const v of message.lookupInners) {
|
1275
|
+
InnerOp.encode(v!, writer.uint32(18).fork()).ldelim();
|
1276
|
+
}
|
1277
|
+
|
1278
|
+
return writer;
|
1279
|
+
},
|
1280
|
+
|
1281
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedBatchProof {
|
1282
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1283
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1284
|
+
const message = createBaseCompressedBatchProof();
|
1285
|
+
|
1286
|
+
while (reader.pos < end) {
|
1287
|
+
const tag = reader.uint32();
|
1288
|
+
|
1289
|
+
switch (tag >>> 3) {
|
1290
|
+
case 1:
|
1291
|
+
message.entries.push(CompressedBatchEntry.decode(reader, reader.uint32()));
|
1292
|
+
break;
|
1293
|
+
|
1294
|
+
case 2:
|
1295
|
+
message.lookupInners.push(InnerOp.decode(reader, reader.uint32()));
|
1296
|
+
break;
|
1297
|
+
|
1298
|
+
default:
|
1299
|
+
reader.skipType(tag & 7);
|
1300
|
+
break;
|
1301
|
+
}
|
1302
|
+
}
|
1303
|
+
|
1304
|
+
return message;
|
1305
|
+
},
|
1306
|
+
|
1307
|
+
fromPartial(object: DeepPartial<CompressedBatchProof>): CompressedBatchProof {
|
1308
|
+
const message = createBaseCompressedBatchProof();
|
1309
|
+
message.entries = object.entries?.map(e => CompressedBatchEntry.fromPartial(e)) || [];
|
1310
|
+
message.lookupInners = object.lookupInners?.map(e => InnerOp.fromPartial(e)) || [];
|
1311
|
+
return message;
|
1312
|
+
}
|
1313
|
+
|
1314
|
+
};
|
1315
|
+
|
1316
|
+
function createBaseCompressedBatchEntry(): CompressedBatchEntry {
|
1317
|
+
return {
|
1318
|
+
exist: undefined,
|
1319
|
+
nonexist: undefined
|
1320
|
+
};
|
1321
|
+
}
|
1322
|
+
|
1323
|
+
export const CompressedBatchEntry = {
|
1324
|
+
encode(message: CompressedBatchEntry, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1325
|
+
if (message.exist !== undefined) {
|
1326
|
+
CompressedExistenceProof.encode(message.exist, writer.uint32(10).fork()).ldelim();
|
1327
|
+
}
|
1328
|
+
|
1329
|
+
if (message.nonexist !== undefined) {
|
1330
|
+
CompressedNonExistenceProof.encode(message.nonexist, writer.uint32(18).fork()).ldelim();
|
1331
|
+
}
|
1332
|
+
|
1333
|
+
return writer;
|
1334
|
+
},
|
1335
|
+
|
1336
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedBatchEntry {
|
1337
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1338
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1339
|
+
const message = createBaseCompressedBatchEntry();
|
1340
|
+
|
1341
|
+
while (reader.pos < end) {
|
1342
|
+
const tag = reader.uint32();
|
1343
|
+
|
1344
|
+
switch (tag >>> 3) {
|
1345
|
+
case 1:
|
1346
|
+
message.exist = CompressedExistenceProof.decode(reader, reader.uint32());
|
1347
|
+
break;
|
1348
|
+
|
1349
|
+
case 2:
|
1350
|
+
message.nonexist = CompressedNonExistenceProof.decode(reader, reader.uint32());
|
1351
|
+
break;
|
1352
|
+
|
1353
|
+
default:
|
1354
|
+
reader.skipType(tag & 7);
|
1355
|
+
break;
|
1356
|
+
}
|
1357
|
+
}
|
1358
|
+
|
1359
|
+
return message;
|
1360
|
+
},
|
1361
|
+
|
1362
|
+
fromPartial(object: DeepPartial<CompressedBatchEntry>): CompressedBatchEntry {
|
1363
|
+
const message = createBaseCompressedBatchEntry();
|
1364
|
+
message.exist = object.exist !== undefined && object.exist !== null ? CompressedExistenceProof.fromPartial(object.exist) : undefined;
|
1365
|
+
message.nonexist = object.nonexist !== undefined && object.nonexist !== null ? CompressedNonExistenceProof.fromPartial(object.nonexist) : undefined;
|
1366
|
+
return message;
|
1367
|
+
}
|
1368
|
+
|
1369
|
+
};
|
1370
|
+
|
1371
|
+
function createBaseCompressedExistenceProof(): CompressedExistenceProof {
|
1372
|
+
return {
|
1373
|
+
key: new Uint8Array(),
|
1374
|
+
value: new Uint8Array(),
|
1375
|
+
leaf: undefined,
|
1376
|
+
path: []
|
1377
|
+
};
|
1378
|
+
}
|
1379
|
+
|
1380
|
+
export const CompressedExistenceProof = {
|
1381
|
+
encode(message: CompressedExistenceProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1382
|
+
if (message.key.length !== 0) {
|
1383
|
+
writer.uint32(10).bytes(message.key);
|
1384
|
+
}
|
1385
|
+
|
1386
|
+
if (message.value.length !== 0) {
|
1387
|
+
writer.uint32(18).bytes(message.value);
|
1388
|
+
}
|
1389
|
+
|
1390
|
+
if (message.leaf !== undefined) {
|
1391
|
+
LeafOp.encode(message.leaf, writer.uint32(26).fork()).ldelim();
|
1392
|
+
}
|
1393
|
+
|
1394
|
+
writer.uint32(34).fork();
|
1395
|
+
|
1396
|
+
for (const v of message.path) {
|
1397
|
+
writer.int32(v);
|
1398
|
+
}
|
1399
|
+
|
1400
|
+
writer.ldelim();
|
1401
|
+
return writer;
|
1402
|
+
},
|
1403
|
+
|
1404
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedExistenceProof {
|
1405
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1406
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1407
|
+
const message = createBaseCompressedExistenceProof();
|
1408
|
+
|
1409
|
+
while (reader.pos < end) {
|
1410
|
+
const tag = reader.uint32();
|
1411
|
+
|
1412
|
+
switch (tag >>> 3) {
|
1413
|
+
case 1:
|
1414
|
+
message.key = reader.bytes();
|
1415
|
+
break;
|
1416
|
+
|
1417
|
+
case 2:
|
1418
|
+
message.value = reader.bytes();
|
1419
|
+
break;
|
1420
|
+
|
1421
|
+
case 3:
|
1422
|
+
message.leaf = LeafOp.decode(reader, reader.uint32());
|
1423
|
+
break;
|
1424
|
+
|
1425
|
+
case 4:
|
1426
|
+
if ((tag & 7) === 2) {
|
1427
|
+
const end2 = reader.uint32() + reader.pos;
|
1428
|
+
|
1429
|
+
while (reader.pos < end2) {
|
1430
|
+
message.path.push(reader.int32());
|
1431
|
+
}
|
1432
|
+
} else {
|
1433
|
+
message.path.push(reader.int32());
|
1434
|
+
}
|
1435
|
+
|
1436
|
+
break;
|
1437
|
+
|
1438
|
+
default:
|
1439
|
+
reader.skipType(tag & 7);
|
1440
|
+
break;
|
1441
|
+
}
|
1442
|
+
}
|
1443
|
+
|
1444
|
+
return message;
|
1445
|
+
},
|
1446
|
+
|
1447
|
+
fromPartial(object: DeepPartial<CompressedExistenceProof>): CompressedExistenceProof {
|
1448
|
+
const message = createBaseCompressedExistenceProof();
|
1449
|
+
message.key = object.key ?? new Uint8Array();
|
1450
|
+
message.value = object.value ?? new Uint8Array();
|
1451
|
+
message.leaf = object.leaf !== undefined && object.leaf !== null ? LeafOp.fromPartial(object.leaf) : undefined;
|
1452
|
+
message.path = object.path?.map(e => e) || [];
|
1453
|
+
return message;
|
1454
|
+
}
|
1455
|
+
|
1456
|
+
};
|
1457
|
+
|
1458
|
+
function createBaseCompressedNonExistenceProof(): CompressedNonExistenceProof {
|
1459
|
+
return {
|
1460
|
+
key: new Uint8Array(),
|
1461
|
+
left: undefined,
|
1462
|
+
right: undefined
|
1463
|
+
};
|
1464
|
+
}
|
1465
|
+
|
1466
|
+
export const CompressedNonExistenceProof = {
|
1467
|
+
encode(message: CompressedNonExistenceProof, writer: _m0.Writer = _m0.Writer.create()): _m0.Writer {
|
1468
|
+
if (message.key.length !== 0) {
|
1469
|
+
writer.uint32(10).bytes(message.key);
|
1470
|
+
}
|
1471
|
+
|
1472
|
+
if (message.left !== undefined) {
|
1473
|
+
CompressedExistenceProof.encode(message.left, writer.uint32(18).fork()).ldelim();
|
1474
|
+
}
|
1475
|
+
|
1476
|
+
if (message.right !== undefined) {
|
1477
|
+
CompressedExistenceProof.encode(message.right, writer.uint32(26).fork()).ldelim();
|
1478
|
+
}
|
1479
|
+
|
1480
|
+
return writer;
|
1481
|
+
},
|
1482
|
+
|
1483
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedNonExistenceProof {
|
1484
|
+
const reader = input instanceof _m0.Reader ? input : new _m0.Reader(input);
|
1485
|
+
let end = length === undefined ? reader.len : reader.pos + length;
|
1486
|
+
const message = createBaseCompressedNonExistenceProof();
|
1487
|
+
|
1488
|
+
while (reader.pos < end) {
|
1489
|
+
const tag = reader.uint32();
|
1490
|
+
|
1491
|
+
switch (tag >>> 3) {
|
1492
|
+
case 1:
|
1493
|
+
message.key = reader.bytes();
|
1494
|
+
break;
|
1495
|
+
|
1496
|
+
case 2:
|
1497
|
+
message.left = CompressedExistenceProof.decode(reader, reader.uint32());
|
1498
|
+
break;
|
1499
|
+
|
1500
|
+
case 3:
|
1501
|
+
message.right = CompressedExistenceProof.decode(reader, reader.uint32());
|
1502
|
+
break;
|
1503
|
+
|
1504
|
+
default:
|
1505
|
+
reader.skipType(tag & 7);
|
1506
|
+
break;
|
1507
|
+
}
|
1508
|
+
}
|
1509
|
+
|
1510
|
+
return message;
|
1511
|
+
},
|
1512
|
+
|
1513
|
+
fromPartial(object: DeepPartial<CompressedNonExistenceProof>): CompressedNonExistenceProof {
|
1514
|
+
const message = createBaseCompressedNonExistenceProof();
|
1515
|
+
message.key = object.key ?? new Uint8Array();
|
1516
|
+
message.left = object.left !== undefined && object.left !== null ? CompressedExistenceProof.fromPartial(object.left) : undefined;
|
1517
|
+
message.right = object.right !== undefined && object.right !== null ? CompressedExistenceProof.fromPartial(object.right) : undefined;
|
1518
|
+
return message;
|
1519
|
+
}
|
1520
|
+
|
1521
|
+
};
|