Struct solana_sdk::pubkey::Pubkey [−][src]
#[repr(transparent)]pub struct Pubkey(_);
Implementations
Please use ‘Pubkey::new_unique’ instead
unique Pubkey for tests and benchmarks.
pub fn create_with_seed(
base: &Pubkey,
seed: &str,
owner: &Pubkey
) -> Result<Pubkey, PubkeyError>
Create a program address
Program addresses are account keys that only the program has the
authority to sign. The address is of the same form as a Safecoin
Pubkey
, except they are ensured to not be on the ed25519 curve and
thus have no associated private key. When performing cross-program
invocations the program can “sign” for the key by calling
invoke_signed
and passing the same seeds used to generate the address.
The runtime will check that indeed the program associated with this
address is the caller and thus authorized to be the signer.
Because the program address cannot lie on the ed25519 curve there may be
seed and program id combinations that are invalid. In these cases an
extra seed (bump seed) can be calculated that results in a point off the
curve. Use find_program_address
to calculate that bump seed.
Warning: Because of the way the seeds are hashed there is a potential for program address collisions for the same program id. The seeds are hashed sequentially which means that seeds {“abcdef”}, {“abc”, “def”}, and {“ab”, “cd”, “ef”} will all result in the same program address given the same program id. Since the change of collision is local to a given program id the developer of that program must take care to choose seeds that do not collide with themselves.
Find a valid program address and its corresponding bump seed which must
be passed as an additional seed when calling invoke_signed
.
Panics in the very unlikely event that the additional seed could not be found.
The processes of finding a valid program address is by trial and error, and even though it is deterministic given a set of inputs it can take a variable amount of time to succeed across different inputs. This means that when called from an on-chain program it may incur a variable amount of the program’s compute budget. Programs that are meant to be very performant may not want to use this function because it could take a considerable amount of time. Also, programs that area already at risk of exceeding their compute budget should also call this with care since there is a chance that the program’s budget may be occasionally exceeded.
Find a valid program address and its corresponding bump seed which must
be passed as an additional seed when calling invoke_signed
.
The processes of finding a valid program address is by trial and error, and even though it is deterministic given a set of inputs it can take a variable amount of time to succeed across different inputs. This means that when called from an on-chain program it may incur a variable amount of the program’s compute budget. Programs that are meant to be very performant may not want to use this function because it could take a considerable amount of time. Also, programs that area already at risk of exceeding their compute budget should also call this with care since there is a chance that the program’s budget may be occasionally exceeded.
Trait Implementations
Get the name of the type without brackets.
pub fn add_definitions_recursively(
definitions: &mut HashMap<String, Definition, RandomState>
)
pub fn add_definitions_recursively(
definitions: &mut HashMap<String, Definition, RandomState>
)
Recursively, using DFS, add type definitions required for this type. For primitive types this is an empty map. Type definition explains how to serialize/deserialize a type. Read more
fn add_definition(
declaration: String,
definition: Definition,
definitions: &mut HashMap<String, Definition, RandomState>
)
fn add_definition(
declaration: String,
definition: Definition,
definitions: &mut HashMap<String, Definition, RandomState>
)
Helper method to add a single type definition to the map.
fn schema_container() -> BorshSchemaContainer
pub fn deserialize<__D>(
__deserializer: __D
) -> Result<Pubkey, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
pub fn deserialize<__D>(
__deserializer: __D
) -> Result<Pubkey, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
Auto Trait Implementations
impl RefUnwindSafe for Pubkey
impl UnwindSafe for Pubkey
Blanket Implementations
pub default fn visit_for_abi(
&self,
digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
pub default fn visit_for_abi(
&self,
_digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self