Struct solana_sdk::pubkey::Pubkey [−][src]
#[repr(transparent)]pub struct Pubkey(_);
Implementations
impl Pubkey
[src]
impl Pubkey
[src]pub fn new(pubkey_vec: &[u8]) -> Pubkey
[src]
pub const fn new_from_array(pubkey_array: [u8; 32]) -> Pubkey
[src]
pub fn new_rand() -> Pubkey
[src]
Please use ‘Pubkey::new_unique’ instead
pub fn new_unique() -> Pubkey
[src]
unique Pubkey for tests and benchmarks.
pub fn create_with_seed(
base: &Pubkey,
seed: &str,
owner: &Pubkey
) -> Result<Pubkey, PubkeyError>
[src]
base: &Pubkey,
seed: &str,
owner: &Pubkey
) -> Result<Pubkey, PubkeyError>
pub fn create_program_address(
seeds: &[&[u8]],
program_id: &Pubkey
) -> Result<Pubkey, PubkeyError>
[src]
seeds: &[&[u8]],
program_id: &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 Solana
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.
pub fn find_program_address(
seeds: &[&[u8]],
program_id: &Pubkey
) -> (Pubkey, u8)
[src]
seeds: &[&[u8]],
program_id: &Pubkey
) -> (Pubkey, u8)
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.
pub fn try_find_program_address(
seeds: &[&[u8]],
program_id: &Pubkey
) -> Option<(Pubkey, u8)>
[src]
seeds: &[&[u8]],
program_id: &Pubkey
) -> Option<(Pubkey, u8)>
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.
pub fn to_bytes(self) -> [u8; 32]
[src]
pub fn log(&self)
[src]
Log a Pubkey
from a program
Trait Implementations
impl BorshSchema for Pubkey where
[u8; 32]: BorshSchema,
[src]
impl BorshSchema for Pubkey where
[u8; 32]: BorshSchema,
[src]pub fn declaration() -> String
[src]
pub fn add_definitions_recursively(
definitions: &mut HashMap<String, Definition, RandomState>
)
[src]
definitions: &mut HashMap<String, Definition, RandomState>
)
pub fn add_definition(
declaration: String,
definition: Definition,
definitions: &mut HashMap<String, Definition, RandomState>
)
declaration: String,
definition: Definition,
definitions: &mut HashMap<String, Definition, RandomState>
)
pub fn schema_container() -> BorshSchemaContainer
impl<'de> Deserialize<'de> for Pubkey
[src]
impl<'de> Deserialize<'de> for Pubkey
[src]pub fn deserialize<__D>(
__deserializer: __D
) -> Result<Pubkey, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
[src]
__deserializer: __D
) -> Result<Pubkey, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
impl PartialOrd<Pubkey> for Pubkey
[src]
impl PartialOrd<Pubkey> for Pubkey
[src]impl Serialize for Pubkey
[src]
impl Serialize for Pubkey
[src]pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
[src]
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
impl StructuralEq for Pubkey
[src]
impl StructuralEq for Pubkey
[src]impl StructuralPartialEq for Pubkey
[src]
impl StructuralPartialEq for Pubkey
[src]Auto Trait Implementations
impl RefUnwindSafe for Pubkey
impl RefUnwindSafe for Pubkey
impl UnwindSafe for Pubkey
impl UnwindSafe for Pubkey
Blanket Implementations
impl<T> AbiEnumVisitor for T where
T: Serialize + ?Sized,
[src]
impl<T> AbiEnumVisitor for T where
T: Serialize + ?Sized,
[src]pub default fn visit_for_abi(
&self,
_digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
[src]
&self,
_digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
impl<T> AbiEnumVisitor for T where
T: Serialize + AbiExample + ?Sized,
[src]
impl<T> AbiEnumVisitor for T where
T: Serialize + AbiExample + ?Sized,
[src]pub default fn visit_for_abi(
&self,
digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
[src]
&self,
digester: &mut AbiDigester
) -> Result<AbiDigester, DigestError>
impl<T> AbiExample for T
[src]
impl<T> AbiExample for T
[src]impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> ToHex for T where
T: AsRef<[u8]>,
[src]
impl<T> ToHex for T where
T: AsRef<[u8]>,
[src]pub fn encode_hex<U>(&self) -> U where
U: FromIterator<char>,
[src]
U: FromIterator<char>,
pub fn encode_hex_upper<U>(&self) -> U where
U: FromIterator<char>,
[src]
U: FromIterator<char>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,