3#include <xrpld/consensus/ConsensusProposal.h>
5#include <xrpl/basics/base_uint.h>
6#include <xrpl/beast/hash/hash_append.h>
7#include <xrpl/json/json_value.h>
8#include <xrpl/protocol/HashPrefix.h>
9#include <xrpl/protocol/PublicKey.h>
11#include <boost/container/static_vector.hpp>
90 boost::container::static_vector<std::uint8_t, 72>
signature_;
92 template <
class Hasher>
127 Slice
const& publicKey,
128 Slice
const& signature);
Represents a proposed position taken during a round of consensus.
std::chrono::time_point< NetClock > time_point
uint256 const & suppressionID() const
Unique id used by hash router to suppress duplicates.
PublicKey const & publicKey() const
Public key of peer that sent the proposal.
RCLCxPeerPos(PublicKey const &publicKey, Slice const &signature, uint256 const &suppress, Proposal const &proposal)
Constructor.
ConsensusProposal< NodeID, uint256, uint256 > Proposal
Slice signature() const
Signature of the proposal (not necessarily verified).
boost::container::static_vector< std::uint8_t, 72 > signature_
void hash_append(Hasher &h) const
bool checkSign() const
Verify the signing hash of the proposal.
Proposal const & proposal() const
json::Value getJson() const
JSON representation of proposal.
std::string render() const
An immutable linear range of bytes.
std::enable_if_t< IsContiguouslyHashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
@ Proposal
proposal for signing
uint256 proposalUniqueId(uint256 const &proposeHash, uint256 const &previousLedger, std::uint32_t proposeSeq, NetClock::time_point closeTime, Slice const &publicKey, Slice const &signature)
Calculate a unique identifier for a signed proposal.