mirror of
https://github.com/Xahau/xahaud.git
synced 2025-12-06 17:27:52 +00:00
Payment channels permit off-ledger checkpoints of XRP payments flowing in a single direction. A channel sequesters the owner's XRP in its own ledger entry. The owner can authorize the recipient to claim up to a give balance by giving the receiver a signed message (off-ledger). The recipient can use this signed message to claim any unpaid balance while the channel remains open. The owner can top off the line as needed. If the channel has not paid out all its funds, the owner must wait out a delay to close the channel to give the recipient a chance to supply any claims. The recipient can close the channel at any time. Any transaction that touches the channel after the expiration time will close the channel. The total amount paid increases monotonically as newer claims are issued. When the channel is closed any remaining balance is returned to the owner. Channels are intended to permit intermittent off-ledger settlement of ILP trust lines as balances get substantial. For bidirectional channels, a payment channel can be used in each direction.
341 lines
8.1 KiB
C++
341 lines
8.1 KiB
C++
//------------------------------------------------------------------------------
|
|
/*
|
|
This file is part of rippled: https://github.com/ripple/rippled
|
|
Copyright (c) 2012, 2013 Ripple Labs Inc.
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL , DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
//==============================================================================
|
|
|
|
#include <BeastConfig.h>
|
|
#include <ripple/protocol/digest.h>
|
|
#include <ripple/protocol/Indexes.h>
|
|
#include <cassert>
|
|
|
|
namespace ripple {
|
|
|
|
// get the index of the node that holds the last 256 ledgers
|
|
uint256
|
|
getLedgerHashIndex ()
|
|
{
|
|
return sha512Half(std::uint16_t(spaceSkipList));
|
|
}
|
|
|
|
// Get the index of the node that holds the set of 256 ledgers that includes
|
|
// this ledger's hash (or the first ledger after it if it's not a multiple
|
|
// of 256).
|
|
uint256
|
|
getLedgerHashIndex (std::uint32_t desiredLedgerIndex)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceSkipList),
|
|
std::uint32_t(desiredLedgerIndex >> 16));
|
|
}
|
|
// get the index of the node that holds the enabled amendments
|
|
uint256
|
|
getLedgerAmendmentIndex ()
|
|
{
|
|
return sha512Half(std::uint16_t(spaceAmendment));
|
|
}
|
|
|
|
// get the index of the node that holds the fee schedule
|
|
uint256
|
|
getLedgerFeeIndex ()
|
|
{
|
|
return sha512Half(std::uint16_t(spaceFee));
|
|
}
|
|
|
|
uint256
|
|
getAccountRootIndex (AccountID const& account)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceAccount),
|
|
account);
|
|
}
|
|
|
|
uint256
|
|
getGeneratorIndex (AccountID const& uGeneratorID)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceGenerator),
|
|
uGeneratorID);
|
|
}
|
|
|
|
uint256
|
|
getBookBase (Book const& book)
|
|
{
|
|
assert (isConsistent (book));
|
|
// Return with quality 0.
|
|
return getQualityIndex(sha512Half(
|
|
std::uint16_t(spaceBookDir),
|
|
book.in.currency,
|
|
book.out.currency,
|
|
book.in.account,
|
|
book.out.account));
|
|
}
|
|
|
|
uint256
|
|
getOfferIndex (AccountID const& account, std::uint32_t uSequence)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceOffer),
|
|
account,
|
|
std::uint32_t(uSequence));
|
|
}
|
|
|
|
uint256
|
|
getOwnerDirIndex (AccountID const& account)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceOwnerDir),
|
|
account);
|
|
}
|
|
|
|
|
|
uint256
|
|
getDirNodeIndex (uint256 const& uDirRoot, const std::uint64_t uNodeIndex)
|
|
{
|
|
if (uNodeIndex == 0)
|
|
return uDirRoot;
|
|
|
|
return sha512Half(
|
|
std::uint16_t(spaceDirNode),
|
|
uDirRoot,
|
|
std::uint64_t(uNodeIndex));
|
|
}
|
|
|
|
uint256
|
|
getQualityIndex (uint256 const& uBase, const std::uint64_t uNodeDir)
|
|
{
|
|
// Indexes are stored in big endian format: they print as hex as stored.
|
|
// Most significant bytes are first. Least significant bytes represent
|
|
// adjacent entries. We place uNodeDir in the 8 right most bytes to be
|
|
// adjacent. Want uNodeDir in big endian format so ++ goes to the next
|
|
// entry for indexes.
|
|
uint256 uNode (uBase);
|
|
|
|
// TODO(tom): there must be a better way.
|
|
// VFALCO [base_uint] This assumes a certain storage format
|
|
((std::uint64_t*) uNode.end ())[-1] = htobe64 (uNodeDir);
|
|
|
|
return uNode;
|
|
}
|
|
|
|
uint256
|
|
getQualityNext (uint256 const& uBase)
|
|
{
|
|
static uint256 const uNext (
|
|
from_hex_text<uint256>("10000000000000000"));
|
|
return uBase + uNext;
|
|
}
|
|
|
|
std::uint64_t
|
|
getQuality (uint256 const& uBase)
|
|
{
|
|
// VFALCO [base_uint] This assumes a certain storage format
|
|
return be64toh (((std::uint64_t*) uBase.end ())[-1]);
|
|
}
|
|
|
|
uint256
|
|
getTicketIndex (AccountID const& account, std::uint32_t uSequence)
|
|
{
|
|
return sha512Half(
|
|
std::uint16_t(spaceTicket),
|
|
account,
|
|
std::uint32_t(uSequence));
|
|
}
|
|
|
|
uint256
|
|
getRippleStateIndex (AccountID const& a, AccountID const& b, Currency const& currency)
|
|
{
|
|
if (a < b)
|
|
return sha512Half(
|
|
std::uint16_t(spaceRipple),
|
|
a,
|
|
b,
|
|
currency);
|
|
return sha512Half(
|
|
std::uint16_t(spaceRipple),
|
|
b,
|
|
a,
|
|
currency);
|
|
}
|
|
|
|
uint256
|
|
getRippleStateIndex (AccountID const& a, Issue const& issue)
|
|
{
|
|
return getRippleStateIndex (a, issue.account, issue.currency);
|
|
}
|
|
|
|
uint256
|
|
getSignerListIndex (AccountID const& account)
|
|
{
|
|
// We are prepared for there to be multiple SignerLists in the future,
|
|
// but we don't have them yet. In anticipation of multiple SignerLists
|
|
// We supply a 32-bit ID to locate the SignerList. Until we actually
|
|
// *have* multiple signer lists, we can default that ID to zero.
|
|
return sha512Half(
|
|
std::uint16_t(spaceSignerList),
|
|
account,
|
|
std::uint32_t (0)); // 0 == default SignerList ID.
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
namespace keylet {
|
|
|
|
Keylet account_t::operator()(
|
|
AccountID const& id) const
|
|
{
|
|
return { ltACCOUNT_ROOT,
|
|
getAccountRootIndex(id) };
|
|
}
|
|
|
|
Keylet child (uint256 const& key)
|
|
{
|
|
return { ltCHILD, key };
|
|
}
|
|
|
|
Keylet skip_t::operator()() const
|
|
{
|
|
return { ltLEDGER_HASHES,
|
|
getLedgerHashIndex() };
|
|
}
|
|
|
|
Keylet skip_t::operator()(LedgerIndex ledger) const
|
|
{
|
|
return { ltLEDGER_HASHES,
|
|
getLedgerHashIndex(ledger) };
|
|
}
|
|
|
|
Keylet amendments_t::operator()() const
|
|
{
|
|
return { ltAMENDMENTS,
|
|
getLedgerAmendmentIndex() };
|
|
}
|
|
|
|
Keylet fees_t::operator()() const
|
|
{
|
|
return { ltFEE_SETTINGS,
|
|
getLedgerFeeIndex() };
|
|
}
|
|
|
|
Keylet book_t::operator()(Book const& b) const
|
|
{
|
|
return { ltDIR_NODE,
|
|
getBookBase(b) };
|
|
}
|
|
|
|
Keylet line_t::operator()(AccountID const& id0,
|
|
AccountID const& id1, Currency const& currency) const
|
|
{
|
|
return { ltRIPPLE_STATE,
|
|
getRippleStateIndex(id0, id1, currency) };
|
|
}
|
|
|
|
Keylet line_t::operator()(AccountID const& id,
|
|
Issue const& issue) const
|
|
{
|
|
return { ltRIPPLE_STATE,
|
|
getRippleStateIndex(id, issue) };
|
|
}
|
|
|
|
Keylet offer_t::operator()(AccountID const& id,
|
|
std::uint32_t seq) const
|
|
{
|
|
return { ltOFFER,
|
|
getOfferIndex(id, seq) };
|
|
}
|
|
|
|
Keylet quality_t::operator()(Keylet const& k,
|
|
std::uint64_t q) const
|
|
{
|
|
assert(k.type == ltDIR_NODE);
|
|
return { ltDIR_NODE,
|
|
getQualityIndex(k.key, q) };
|
|
}
|
|
|
|
Keylet next_t::operator()(Keylet const& k) const
|
|
{
|
|
assert(k.type == ltDIR_NODE);
|
|
return { ltDIR_NODE,
|
|
getQualityNext(k.key) };
|
|
}
|
|
|
|
Keylet ticket_t::operator()(AccountID const& id,
|
|
std::uint32_t seq) const
|
|
{
|
|
return { ltTICKET,
|
|
getTicketIndex(id, seq) };
|
|
}
|
|
|
|
Keylet signers_t::operator()(AccountID const& id) const
|
|
{
|
|
return { ltSIGNER_LIST,
|
|
getSignerListIndex(id) };
|
|
}
|
|
|
|
//------------------------------------------------------------------------------
|
|
|
|
Keylet unchecked (uint256 const& key)
|
|
{
|
|
return { ltANY, key };
|
|
}
|
|
|
|
Keylet ownerDir(AccountID const& id)
|
|
{
|
|
return { ltDIR_NODE,
|
|
getOwnerDirIndex(id) };
|
|
}
|
|
|
|
Keylet page(uint256 const& key,
|
|
std::uint64_t index)
|
|
{
|
|
return { ltDIR_NODE,
|
|
getDirNodeIndex(key, index) };
|
|
}
|
|
|
|
Keylet page(Keylet const& root,
|
|
std::uint64_t index)
|
|
{
|
|
assert(root.type == ltDIR_NODE);
|
|
return page(root.key, index);
|
|
}
|
|
|
|
Keylet
|
|
susPay (AccountID const& source, std::uint32_t seq)
|
|
{
|
|
sha512_half_hasher h;
|
|
using beast::hash_append;
|
|
hash_append(h, spaceSusPay);
|
|
hash_append(h, source);
|
|
hash_append(h, seq);
|
|
return { ltSUSPAY, static_cast<uint256>(h) };
|
|
}
|
|
|
|
Keylet
|
|
payChan (AccountID const& source, AccountID const& dst, std::uint32_t seq)
|
|
{
|
|
sha512_half_hasher h;
|
|
using beast::hash_append;
|
|
hash_append(h, spaceXRPUChannel);
|
|
hash_append(h, source);
|
|
hash_append(h, dst);
|
|
hash_append(h, seq);
|
|
return { ltPAYCHAN, static_cast<uint256>(h) };
|
|
}
|
|
|
|
} // keylet
|
|
|
|
} // ripple
|