juno-network 0.4.0 → 0.5.0
Sign up to get free protection for your applications and to get access to all the features.
- package/main/codegen/cosmos/client.js +11 -5
- package/main/codegen/cosmwasm/client.js +11 -5
- package/main/codegen/ibc/client.js +11 -5
- package/package.json +3 -3
- package/types/codegen/JunoSwap.client.d.ts +120 -0
- package/types/codegen/JunoSwap.types.d.ts +124 -0
- package/types/codegen/confio/proofs.d.ts +495 -0
- package/types/codegen/contracts.d.ts +12 -0
- package/types/codegen/cosmos/app/v1alpha1/config.d.ts +51 -0
- package/types/codegen/cosmos/app/v1alpha1/module.d.ts +105 -0
- package/types/codegen/cosmos/app/v1alpha1/query.d.ts +25 -0
- package/types/codegen/cosmos/app/v1alpha1/query.rpc.query.d.ts +11 -0
- package/types/codegen/cosmos/auth/v1beta1/auth.d.ts +49 -0
- package/types/codegen/cosmos/auth/v1beta1/genesis.d.ts +18 -0
- package/types/codegen/cosmos/auth/v1beta1/query.d.ts +171 -0
- package/types/codegen/cosmos/auth/v1beta1/query.lcd.d.ts +14 -0
- package/types/codegen/cosmos/auth/v1beta1/query.rpc.query.d.ts +23 -0
- package/types/codegen/cosmos/authz/v1beta1/authz.d.ts +95 -0
- package/types/codegen/cosmos/authz/v1beta1/event.d.ts +48 -0
- package/types/codegen/cosmos/authz/v1beta1/genesis.d.ts +16 -0
- package/types/codegen/cosmos/authz/v1beta1/query.d.ts +118 -0
- package/types/codegen/cosmos/authz/v1beta1/query.lcd.d.ts +11 -0
- package/types/codegen/cosmos/authz/v1beta1/query.rpc.query.d.ts +21 -0
- package/types/codegen/cosmos/authz/v1beta1/tx.amino.d.ts +54 -0
- package/types/codegen/cosmos/authz/v1beta1/tx.d.ts +118 -0
- package/types/codegen/cosmos/authz/v1beta1/tx.registry.d.ts +76 -0
- package/types/codegen/cosmos/authz/v1beta1/tx.rpc.msg.d.ts +15 -0
- package/types/codegen/cosmos/bank/v1beta1/authz.d.ts +26 -0
- package/types/codegen/cosmos/bank/v1beta1/bank.d.ts +222 -0
- package/types/codegen/cosmos/bank/v1beta1/genesis.d.ts +62 -0
- package/types/codegen/cosmos/bank/v1beta1/query.d.ts +396 -0
- package/types/codegen/cosmos/bank/v1beta1/query.lcd.d.ts +17 -0
- package/types/codegen/cosmos/bank/v1beta1/query.rpc.query.d.ts +39 -0
- package/types/codegen/cosmos/bank/v1beta1/tx.amino.d.ts +44 -0
- package/types/codegen/cosmos/bank/v1beta1/tx.d.ts +58 -0
- package/types/codegen/cosmos/bank/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/bank/v1beta1/tx.rpc.msg.d.ts +13 -0
- package/types/codegen/cosmos/base/abci/v1beta1/abci.d.ts +354 -0
- package/types/codegen/cosmos/base/kv/v1beta1/kv.d.ts +25 -0
- package/types/codegen/cosmos/base/query/v1beta1/pagination.d.ts +138 -0
- package/types/codegen/cosmos/base/reflection/v1beta1/reflection.d.ts +53 -0
- package/types/codegen/cosmos/base/reflection/v2alpha1/reflection.d.ts +514 -0
- package/types/codegen/cosmos/base/snapshots/v1beta1/snapshot.d.ts +118 -0
- package/types/codegen/cosmos/base/store/v1beta1/commit_info.d.ts +47 -0
- package/types/codegen/cosmos/base/store/v1beta1/listening.d.ts +24 -0
- package/types/codegen/cosmos/base/tendermint/v1beta1/query.d.ts +197 -0
- package/types/codegen/cosmos/base/tendermint/v1beta1/query.lcd.d.ts +13 -0
- package/types/codegen/cosmos/base/tendermint/v1beta1/query.rpc.svc.d.ts +21 -0
- package/types/codegen/cosmos/base/v1beta1/coin.d.ts +78 -0
- package/types/codegen/cosmos/bundle.d.ts +6233 -0
- package/types/codegen/cosmos/capability/v1beta1/capability.d.ts +45 -0
- package/types/codegen/cosmos/capability/v1beta1/genesis.d.ts +34 -0
- package/types/codegen/cosmos/client.d.ts +473 -0
- package/types/codegen/cosmos/crisis/v1beta1/genesis.d.ts +18 -0
- package/types/codegen/cosmos/crisis/v1beta1/tx.amino.d.ts +17 -0
- package/types/codegen/cosmos/crisis/v1beta1/tx.d.ts +25 -0
- package/types/codegen/cosmos/crisis/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/crisis/v1beta1/tx.rpc.msg.d.ts +11 -0
- package/types/codegen/cosmos/crypto/ed25519/keys.d.ts +46 -0
- package/types/codegen/cosmos/crypto/hd/v1/hd.d.ts +39 -0
- package/types/codegen/cosmos/crypto/keyring/v1/record.d.ts +95 -0
- package/types/codegen/cosmos/crypto/multisig/keys.d.ts +26 -0
- package/types/codegen/cosmos/crypto/multisig/v1beta1/multisig.d.ts +48 -0
- package/types/codegen/cosmos/crypto/secp256k1/keys.d.ts +40 -0
- package/types/codegen/cosmos/crypto/secp256r1/keys.d.ts +38 -0
- package/types/codegen/cosmos/distribution/v1beta1/distribution.d.ts +281 -0
- package/types/codegen/cosmos/distribution/v1beta1/genesis.d.ts +224 -0
- package/types/codegen/cosmos/distribution/v1beta1/query.d.ts +385 -0
- package/types/codegen/cosmos/distribution/v1beta1/query.lcd.d.ts +17 -0
- package/types/codegen/cosmos/distribution/v1beta1/query.rpc.query.d.ts +39 -0
- package/types/codegen/cosmos/distribution/v1beta1/tx.amino.d.ts +54 -0
- package/types/codegen/cosmos/distribution/v1beta1/tx.d.ts +133 -0
- package/types/codegen/cosmos/distribution/v1beta1/tx.registry.d.ts +60 -0
- package/types/codegen/cosmos/distribution/v1beta1/tx.rpc.msg.d.ts +17 -0
- package/types/codegen/cosmos/evidence/v1beta1/evidence.d.ts +19 -0
- package/types/codegen/cosmos/evidence/v1beta1/genesis.d.ts +15 -0
- package/types/codegen/cosmos/evidence/v1beta1/query.d.ts +60 -0
- package/types/codegen/cosmos/evidence/v1beta1/query.lcd.d.ts +9 -0
- package/types/codegen/cosmos/evidence/v1beta1/query.rpc.query.d.ts +13 -0
- package/types/codegen/cosmos/evidence/v1beta1/tx.amino.d.ts +19 -0
- package/types/codegen/cosmos/evidence/v1beta1/tx.d.ts +30 -0
- package/types/codegen/cosmos/evidence/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/evidence/v1beta1/tx.rpc.msg.d.ts +11 -0
- package/types/codegen/cosmos/feegrant/v1beta1/feegrant.d.ts +89 -0
- package/types/codegen/cosmos/feegrant/v1beta1/genesis.d.ts +14 -0
- package/types/codegen/cosmos/feegrant/v1beta1/query.d.ts +84 -0
- package/types/codegen/cosmos/feegrant/v1beta1/query.lcd.d.ts +10 -0
- package/types/codegen/cosmos/feegrant/v1beta1/query.rpc.query.d.ts +15 -0
- package/types/codegen/cosmos/feegrant/v1beta1/tx.amino.d.ts +32 -0
- package/types/codegen/cosmos/feegrant/v1beta1/tx.d.ts +56 -0
- package/types/codegen/cosmos/feegrant/v1beta1/tx.registry.d.ts +56 -0
- package/types/codegen/cosmos/feegrant/v1beta1/tx.rpc.msg.d.ts +13 -0
- package/types/codegen/cosmos/genutil/v1beta1/genesis.d.ts +14 -0
- package/types/codegen/cosmos/gov/v1/genesis.d.ts +42 -0
- package/types/codegen/cosmos/gov/v1/gov.d.ts +301 -0
- package/types/codegen/cosmos/gov/v1/query.d.ts +298 -0
- package/types/codegen/cosmos/gov/v1/query.lcd.d.ts +16 -0
- package/types/codegen/cosmos/gov/v1/query.rpc.query.d.ts +36 -0
- package/types/codegen/cosmos/gov/v1/tx.amino.d.ts +86 -0
- package/types/codegen/cosmos/gov/v1/tx.d.ts +169 -0
- package/types/codegen/cosmos/gov/v1/tx.registry.d.ts +72 -0
- package/types/codegen/cosmos/gov/v1/tx.rpc.msg.d.ts +19 -0
- package/types/codegen/cosmos/gov/v1beta1/genesis.d.ts +42 -0
- package/types/codegen/cosmos/gov/v1beta1/gov.d.ts +338 -0
- package/types/codegen/cosmos/gov/v1beta1/query.d.ts +298 -0
- package/types/codegen/cosmos/gov/v1beta1/query.lcd.d.ts +16 -0
- package/types/codegen/cosmos/gov/v1beta1/query.rpc.query.d.ts +36 -0
- package/types/codegen/cosmos/gov/v1beta1/tx.amino.d.ts +68 -0
- package/types/codegen/cosmos/gov/v1beta1/tx.d.ts +141 -0
- package/types/codegen/cosmos/gov/v1beta1/tx.registry.d.ts +60 -0
- package/types/codegen/cosmos/gov/v1beta1/tx.rpc.msg.d.ts +17 -0
- package/types/codegen/cosmos/group/v1/events.d.ts +115 -0
- package/types/codegen/cosmos/group/v1/genesis.d.ts +38 -0
- package/types/codegen/cosmos/group/v1/query.d.ts +350 -0
- package/types/codegen/cosmos/group/v1/query.lcd.d.ts +20 -0
- package/types/codegen/cosmos/group/v1/query.rpc.query.d.ts +35 -0
- package/types/codegen/cosmos/group/v1/tx.amino.d.ts +227 -0
- package/types/codegen/cosmos/group/v1/tx.d.ts +419 -0
- package/types/codegen/cosmos/group/v1/tx.registry.d.ts +296 -0
- package/types/codegen/cosmos/group/v1/tx.rpc.msg.d.ts +37 -0
- package/types/codegen/cosmos/group/v1/types.d.ts +324 -0
- package/types/codegen/cosmos/lcd.d.ts +28 -0
- package/types/codegen/cosmos/mint/v1beta1/genesis.d.ts +17 -0
- package/types/codegen/cosmos/mint/v1beta1/mint.d.ts +38 -0
- package/types/codegen/cosmos/mint/v1beta1/query.d.ts +78 -0
- package/types/codegen/cosmos/mint/v1beta1/query.lcd.d.ts +10 -0
- package/types/codegen/cosmos/mint/v1beta1/query.rpc.query.d.ts +15 -0
- package/types/codegen/cosmos/msg/v1/msg.d.ts +1 -0
- package/types/codegen/cosmos/nft/v1beta1/event.d.ts +42 -0
- package/types/codegen/cosmos/nft/v1beta1/genesis.d.ts +30 -0
- package/types/codegen/cosmos/nft/v1beta1/nft.d.ts +47 -0
- package/types/codegen/cosmos/nft/v1beta1/query.d.ts +166 -0
- package/types/codegen/cosmos/nft/v1beta1/query.lcd.d.ts +14 -0
- package/types/codegen/cosmos/nft/v1beta1/query.rpc.query.d.ts +23 -0
- package/types/codegen/cosmos/nft/v1beta1/tx.amino.d.ts +18 -0
- package/types/codegen/cosmos/nft/v1beta1/tx.d.ts +30 -0
- package/types/codegen/cosmos/nft/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/nft/v1beta1/tx.rpc.msg.d.ts +11 -0
- package/types/codegen/cosmos/orm/v1/orm.d.ts +117 -0
- package/types/codegen/cosmos/orm/v1alpha1/schema.d.ts +90 -0
- package/types/codegen/cosmos/params/v1beta1/params.d.ts +31 -0
- package/types/codegen/cosmos/params/v1beta1/query.d.ts +71 -0
- package/types/codegen/cosmos/params/v1beta1/query.lcd.d.ts +9 -0
- package/types/codegen/cosmos/params/v1beta1/query.rpc.query.d.ts +13 -0
- package/types/codegen/cosmos/rpc.query.d.ts +97 -0
- package/types/codegen/cosmos/rpc.tx.d.ts +26 -0
- package/types/codegen/cosmos/slashing/v1beta1/genesis.d.ts +70 -0
- package/types/codegen/cosmos/slashing/v1beta1/query.d.ts +85 -0
- package/types/codegen/cosmos/slashing/v1beta1/query.lcd.d.ts +10 -0
- package/types/codegen/cosmos/slashing/v1beta1/query.rpc.query.d.ts +15 -0
- package/types/codegen/cosmos/slashing/v1beta1/slashing.d.ts +52 -0
- package/types/codegen/cosmos/slashing/v1beta1/tx.amino.d.ts +15 -0
- package/types/codegen/cosmos/slashing/v1beta1/tx.d.ts +23 -0
- package/types/codegen/cosmos/slashing/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/slashing/v1beta1/tx.rpc.msg.d.ts +11 -0
- package/types/codegen/cosmos/staking/v1beta1/authz.d.ts +97 -0
- package/types/codegen/cosmos/staking/v1beta1/genesis.d.ts +75 -0
- package/types/codegen/cosmos/staking/v1beta1/query.d.ts +592 -0
- package/types/codegen/cosmos/staking/v1beta1/query.lcd.d.ts +22 -0
- package/types/codegen/cosmos/staking/v1beta1/query.rpc.query.d.ts +54 -0
- package/types/codegen/cosmos/staking/v1beta1/staking.d.ts +568 -0
- package/types/codegen/cosmos/staking/v1beta1/tx.amino.d.ts +106 -0
- package/types/codegen/cosmos/staking/v1beta1/tx.d.ts +191 -0
- package/types/codegen/cosmos/staking/v1beta1/tx.registry.d.ts +72 -0
- package/types/codegen/cosmos/staking/v1beta1/tx.rpc.msg.d.ts +19 -0
- package/types/codegen/cosmos/tx/signing/v1beta1/signing.d.ts +203 -0
- package/types/codegen/cosmos/tx/v1beta1/service.d.ts +339 -0
- package/types/codegen/cosmos/tx/v1beta1/service.lcd.d.ts +11 -0
- package/types/codegen/cosmos/tx/v1beta1/service.rpc.svc.d.ts +27 -0
- package/types/codegen/cosmos/tx/v1beta1/tx.d.ts +603 -0
- package/types/codegen/cosmos/upgrade/v1beta1/query.d.ts +233 -0
- package/types/codegen/cosmos/upgrade/v1beta1/query.lcd.d.ts +13 -0
- package/types/codegen/cosmos/upgrade/v1beta1/query.rpc.query.d.ts +27 -0
- package/types/codegen/cosmos/upgrade/v1beta1/tx.amino.d.ts +39 -0
- package/types/codegen/cosmos/upgrade/v1beta1/tx.d.ts +91 -0
- package/types/codegen/cosmos/upgrade/v1beta1/tx.registry.d.ts +36 -0
- package/types/codegen/cosmos/upgrade/v1beta1/tx.rpc.msg.d.ts +13 -0
- package/types/codegen/cosmos/upgrade/v1beta1/upgrade.d.ts +165 -0
- package/types/codegen/cosmos/vesting/v1beta1/tx.amino.d.ts +58 -0
- package/types/codegen/cosmos/vesting/v1beta1/tx.d.ts +88 -0
- package/types/codegen/cosmos/vesting/v1beta1/tx.registry.d.ts +76 -0
- package/types/codegen/cosmos/vesting/v1beta1/tx.rpc.msg.d.ts +15 -0
- package/types/codegen/cosmos/vesting/v1beta1/vesting.d.ts +97 -0
- package/types/codegen/cosmos_proto/bundle.d.ts +24 -0
- package/types/codegen/cosmos_proto/cosmos.d.ts +124 -0
- package/types/codegen/cosmwasm/bundle.d.ts +1109 -0
- package/types/codegen/cosmwasm/client.d.ts +120 -0
- package/types/codegen/cosmwasm/lcd.d.ts +33 -0
- package/types/codegen/cosmwasm/rpc.query.d.ts +112 -0
- package/types/codegen/cosmwasm/rpc.tx.d.ts +31 -0
- package/types/codegen/cosmwasm/wasm/v1/genesis.d.ts +101 -0
- package/types/codegen/cosmwasm/wasm/v1/ibc.d.ts +60 -0
- package/types/codegen/cosmwasm/wasm/v1/proposal.d.ts +297 -0
- package/types/codegen/cosmwasm/wasm/v1/query.d.ts +411 -0
- package/types/codegen/cosmwasm/wasm/v1/query.lcd.d.ts +17 -0
- package/types/codegen/cosmwasm/wasm/v1/query.rpc.query.d.ts +39 -0
- package/types/codegen/cosmwasm/wasm/v1/tx.amino.d.ts +95 -0
- package/types/codegen/cosmwasm/wasm/v1/tx.d.ts +262 -0
- package/types/codegen/cosmwasm/wasm/v1/tx.registry.d.ts +84 -0
- package/types/codegen/cosmwasm/wasm/v1/tx.rpc.msg.d.ts +21 -0
- package/types/codegen/cosmwasm/wasm/v1/types.d.ts +247 -0
- package/types/codegen/gogoproto/bundle.d.ts +1 -0
- package/types/codegen/gogoproto/gogo.d.ts +1 -0
- package/types/codegen/google/api/annotations.d.ts +1 -0
- package/types/codegen/google/api/http.d.ts +375 -0
- package/types/codegen/google/bundle.d.ts +1545 -0
- package/types/codegen/google/protobuf/any.d.ts +237 -0
- package/types/codegen/google/protobuf/descriptor.d.ts +1725 -0
- package/types/codegen/google/protobuf/duration.d.ts +161 -0
- package/types/codegen/google/protobuf/empty.d.ts +33 -0
- package/types/codegen/google/protobuf/field_mask.d.ts +417 -0
- package/types/codegen/google/protobuf/struct.d.ts +148 -0
- package/types/codegen/google/protobuf/timestamp.d.ts +205 -0
- package/types/codegen/google/protobuf/wrappers.d.ts +209 -0
- package/types/codegen/ibc/applications/transfer/v1/genesis.d.ts +20 -0
- package/types/codegen/ibc/applications/transfer/v1/query.d.ts +118 -0
- package/types/codegen/ibc/applications/transfer/v1/query.lcd.d.ts +11 -0
- package/types/codegen/ibc/applications/transfer/v1/query.rpc.query.d.ts +21 -0
- package/types/codegen/ibc/applications/transfer/v1/transfer.d.ts +74 -0
- package/types/codegen/ibc/applications/transfer/v1/tx.amino.d.ts +25 -0
- package/types/codegen/ibc/applications/transfer/v1/tx.d.ts +74 -0
- package/types/codegen/ibc/applications/transfer/v1/tx.registry.d.ts +24 -0
- package/types/codegen/ibc/applications/transfer/v1/tx.rpc.msg.d.ts +11 -0
- package/types/codegen/ibc/applications/transfer/v2/packet.d.ts +37 -0
- package/types/codegen/ibc/bundle.d.ts +3781 -0
- package/types/codegen/ibc/client.d.ts +559 -0
- package/types/codegen/ibc/core/channel/v1/channel.d.ts +313 -0
- package/types/codegen/ibc/core/channel/v1/genesis.d.ts +55 -0
- package/types/codegen/ibc/core/channel/v1/query.d.ts +726 -0
- package/types/codegen/ibc/core/channel/v1/query.lcd.d.ts +21 -0
- package/types/codegen/ibc/core/channel/v1/query.rpc.query.d.ts +51 -0
- package/types/codegen/ibc/core/channel/v1/tx.amino.d.ts +209 -0
- package/types/codegen/ibc/core/channel/v1/tx.d.ts +380 -0
- package/types/codegen/ibc/core/channel/v1/tx.registry.d.ts +132 -0
- package/types/codegen/ibc/core/channel/v1/tx.rpc.msg.d.ts +29 -0
- package/types/codegen/ibc/core/client/v1/client.d.ts +219 -0
- package/types/codegen/ibc/core/client/v1/genesis.d.ts +82 -0
- package/types/codegen/ibc/core/client/v1/query.d.ts +377 -0
- package/types/codegen/ibc/core/client/v1/query.lcd.d.ts +16 -0
- package/types/codegen/ibc/core/client/v1/query.rpc.query.d.ts +36 -0
- package/types/codegen/ibc/core/client/v1/tx.amino.d.ts +77 -0
- package/types/codegen/ibc/core/client/v1/tx.d.ts +187 -0
- package/types/codegen/ibc/core/client/v1/tx.registry.d.ts +60 -0
- package/types/codegen/ibc/core/client/v1/tx.rpc.msg.d.ts +17 -0
- package/types/codegen/ibc/core/commitment/v1/commitment.d.ts +89 -0
- package/types/codegen/ibc/core/connection/v1/connection.d.ts +260 -0
- package/types/codegen/ibc/core/connection/v1/genesis.d.ts +24 -0
- package/types/codegen/ibc/core/connection/v1/query.d.ts +264 -0
- package/types/codegen/ibc/core/connection/v1/query.lcd.d.ts +13 -0
- package/types/codegen/ibc/core/connection/v1/query.rpc.query.d.ts +27 -0
- package/types/codegen/ibc/core/connection/v1/tx.amino.d.ts +103 -0
- package/types/codegen/ibc/core/connection/v1/tx.d.ts +225 -0
- package/types/codegen/ibc/core/connection/v1/tx.registry.d.ts +60 -0
- package/types/codegen/ibc/core/connection/v1/tx.rpc.msg.d.ts +17 -0
- package/types/codegen/ibc/core/port/v1/query.d.ts +37 -0
- package/types/codegen/ibc/core/port/v1/query.rpc.query.d.ts +11 -0
- package/types/codegen/ibc/core/types/v1/genesis.d.ts +21 -0
- package/types/codegen/ibc/lcd.d.ts +46 -0
- package/types/codegen/ibc/lightclients/localhost/v1/localhost.d.ts +28 -0
- package/types/codegen/ibc/lightclients/solomachine/v1/solomachine.d.ts +433 -0
- package/types/codegen/ibc/lightclients/solomachine/v2/solomachine.d.ts +433 -0
- package/types/codegen/ibc/lightclients/tendermint/v1/tendermint.d.ts +215 -0
- package/types/codegen/ibc/rpc.query.d.ts +148 -0
- package/types/codegen/ibc/rpc.tx.d.ts +44 -0
- package/types/codegen/ics23/bundle.d.ts +545 -0
- package/types/codegen/index.d.ts +18 -0
- package/types/codegen/juno/bundle.d.ts +226 -0
- package/types/codegen/juno/lcd.d.ts +31 -0
- package/types/codegen/juno/mint/genesis.d.ts +22 -0
- package/types/codegen/juno/mint/mint.d.ts +44 -0
- package/types/codegen/juno/mint/query.d.ts +99 -0
- package/types/codegen/juno/mint/query.lcd.d.ts +11 -0
- package/types/codegen/juno/mint/query.rpc.query.d.ts +21 -0
- package/types/codegen/juno/rpc.query.d.ts +104 -0
- package/types/codegen/tendermint/abci/types.d.ts +902 -0
- package/types/codegen/tendermint/bundle.d.ts +2065 -0
- package/types/codegen/tendermint/crypto/keys.d.ts +17 -0
- package/types/codegen/tendermint/crypto/proof.d.ts +89 -0
- package/types/codegen/tendermint/libs/bits/types.d.ts +15 -0
- package/types/codegen/tendermint/p2p/types.d.ts +87 -0
- package/types/codegen/tendermint/types/block.d.ts +21 -0
- package/types/codegen/tendermint/types/evidence.d.ts +70 -0
- package/types/codegen/tendermint/types/params.d.ts +181 -0
- package/types/codegen/tendermint/types/types.d.ts +326 -0
- package/types/codegen/tendermint/types/validator.d.ts +48 -0
- package/types/codegen/tendermint/version/types.d.ts +48 -0
- package/types/index.d.ts +1 -0
@@ -0,0 +1,495 @@
|
|
1
|
+
import * as _m0 from "protobufjs/minimal";
|
2
|
+
import { DeepPartial } from "@osmonauts/helpers";
|
3
|
+
export declare 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
|
+
/** BITCOIN - ripemd160(sha256(x)) */
|
11
|
+
BITCOIN = 5,
|
12
|
+
UNRECOGNIZED = -1
|
13
|
+
}
|
14
|
+
export declare enum HashOpSDKType {
|
15
|
+
/** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
|
16
|
+
NO_HASH = 0,
|
17
|
+
SHA256 = 1,
|
18
|
+
SHA512 = 2,
|
19
|
+
KECCAK = 3,
|
20
|
+
RIPEMD160 = 4,
|
21
|
+
/** BITCOIN - ripemd160(sha256(x)) */
|
22
|
+
BITCOIN = 5,
|
23
|
+
UNRECOGNIZED = -1
|
24
|
+
}
|
25
|
+
export declare function hashOpFromJSON(object: any): HashOp;
|
26
|
+
export declare function hashOpToJSON(object: HashOp): string;
|
27
|
+
/**
|
28
|
+
* LengthOp defines how to process the key and value of the LeafOp
|
29
|
+
* to include length information. After encoding the length with the given
|
30
|
+
* algorithm, the length will be prepended to the key and value bytes.
|
31
|
+
* (Each one with it's own encoded length)
|
32
|
+
*/
|
33
|
+
export declare enum LengthOp {
|
34
|
+
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
35
|
+
NO_PREFIX = 0,
|
36
|
+
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
37
|
+
VAR_PROTO = 1,
|
38
|
+
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
39
|
+
VAR_RLP = 2,
|
40
|
+
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
41
|
+
FIXED32_BIG = 3,
|
42
|
+
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
43
|
+
FIXED32_LITTLE = 4,
|
44
|
+
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
45
|
+
FIXED64_BIG = 5,
|
46
|
+
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
47
|
+
FIXED64_LITTLE = 6,
|
48
|
+
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
49
|
+
REQUIRE_32_BYTES = 7,
|
50
|
+
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
51
|
+
REQUIRE_64_BYTES = 8,
|
52
|
+
UNRECOGNIZED = -1
|
53
|
+
}
|
54
|
+
/**
|
55
|
+
* LengthOp defines how to process the key and value of the LeafOp
|
56
|
+
* to include length information. After encoding the length with the given
|
57
|
+
* algorithm, the length will be prepended to the key and value bytes.
|
58
|
+
* (Each one with it's own encoded length)
|
59
|
+
*/
|
60
|
+
export declare enum LengthOpSDKType {
|
61
|
+
/** NO_PREFIX - NO_PREFIX don't include any length info */
|
62
|
+
NO_PREFIX = 0,
|
63
|
+
/** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
|
64
|
+
VAR_PROTO = 1,
|
65
|
+
/** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
|
66
|
+
VAR_RLP = 2,
|
67
|
+
/** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
|
68
|
+
FIXED32_BIG = 3,
|
69
|
+
/** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
|
70
|
+
FIXED32_LITTLE = 4,
|
71
|
+
/** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
|
72
|
+
FIXED64_BIG = 5,
|
73
|
+
/** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
|
74
|
+
FIXED64_LITTLE = 6,
|
75
|
+
/** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
|
76
|
+
REQUIRE_32_BYTES = 7,
|
77
|
+
/** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
|
78
|
+
REQUIRE_64_BYTES = 8,
|
79
|
+
UNRECOGNIZED = -1
|
80
|
+
}
|
81
|
+
export declare function lengthOpFromJSON(object: any): LengthOp;
|
82
|
+
export declare function lengthOpToJSON(object: LengthOp): string;
|
83
|
+
/**
|
84
|
+
* ExistenceProof takes a key and a value and a set of steps to perform on it.
|
85
|
+
* The result of peforming all these steps will provide a "root hash", which can
|
86
|
+
* be compared to the value in a header.
|
87
|
+
*
|
88
|
+
* Since it is computationally infeasible to produce a hash collission for any of the used
|
89
|
+
* cryptographic hash functions, if someone can provide a series of operations to transform
|
90
|
+
* a given key and value into a root hash that matches some trusted root, these key and values
|
91
|
+
* must be in the referenced merkle tree.
|
92
|
+
*
|
93
|
+
* The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
|
94
|
+
* which should be controlled by a spec. Eg. with lengthOp as NONE,
|
95
|
+
* prefix = FOO, key = BAR, value = CHOICE
|
96
|
+
* and
|
97
|
+
* prefix = F, key = OOBAR, value = CHOICE
|
98
|
+
* would produce the same value.
|
99
|
+
*
|
100
|
+
* With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
|
101
|
+
* in the ProofSpec is valuable to prevent this mutability. And why all trees should
|
102
|
+
* length-prefix the data before hashing it.
|
103
|
+
*/
|
104
|
+
export interface ExistenceProof {
|
105
|
+
key: Uint8Array;
|
106
|
+
value: Uint8Array;
|
107
|
+
leaf: LeafOp;
|
108
|
+
path: InnerOp[];
|
109
|
+
}
|
110
|
+
/**
|
111
|
+
* ExistenceProof takes a key and a value and a set of steps to perform on it.
|
112
|
+
* The result of peforming all these steps will provide a "root hash", which can
|
113
|
+
* be compared to the value in a header.
|
114
|
+
*
|
115
|
+
* Since it is computationally infeasible to produce a hash collission for any of the used
|
116
|
+
* cryptographic hash functions, if someone can provide a series of operations to transform
|
117
|
+
* a given key and value into a root hash that matches some trusted root, these key and values
|
118
|
+
* must be in the referenced merkle tree.
|
119
|
+
*
|
120
|
+
* The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
|
121
|
+
* which should be controlled by a spec. Eg. with lengthOp as NONE,
|
122
|
+
* prefix = FOO, key = BAR, value = CHOICE
|
123
|
+
* and
|
124
|
+
* prefix = F, key = OOBAR, value = CHOICE
|
125
|
+
* would produce the same value.
|
126
|
+
*
|
127
|
+
* With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
|
128
|
+
* in the ProofSpec is valuable to prevent this mutability. And why all trees should
|
129
|
+
* length-prefix the data before hashing it.
|
130
|
+
*/
|
131
|
+
export interface ExistenceProofSDKType {
|
132
|
+
key: Uint8Array;
|
133
|
+
value: Uint8Array;
|
134
|
+
leaf: LeafOpSDKType;
|
135
|
+
path: InnerOpSDKType[];
|
136
|
+
}
|
137
|
+
/**
|
138
|
+
* NonExistenceProof takes a proof of two neighbors, one left of the desired key,
|
139
|
+
* one right of the desired key. If both proofs are valid AND they are neighbors,
|
140
|
+
* then there is no valid proof for the given key.
|
141
|
+
*/
|
142
|
+
export interface NonExistenceProof {
|
143
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
144
|
+
key: Uint8Array;
|
145
|
+
left: ExistenceProof;
|
146
|
+
right: ExistenceProof;
|
147
|
+
}
|
148
|
+
/**
|
149
|
+
* NonExistenceProof takes a proof of two neighbors, one left of the desired key,
|
150
|
+
* one right of the desired key. If both proofs are valid AND they are neighbors,
|
151
|
+
* then there is no valid proof for the given key.
|
152
|
+
*/
|
153
|
+
export interface NonExistenceProofSDKType {
|
154
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
155
|
+
key: Uint8Array;
|
156
|
+
left: ExistenceProofSDKType;
|
157
|
+
right: ExistenceProofSDKType;
|
158
|
+
}
|
159
|
+
/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
|
160
|
+
export interface CommitmentProof {
|
161
|
+
exist?: ExistenceProof;
|
162
|
+
nonexist?: NonExistenceProof;
|
163
|
+
batch?: BatchProof;
|
164
|
+
compressed?: CompressedBatchProof;
|
165
|
+
}
|
166
|
+
/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
|
167
|
+
export interface CommitmentProofSDKType {
|
168
|
+
exist?: ExistenceProofSDKType;
|
169
|
+
nonexist?: NonExistenceProofSDKType;
|
170
|
+
batch?: BatchProofSDKType;
|
171
|
+
compressed?: CompressedBatchProofSDKType;
|
172
|
+
}
|
173
|
+
/**
|
174
|
+
* LeafOp represents the raw key-value data we wish to prove, and
|
175
|
+
* must be flexible to represent the internal transformation from
|
176
|
+
* the original key-value pairs into the basis hash, for many existing
|
177
|
+
* merkle trees.
|
178
|
+
*
|
179
|
+
* key and value are passed in. So that the signature of this operation is:
|
180
|
+
* leafOp(key, value) -> output
|
181
|
+
*
|
182
|
+
* To process this, first prehash the keys and values if needed (ANY means no hash in this case):
|
183
|
+
* hkey = prehashKey(key)
|
184
|
+
* hvalue = prehashValue(value)
|
185
|
+
*
|
186
|
+
* Then combine the bytes, and hash it
|
187
|
+
* output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
|
188
|
+
*/
|
189
|
+
export interface LeafOp {
|
190
|
+
hash: HashOp;
|
191
|
+
prehashKey: HashOp;
|
192
|
+
prehashValue: HashOp;
|
193
|
+
length: LengthOp;
|
194
|
+
/**
|
195
|
+
* prefix is a fixed bytes that may optionally be included at the beginning to differentiate
|
196
|
+
* a leaf node from an inner node.
|
197
|
+
*/
|
198
|
+
prefix: Uint8Array;
|
199
|
+
}
|
200
|
+
/**
|
201
|
+
* LeafOp represents the raw key-value data we wish to prove, and
|
202
|
+
* must be flexible to represent the internal transformation from
|
203
|
+
* the original key-value pairs into the basis hash, for many existing
|
204
|
+
* merkle trees.
|
205
|
+
*
|
206
|
+
* key and value are passed in. So that the signature of this operation is:
|
207
|
+
* leafOp(key, value) -> output
|
208
|
+
*
|
209
|
+
* To process this, first prehash the keys and values if needed (ANY means no hash in this case):
|
210
|
+
* hkey = prehashKey(key)
|
211
|
+
* hvalue = prehashValue(value)
|
212
|
+
*
|
213
|
+
* Then combine the bytes, and hash it
|
214
|
+
* output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
|
215
|
+
*/
|
216
|
+
export interface LeafOpSDKType {
|
217
|
+
hash: HashOpSDKType;
|
218
|
+
prehash_key: HashOpSDKType;
|
219
|
+
prehash_value: HashOpSDKType;
|
220
|
+
length: LengthOpSDKType;
|
221
|
+
/**
|
222
|
+
* prefix is a fixed bytes that may optionally be included at the beginning to differentiate
|
223
|
+
* a leaf node from an inner node.
|
224
|
+
*/
|
225
|
+
prefix: Uint8Array;
|
226
|
+
}
|
227
|
+
/**
|
228
|
+
* InnerOp represents a merkle-proof step that is not a leaf.
|
229
|
+
* It represents concatenating two children and hashing them to provide the next result.
|
230
|
+
*
|
231
|
+
* The result of the previous step is passed in, so the signature of this op is:
|
232
|
+
* innerOp(child) -> output
|
233
|
+
*
|
234
|
+
* The result of applying InnerOp should be:
|
235
|
+
* output = op.hash(op.prefix || child || op.suffix)
|
236
|
+
*
|
237
|
+
* where the || operator is concatenation of binary data,
|
238
|
+
* and child is the result of hashing all the tree below this step.
|
239
|
+
*
|
240
|
+
* Any special data, like prepending child with the length, or prepending the entire operation with
|
241
|
+
* some value to differentiate from leaf nodes, should be included in prefix and suffix.
|
242
|
+
* If either of prefix or suffix is empty, we just treat it as an empty string
|
243
|
+
*/
|
244
|
+
export interface InnerOp {
|
245
|
+
hash: HashOp;
|
246
|
+
prefix: Uint8Array;
|
247
|
+
suffix: Uint8Array;
|
248
|
+
}
|
249
|
+
/**
|
250
|
+
* InnerOp represents a merkle-proof step that is not a leaf.
|
251
|
+
* It represents concatenating two children and hashing them to provide the next result.
|
252
|
+
*
|
253
|
+
* The result of the previous step is passed in, so the signature of this op is:
|
254
|
+
* innerOp(child) -> output
|
255
|
+
*
|
256
|
+
* The result of applying InnerOp should be:
|
257
|
+
* output = op.hash(op.prefix || child || op.suffix)
|
258
|
+
*
|
259
|
+
* where the || operator is concatenation of binary data,
|
260
|
+
* and child is the result of hashing all the tree below this step.
|
261
|
+
*
|
262
|
+
* Any special data, like prepending child with the length, or prepending the entire operation with
|
263
|
+
* some value to differentiate from leaf nodes, should be included in prefix and suffix.
|
264
|
+
* If either of prefix or suffix is empty, we just treat it as an empty string
|
265
|
+
*/
|
266
|
+
export interface InnerOpSDKType {
|
267
|
+
hash: HashOpSDKType;
|
268
|
+
prefix: Uint8Array;
|
269
|
+
suffix: Uint8Array;
|
270
|
+
}
|
271
|
+
/**
|
272
|
+
* ProofSpec defines what the expected parameters are for a given proof type.
|
273
|
+
* This can be stored in the client and used to validate any incoming proofs.
|
274
|
+
*
|
275
|
+
* verify(ProofSpec, Proof) -> Proof | Error
|
276
|
+
*
|
277
|
+
* As demonstrated in tests, if we don't fix the algorithm used to calculate the
|
278
|
+
* LeafHash for a given tree, there are many possible key-value pairs that can
|
279
|
+
* generate a given hash (by interpretting the preimage differently).
|
280
|
+
* We need this for proper security, requires client knows a priori what
|
281
|
+
* tree format server uses. But not in code, rather a configuration object.
|
282
|
+
*/
|
283
|
+
export interface ProofSpec {
|
284
|
+
/**
|
285
|
+
* any field in the ExistenceProof must be the same as in this spec.
|
286
|
+
* except Prefix, which is just the first bytes of prefix (spec can be longer)
|
287
|
+
*/
|
288
|
+
leafSpec: LeafOp;
|
289
|
+
innerSpec: InnerSpec;
|
290
|
+
/** max_depth (if > 0) is the maximum number of InnerOps allowed (mainly for fixed-depth tries) */
|
291
|
+
maxDepth: number;
|
292
|
+
/** min_depth (if > 0) is the minimum number of InnerOps allowed (mainly for fixed-depth tries) */
|
293
|
+
minDepth: number;
|
294
|
+
}
|
295
|
+
/**
|
296
|
+
* ProofSpec defines what the expected parameters are for a given proof type.
|
297
|
+
* This can be stored in the client and used to validate any incoming proofs.
|
298
|
+
*
|
299
|
+
* verify(ProofSpec, Proof) -> Proof | Error
|
300
|
+
*
|
301
|
+
* As demonstrated in tests, if we don't fix the algorithm used to calculate the
|
302
|
+
* LeafHash for a given tree, there are many possible key-value pairs that can
|
303
|
+
* generate a given hash (by interpretting the preimage differently).
|
304
|
+
* We need this for proper security, requires client knows a priori what
|
305
|
+
* tree format server uses. But not in code, rather a configuration object.
|
306
|
+
*/
|
307
|
+
export interface ProofSpecSDKType {
|
308
|
+
/**
|
309
|
+
* any field in the ExistenceProof must be the same as in this spec.
|
310
|
+
* except Prefix, which is just the first bytes of prefix (spec can be longer)
|
311
|
+
*/
|
312
|
+
leaf_spec: LeafOpSDKType;
|
313
|
+
inner_spec: InnerSpecSDKType;
|
314
|
+
/** max_depth (if > 0) is the maximum number of InnerOps allowed (mainly for fixed-depth tries) */
|
315
|
+
max_depth: number;
|
316
|
+
/** min_depth (if > 0) is the minimum number of InnerOps allowed (mainly for fixed-depth tries) */
|
317
|
+
min_depth: number;
|
318
|
+
}
|
319
|
+
/**
|
320
|
+
* InnerSpec contains all store-specific structure info to determine if two proofs from a
|
321
|
+
* given store are neighbors.
|
322
|
+
*
|
323
|
+
* This enables:
|
324
|
+
*
|
325
|
+
* isLeftMost(spec: InnerSpec, op: InnerOp)
|
326
|
+
* isRightMost(spec: InnerSpec, op: InnerOp)
|
327
|
+
* isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
|
328
|
+
*/
|
329
|
+
export interface InnerSpec {
|
330
|
+
/**
|
331
|
+
* Child order is the ordering of the children node, must count from 0
|
332
|
+
* iavl tree is [0, 1] (left then right)
|
333
|
+
* merk is [0, 2, 1] (left, right, here)
|
334
|
+
*/
|
335
|
+
childOrder: number[];
|
336
|
+
childSize: number;
|
337
|
+
minPrefixLength: number;
|
338
|
+
maxPrefixLength: number;
|
339
|
+
/** empty child is the prehash image that is used when one child is nil (eg. 20 bytes of 0) */
|
340
|
+
emptyChild: Uint8Array;
|
341
|
+
/** hash is the algorithm that must be used for each InnerOp */
|
342
|
+
hash: HashOp;
|
343
|
+
}
|
344
|
+
/**
|
345
|
+
* InnerSpec contains all store-specific structure info to determine if two proofs from a
|
346
|
+
* given store are neighbors.
|
347
|
+
*
|
348
|
+
* This enables:
|
349
|
+
*
|
350
|
+
* isLeftMost(spec: InnerSpec, op: InnerOp)
|
351
|
+
* isRightMost(spec: InnerSpec, op: InnerOp)
|
352
|
+
* isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
|
353
|
+
*/
|
354
|
+
export interface InnerSpecSDKType {
|
355
|
+
/**
|
356
|
+
* Child order is the ordering of the children node, must count from 0
|
357
|
+
* iavl tree is [0, 1] (left then right)
|
358
|
+
* merk is [0, 2, 1] (left, right, here)
|
359
|
+
*/
|
360
|
+
child_order: number[];
|
361
|
+
child_size: number;
|
362
|
+
min_prefix_length: number;
|
363
|
+
max_prefix_length: number;
|
364
|
+
/** empty child is the prehash image that is used when one child is nil (eg. 20 bytes of 0) */
|
365
|
+
empty_child: Uint8Array;
|
366
|
+
/** hash is the algorithm that must be used for each InnerOp */
|
367
|
+
hash: HashOpSDKType;
|
368
|
+
}
|
369
|
+
/** BatchProof is a group of multiple proof types than can be compressed */
|
370
|
+
export interface BatchProof {
|
371
|
+
entries: BatchEntry[];
|
372
|
+
}
|
373
|
+
/** BatchProof is a group of multiple proof types than can be compressed */
|
374
|
+
export interface BatchProofSDKType {
|
375
|
+
entries: BatchEntrySDKType[];
|
376
|
+
}
|
377
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
378
|
+
export interface BatchEntry {
|
379
|
+
exist?: ExistenceProof;
|
380
|
+
nonexist?: NonExistenceProof;
|
381
|
+
}
|
382
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
383
|
+
export interface BatchEntrySDKType {
|
384
|
+
exist?: ExistenceProofSDKType;
|
385
|
+
nonexist?: NonExistenceProofSDKType;
|
386
|
+
}
|
387
|
+
export interface CompressedBatchProof {
|
388
|
+
entries: CompressedBatchEntry[];
|
389
|
+
lookupInners: InnerOp[];
|
390
|
+
}
|
391
|
+
export interface CompressedBatchProofSDKType {
|
392
|
+
entries: CompressedBatchEntrySDKType[];
|
393
|
+
lookup_inners: InnerOpSDKType[];
|
394
|
+
}
|
395
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
396
|
+
export interface CompressedBatchEntry {
|
397
|
+
exist?: CompressedExistenceProof;
|
398
|
+
nonexist?: CompressedNonExistenceProof;
|
399
|
+
}
|
400
|
+
/** Use BatchEntry not CommitmentProof, to avoid recursion */
|
401
|
+
export interface CompressedBatchEntrySDKType {
|
402
|
+
exist?: CompressedExistenceProofSDKType;
|
403
|
+
nonexist?: CompressedNonExistenceProofSDKType;
|
404
|
+
}
|
405
|
+
export interface CompressedExistenceProof {
|
406
|
+
key: Uint8Array;
|
407
|
+
value: Uint8Array;
|
408
|
+
leaf: LeafOp;
|
409
|
+
/** these are indexes into the lookup_inners table in CompressedBatchProof */
|
410
|
+
path: number[];
|
411
|
+
}
|
412
|
+
export interface CompressedExistenceProofSDKType {
|
413
|
+
key: Uint8Array;
|
414
|
+
value: Uint8Array;
|
415
|
+
leaf: LeafOpSDKType;
|
416
|
+
/** these are indexes into the lookup_inners table in CompressedBatchProof */
|
417
|
+
path: number[];
|
418
|
+
}
|
419
|
+
export interface CompressedNonExistenceProof {
|
420
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
421
|
+
key: Uint8Array;
|
422
|
+
left: CompressedExistenceProof;
|
423
|
+
right: CompressedExistenceProof;
|
424
|
+
}
|
425
|
+
export interface CompressedNonExistenceProofSDKType {
|
426
|
+
/** TODO: remove this as unnecessary??? we prove a range */
|
427
|
+
key: Uint8Array;
|
428
|
+
left: CompressedExistenceProofSDKType;
|
429
|
+
right: CompressedExistenceProofSDKType;
|
430
|
+
}
|
431
|
+
export declare const ExistenceProof: {
|
432
|
+
encode(message: ExistenceProof, writer?: _m0.Writer): _m0.Writer;
|
433
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ExistenceProof;
|
434
|
+
fromPartial(object: DeepPartial<ExistenceProof>): ExistenceProof;
|
435
|
+
};
|
436
|
+
export declare const NonExistenceProof: {
|
437
|
+
encode(message: NonExistenceProof, writer?: _m0.Writer): _m0.Writer;
|
438
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): NonExistenceProof;
|
439
|
+
fromPartial(object: DeepPartial<NonExistenceProof>): NonExistenceProof;
|
440
|
+
};
|
441
|
+
export declare const CommitmentProof: {
|
442
|
+
encode(message: CommitmentProof, writer?: _m0.Writer): _m0.Writer;
|
443
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CommitmentProof;
|
444
|
+
fromPartial(object: DeepPartial<CommitmentProof>): CommitmentProof;
|
445
|
+
};
|
446
|
+
export declare const LeafOp: {
|
447
|
+
encode(message: LeafOp, writer?: _m0.Writer): _m0.Writer;
|
448
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): LeafOp;
|
449
|
+
fromPartial(object: DeepPartial<LeafOp>): LeafOp;
|
450
|
+
};
|
451
|
+
export declare const InnerOp: {
|
452
|
+
encode(message: InnerOp, writer?: _m0.Writer): _m0.Writer;
|
453
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): InnerOp;
|
454
|
+
fromPartial(object: DeepPartial<InnerOp>): InnerOp;
|
455
|
+
};
|
456
|
+
export declare const ProofSpec: {
|
457
|
+
encode(message: ProofSpec, writer?: _m0.Writer): _m0.Writer;
|
458
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ProofSpec;
|
459
|
+
fromPartial(object: DeepPartial<ProofSpec>): ProofSpec;
|
460
|
+
};
|
461
|
+
export declare const InnerSpec: {
|
462
|
+
encode(message: InnerSpec, writer?: _m0.Writer): _m0.Writer;
|
463
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): InnerSpec;
|
464
|
+
fromPartial(object: DeepPartial<InnerSpec>): InnerSpec;
|
465
|
+
};
|
466
|
+
export declare const BatchProof: {
|
467
|
+
encode(message: BatchProof, writer?: _m0.Writer): _m0.Writer;
|
468
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): BatchProof;
|
469
|
+
fromPartial(object: DeepPartial<BatchProof>): BatchProof;
|
470
|
+
};
|
471
|
+
export declare const BatchEntry: {
|
472
|
+
encode(message: BatchEntry, writer?: _m0.Writer): _m0.Writer;
|
473
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): BatchEntry;
|
474
|
+
fromPartial(object: DeepPartial<BatchEntry>): BatchEntry;
|
475
|
+
};
|
476
|
+
export declare const CompressedBatchProof: {
|
477
|
+
encode(message: CompressedBatchProof, writer?: _m0.Writer): _m0.Writer;
|
478
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedBatchProof;
|
479
|
+
fromPartial(object: DeepPartial<CompressedBatchProof>): CompressedBatchProof;
|
480
|
+
};
|
481
|
+
export declare const CompressedBatchEntry: {
|
482
|
+
encode(message: CompressedBatchEntry, writer?: _m0.Writer): _m0.Writer;
|
483
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedBatchEntry;
|
484
|
+
fromPartial(object: DeepPartial<CompressedBatchEntry>): CompressedBatchEntry;
|
485
|
+
};
|
486
|
+
export declare const CompressedExistenceProof: {
|
487
|
+
encode(message: CompressedExistenceProof, writer?: _m0.Writer): _m0.Writer;
|
488
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedExistenceProof;
|
489
|
+
fromPartial(object: DeepPartial<CompressedExistenceProof>): CompressedExistenceProof;
|
490
|
+
};
|
491
|
+
export declare const CompressedNonExistenceProof: {
|
492
|
+
encode(message: CompressedNonExistenceProof, writer?: _m0.Writer): _m0.Writer;
|
493
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): CompressedNonExistenceProof;
|
494
|
+
fromPartial(object: DeepPartial<CompressedNonExistenceProof>): CompressedNonExistenceProof;
|
495
|
+
};
|
@@ -0,0 +1,12 @@
|
|
1
|
+
/**
|
2
|
+
* This file was automatically generated by @cosmwasm/ts-codegen@0.16.1.
|
3
|
+
* DO NOT MODIFY IT BY HAND. Instead, modify the source JSONSchema file,
|
4
|
+
* and run the @cosmwasm/ts-codegen generate command to regenerate this file.
|
5
|
+
*/
|
6
|
+
import * as _1 from "./JunoSwap.client";
|
7
|
+
export declare namespace contracts {
|
8
|
+
const JunoSwap: {
|
9
|
+
JunoSwapQueryClient: typeof _1.JunoSwapQueryClient;
|
10
|
+
JunoSwapClient: typeof _1.JunoSwapClient;
|
11
|
+
};
|
12
|
+
}
|
@@ -0,0 +1,51 @@
|
|
1
|
+
import { Any } from "../../../google/protobuf/any";
|
2
|
+
import * as _m0 from "protobufjs/minimal";
|
3
|
+
import { DeepPartial } from "@osmonauts/helpers";
|
4
|
+
/**
|
5
|
+
* Config represents the configuration for a Cosmos SDK ABCI app.
|
6
|
+
* It is intended that all state machine logic including the version of
|
7
|
+
* baseapp and tx handlers (and possibly even Tendermint) that an app needs
|
8
|
+
* can be described in a config object. For compatibility, the framework should
|
9
|
+
* allow a mixture of declarative and imperative app wiring, however, apps
|
10
|
+
* that strive for the maximum ease of maintainability should be able to describe
|
11
|
+
* their state machine with a config object alone.
|
12
|
+
*/
|
13
|
+
export interface Config {
|
14
|
+
/** modules are the module configurations for the app. */
|
15
|
+
modules: ModuleConfig[];
|
16
|
+
}
|
17
|
+
/** ModuleConfig is a module configuration for an app. */
|
18
|
+
export interface ModuleConfig {
|
19
|
+
/**
|
20
|
+
* name is the unique name of the module within the app. It should be a name
|
21
|
+
* that persists between different versions of a module so that modules
|
22
|
+
* can be smoothly upgraded to new versions.
|
23
|
+
*
|
24
|
+
* For example, for the module cosmos.bank.module.v1.Module, we may chose
|
25
|
+
* to simply name the module "bank" in the app. When we upgrade to
|
26
|
+
* cosmos.bank.module.v2.Module, the app-specific name "bank" stays the same
|
27
|
+
* and the framework knows that the v2 module should receive all the same state
|
28
|
+
* that the v1 module had. Note: modules should provide info on which versions
|
29
|
+
* they can migrate from in the ModuleDescriptor.can_migration_from field.
|
30
|
+
*/
|
31
|
+
name: string;
|
32
|
+
/**
|
33
|
+
* config is the config object for the module. Module config messages should
|
34
|
+
* define a ModuleDescriptor using the cosmos.app.v1alpha1.is_module extension.
|
35
|
+
*/
|
36
|
+
config: Any;
|
37
|
+
}
|
38
|
+
export declare const Config: {
|
39
|
+
encode(message: Config, writer?: _m0.Writer): _m0.Writer;
|
40
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): Config;
|
41
|
+
fromJSON(object: any): Config;
|
42
|
+
toJSON(message: Config): unknown;
|
43
|
+
fromPartial(object: DeepPartial<Config>): Config;
|
44
|
+
};
|
45
|
+
export declare const ModuleConfig: {
|
46
|
+
encode(message: ModuleConfig, writer?: _m0.Writer): _m0.Writer;
|
47
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ModuleConfig;
|
48
|
+
fromJSON(object: any): ModuleConfig;
|
49
|
+
toJSON(message: ModuleConfig): unknown;
|
50
|
+
fromPartial(object: DeepPartial<ModuleConfig>): ModuleConfig;
|
51
|
+
};
|
@@ -0,0 +1,105 @@
|
|
1
|
+
import * as _m0 from "protobufjs/minimal";
|
2
|
+
import { DeepPartial } from "@osmonauts/helpers";
|
3
|
+
/** ModuleDescriptor describes an app module. */
|
4
|
+
export interface ModuleDescriptor {
|
5
|
+
/**
|
6
|
+
* go_import names the package that should be imported by an app to load the
|
7
|
+
* module in the runtime module registry. Either go_import must be defined here
|
8
|
+
* or the go_package option must be defined at the file level to indicate
|
9
|
+
* to users where to location the module implementation. go_import takes
|
10
|
+
* precedence over go_package when both are defined.
|
11
|
+
*/
|
12
|
+
go_import: string;
|
13
|
+
/**
|
14
|
+
* use_package refers to a protobuf package that this module
|
15
|
+
* uses and exposes to the world. In an app, only one module should "use"
|
16
|
+
* or own a single protobuf package. It is assumed that the module uses
|
17
|
+
* all of the .proto files in a single package.
|
18
|
+
*/
|
19
|
+
use_package: PackageReference[];
|
20
|
+
/**
|
21
|
+
* can_migrate_from defines which module versions this module can migrate
|
22
|
+
* state from. The framework will check that one module version is able to
|
23
|
+
* migrate from a previous module version before attempting to update its
|
24
|
+
* config. It is assumed that modules can transitively migrate from earlier
|
25
|
+
* versions. For instance if v3 declares it can migrate from v2, and v2
|
26
|
+
* declares it can migrate from v1, the framework knows how to migrate
|
27
|
+
* from v1 to v3, assuming all 3 module versions are registered at runtime.
|
28
|
+
*/
|
29
|
+
can_migrate_from: MigrateFromInfo[];
|
30
|
+
}
|
31
|
+
/** PackageReference is a reference to a protobuf package used by a module. */
|
32
|
+
export interface PackageReference {
|
33
|
+
/** name is the fully-qualified name of the package. */
|
34
|
+
name: string;
|
35
|
+
/**
|
36
|
+
* revision is the optional revision of the package that is being used.
|
37
|
+
* Protobuf packages used in Cosmos should generally have a major version
|
38
|
+
* as the last part of the package name, ex. foo.bar.baz.v1.
|
39
|
+
* The revision of a package can be thought of as the minor version of a
|
40
|
+
* package which has additional backwards compatible definitions that weren't
|
41
|
+
* present in a previous version.
|
42
|
+
*
|
43
|
+
* A package should indicate its revision with a source code comment
|
44
|
+
* above the package declaration in one of its fields containing the
|
45
|
+
* test "Revision N" where N is an integer revision. All packages start
|
46
|
+
* at revision 0 the first time they are released in a module.
|
47
|
+
*
|
48
|
+
* When a new version of a module is released and items are added to existing
|
49
|
+
* .proto files, these definitions should contain comments of the form
|
50
|
+
* "Since Revision N" where N is an integer revision.
|
51
|
+
*
|
52
|
+
* When the module runtime starts up, it will check the pinned proto
|
53
|
+
* image and panic if there are runtime protobuf definitions that are not
|
54
|
+
* in the pinned descriptor which do not have
|
55
|
+
* a "Since Revision N" comment or have a "Since Revision N" comment where
|
56
|
+
* N is <= to the revision specified here. This indicates that the protobuf
|
57
|
+
* files have been updated, but the pinned file descriptor hasn't.
|
58
|
+
*
|
59
|
+
* If there are items in the pinned file descriptor with a revision
|
60
|
+
* greater than the value indicated here, this will also cause a panic
|
61
|
+
* as it may mean that the pinned descriptor for a legacy module has been
|
62
|
+
* improperly updated or that there is some other versioning discrepancy.
|
63
|
+
* Runtime protobuf definitions will also be checked for compatibility
|
64
|
+
* with pinned file descriptors to make sure there are no incompatible changes.
|
65
|
+
*
|
66
|
+
* This behavior ensures that:
|
67
|
+
* * pinned proto images are up-to-date
|
68
|
+
* * protobuf files are carefully annotated with revision comments which
|
69
|
+
* are important good client UX
|
70
|
+
* * protobuf files are changed in backwards and forwards compatible ways
|
71
|
+
*/
|
72
|
+
revision: number;
|
73
|
+
}
|
74
|
+
/**
|
75
|
+
* MigrateFromInfo is information on a module version that a newer module
|
76
|
+
* can migrate from.
|
77
|
+
*/
|
78
|
+
export interface MigrateFromInfo {
|
79
|
+
/**
|
80
|
+
* module is the fully-qualified protobuf name of the module config object
|
81
|
+
* for the previous module version, ex: "cosmos.group.module.v1.Module".
|
82
|
+
*/
|
83
|
+
module: string;
|
84
|
+
}
|
85
|
+
export declare const ModuleDescriptor: {
|
86
|
+
encode(message: ModuleDescriptor, writer?: _m0.Writer): _m0.Writer;
|
87
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): ModuleDescriptor;
|
88
|
+
fromJSON(object: any): ModuleDescriptor;
|
89
|
+
toJSON(message: ModuleDescriptor): unknown;
|
90
|
+
fromPartial(object: DeepPartial<ModuleDescriptor>): ModuleDescriptor;
|
91
|
+
};
|
92
|
+
export declare const PackageReference: {
|
93
|
+
encode(message: PackageReference, writer?: _m0.Writer): _m0.Writer;
|
94
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): PackageReference;
|
95
|
+
fromJSON(object: any): PackageReference;
|
96
|
+
toJSON(message: PackageReference): unknown;
|
97
|
+
fromPartial(object: DeepPartial<PackageReference>): PackageReference;
|
98
|
+
};
|
99
|
+
export declare const MigrateFromInfo: {
|
100
|
+
encode(message: MigrateFromInfo, writer?: _m0.Writer): _m0.Writer;
|
101
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): MigrateFromInfo;
|
102
|
+
fromJSON(object: any): MigrateFromInfo;
|
103
|
+
toJSON(message: MigrateFromInfo): unknown;
|
104
|
+
fromPartial(object: DeepPartial<MigrateFromInfo>): MigrateFromInfo;
|
105
|
+
};
|
@@ -0,0 +1,25 @@
|
|
1
|
+
import { Config } from "./config";
|
2
|
+
import * as _m0 from "protobufjs/minimal";
|
3
|
+
import { DeepPartial } from "@osmonauts/helpers";
|
4
|
+
/** QueryConfigRequest is the Query/Config request type. */
|
5
|
+
export interface QueryConfigRequest {
|
6
|
+
}
|
7
|
+
/** QueryConfigRequest is the Query/Config response type. */
|
8
|
+
export interface QueryConfigResponse {
|
9
|
+
/** config is the current app config. */
|
10
|
+
config: Config;
|
11
|
+
}
|
12
|
+
export declare const QueryConfigRequest: {
|
13
|
+
encode(_: QueryConfigRequest, writer?: _m0.Writer): _m0.Writer;
|
14
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): QueryConfigRequest;
|
15
|
+
fromJSON(_: any): QueryConfigRequest;
|
16
|
+
toJSON(_: QueryConfigRequest): unknown;
|
17
|
+
fromPartial(_: DeepPartial<QueryConfigRequest>): QueryConfigRequest;
|
18
|
+
};
|
19
|
+
export declare const QueryConfigResponse: {
|
20
|
+
encode(message: QueryConfigResponse, writer?: _m0.Writer): _m0.Writer;
|
21
|
+
decode(input: _m0.Reader | Uint8Array, length?: number): QueryConfigResponse;
|
22
|
+
fromJSON(object: any): QueryConfigResponse;
|
23
|
+
toJSON(message: QueryConfigResponse): unknown;
|
24
|
+
fromPartial(object: DeepPartial<QueryConfigResponse>): QueryConfigResponse;
|
25
|
+
};
|