20#ifndef RIPPLE_APP_CONSENSUS_RCLCXPEERPOS_H_INCLUDED
21#define RIPPLE_APP_CONSENSUS_RCLCXPEERPOS_H_INCLUDED
23#include <xrpld/consensus/ConsensusProposal.h>
25#include <xrpl/basics/base_uint.h>
26#include <xrpl/beast/hash/hash_append.h>
27#include <xrpl/json/json_value.h>
28#include <xrpl/protocol/HashPrefix.h>
29#include <xrpl/protocol/PublicKey.h>
31#include <boost/container/static_vector.hpp>
110 boost::container::static_vector<std::uint8_t, 72>
signature_;
112 template <
class Hasher>
147 Slice
const& publicKey,
148 Slice
const& signature);
std::string render() const
std::chrono::time_point< NetClock > time_point
A peer's signed, proposed position for use in RCLConsensus.
Proposal const & proposal() const
boost::container::static_vector< std::uint8_t, 72 > signature_
bool checkSign() const
Verify the signing hash of the proposal.
Json::Value getJson() const
JSON representation of proposal.
std::string render() const
PublicKey const & publicKey() const
Public key of peer that sent the proposal.
void hash_append(Hasher &h) const
Slice signature() const
Signature of the proposal (not necessarily verified)
uint256 const & suppressionID() const
Unique id used by hash router to suppress duplicates.
ConsensusProposal< NodeID, uint256, uint256 > Proposal
An immutable linear range of bytes.
std::enable_if_t< is_contiguously_hashable< 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.
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.
@ proposal
proposal for signing