Struct tea_sdk::vmh::message::structs_proto::p2p::ApplyToBePinnerResponse

pub struct ApplyToBePinnerResponse {
    pub deployment_id: String,
    pub pinner_key_encrypted: Vec<u8>,
    pub key1_encrypted: Vec<u8>,
    pub upstream_pinner_tea_id: Vec<u8>,
    pub signature: Vec<u8>,
    pub uuid: String,
}

Fields

deployment_id: String

this is cid of pinner_key’s pub key

pinner_key_encrypted: Vec<u8>

The full pinner key encoded by rsa_pubkey from wannabe pinner.

key1_encrypted: Vec<u8>

The key1 encoded by rsa_pubkey from upstream pinner.

upstream_pinner_tea_id: Vec<u8>

use the upstream tea_id to make a broacasting chain so that we can trace back when make payment or verify

signature: Vec<u8>

we use tea_id instead of ephemeral_id because this chain would be a long life time use. ephemeral key changes every time the tea node reboot. Base on today’s idea, the first revenue comes from hosting as pinner will 100% go to upstream pinner. after that the revenue doens’t need to share to upstream problem: what if the data is only for one time use?

The Ed25519 sig for concat bytes: pinner’s ephemeral key + pinner_key_enc

uuid: String

This uuid has no use for delegator (upstream pinner). The wannabe pinner will need this uuid to retrieve PinnerStoreItem

Trait Implementations

impl Clone for ApplyToBePinnerResponse

fn clone(&self) -> ApplyToBePinnerResponse

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ApplyToBePinnerResponse

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for ApplyToBePinnerResponse

fn default() -> ApplyToBePinnerResponse

Returns the “default value” for a type.

impl Message for ApplyToBePinnerResponse

fn encoded_len(&self) -> usize

Returns the encoded length of the message without a length delimiter.

fn clear(&mut self)

Clears the message, resetting all fields to their default.

fn encode<B>(&self, buf: &mut B) -> Result<(), EncodeError>where B: BufMut, Self: Sized,

Encodes the message to a buffer.

fn encode_to_vec(&self) -> Vec<u8> where Self: Sized,

Encodes the message to a newly allocated buffer.

fn encode_length_delimited<B>(&self, buf: &mut B) -> Result<(), EncodeError>where B: BufMut, Self: Sized,

Encodes the message with a length-delimiter to a buffer.

fn encode_length_delimited_to_vec(&self) -> Vec<u8> where Self: Sized,

Encodes the message with a length-delimiter to a newly allocated buffer.

fn decode<B>(buf: B) -> Result<Self, DecodeError>where B: Buf, Self: Default,

Decodes an instance of the message from a buffer.

fn decode_length_delimited<B>(buf: B) -> Result<Self, DecodeError>where B: Buf, Self: Default,

Decodes a length-delimited instance of the message from the buffer.

fn merge<B>(&mut self, buf: B) -> Result<(), DecodeError>where B: Buf, Self: Sized,

Decodes an instance of the message from a buffer, and merges it into self.

fn merge_length_delimited<B>(&mut self, buf: B) -> Result<(), DecodeError>where B: Buf, Self: Sized,

Decodes a length-delimited instance of the message from buffer, and merges it into self.

impl PartialEq for ApplyToBePinnerResponse

fn eq(&self, other: &ApplyToBePinnerResponse) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ApplyToBePinnerResponse