mirror of
https://github.com/monero-project/monero.git
synced 2024-11-05 16:07:37 +00:00
2899379791
Daemons intended for public use can be set up to require payment in the form of hashes in exchange for RPC service. This enables public daemons to receive payment for their work over a large number of calls. This system behaves similarly to a pool, so payment takes the form of valid blocks every so often, yielding a large one off payment, rather than constant micropayments. This system can also be used by third parties as a "paywall" layer, where users of a service can pay for use by mining Monero to the service provider's address. An example of this for web site access is Primo, a Monero mining based website "paywall": https://github.com/selene-kovri/primo This has some advantages: - incentive to run a node providing RPC services, thereby promoting the availability of third party nodes for those who can't run their own - incentive to run your own node instead of using a third party's, thereby promoting decentralization - decentralized: payment is done between a client and server, with no third party needed - private: since the system is "pay as you go", you don't need to identify yourself to claim a long lived balance - no payment occurs on the blockchain, so there is no extra transactional load - one may mine with a beefy server, and use those credits from a phone, by reusing the client ID (at the cost of some privacy) - no barrier to entry: anyone may run a RPC node, and your expected revenue depends on how much work you do - Sybil resistant: if you run 1000 idle RPC nodes, you don't magically get more revenue - no large credit balance maintained on servers, so they have no incentive to exit scam - you can use any/many node(s), since there's little cost in switching servers - market based prices: competition between servers to lower costs - incentive for a distributed third party node system: if some public nodes are overused/slow, traffic can move to others - increases network security - helps counteract mining pools' share of the network hash rate - zero incentive for a payer to "double spend" since a reorg does not give any money back to the miner And some disadvantages: - low power clients will have difficulty mining (but one can optionally mine in advance and/or with a faster machine) - payment is "random", so a server might go a long time without a block before getting one - a public node's overall expected payment may be small Public nodes are expected to compete to find a suitable level for cost of service. The daemon can be set up this way to require payment for RPC services: monerod --rpc-payment-address 4xxxxxx \ --rpc-payment-credits 250 --rpc-payment-difficulty 1000 These values are an example only. The --rpc-payment-difficulty switch selects how hard each "share" should be, similar to a mining pool. The higher the difficulty, the fewer shares a client will find. The --rpc-payment-credits switch selects how many credits are awarded for each share a client finds. Considering both options, clients will be awarded credits/difficulty credits for every hash they calculate. For example, in the command line above, 0.25 credits per hash. A client mining at 100 H/s will therefore get an average of 25 credits per second. For reference, in the current implementation, a credit is enough to sync 20 blocks, so a 100 H/s client that's just starting to use Monero and uses this daemon will be able to sync 500 blocks per second. The wallet can be set to automatically mine if connected to a daemon which requires payment for RPC usage. It will try to keep a balance of 50000 credits, stopping mining when it's at this level, and starting again as credits are spent. With the example above, a new client will mine this much credits in about half an hour, and this target is enough to sync 500000 blocks (currently about a third of the monero blockchain). There are three new settings in the wallet: - credits-target: this is the amount of credits a wallet will try to reach before stopping mining. The default of 0 means 50000 credits. - auto-mine-for-rpc-payment-threshold: this controls the minimum credit rate which the wallet considers worth mining for. If the daemon credits less than this ratio, the wallet will consider mining to be not worth it. In the example above, the rate is 0.25 - persistent-rpc-client-id: if set, this allows the wallet to reuse a client id across runs. This means a public node can tell a wallet that's connecting is the same as one that connected previously, but allows a wallet to keep their credit balance from one run to the other. Since the wallet only mines to keep a small credit balance, this is not normally worth doing. However, someone may want to mine on a fast server, and use that credit balance on a low power device such as a phone. If left unset, a new client ID is generated at each wallet start, for privacy reasons. To mine and use a credit balance on two different devices, you can use the --rpc-client-secret-key switch. A wallet's client secret key can be found using the new rpc_payments command in the wallet. Note: anyone knowing your RPC client secret key is able to use your credit balance. The wallet has a few new commands too: - start_mining_for_rpc: start mining to acquire more credits, regardless of the auto mining settings - stop_mining_for_rpc: stop mining to acquire more credits - rpc_payments: display information about current credits with the currently selected daemon The node has an extra command: - rpc_payments: display information about clients and their balances The node will forget about any balance for clients which have been inactive for 6 months. Balances carry over on node restart.
320 lines
10 KiB
C
320 lines
10 KiB
C
// Copyright (c) 2014-2019, The Monero Project
|
|
//
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
// permitted provided that the following conditions are met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
// conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
// materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
// used to endorse or promote products derived from this software without specific
|
|
// prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
|
|
|
|
#pragma once
|
|
|
|
#include <assert.h>
|
|
#include <stdbool.h>
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#ifndef _MSC_VER
|
|
#include <sys/param.h>
|
|
#endif
|
|
|
|
#if defined(__ANDROID__)
|
|
#include <byteswap.h>
|
|
#endif
|
|
|
|
#if defined(__sun) && defined(__SVR4)
|
|
#include <endian.h>
|
|
#endif
|
|
|
|
#if defined(_MSC_VER)
|
|
#include <stdlib.h>
|
|
|
|
static inline uint32_t rol32(uint32_t x, int r) {
|
|
static_assert(sizeof(uint32_t) == sizeof(unsigned int), "this code assumes 32-bit integers");
|
|
return _rotl(x, r);
|
|
}
|
|
|
|
static inline uint64_t rol64(uint64_t x, int r) {
|
|
return _rotl64(x, r);
|
|
}
|
|
|
|
#else
|
|
|
|
static inline uint32_t rol32(uint32_t x, int r) {
|
|
return (x << (r & 31)) | (x >> (-r & 31));
|
|
}
|
|
|
|
static inline uint64_t rol64(uint64_t x, int r) {
|
|
return (x << (r & 63)) | (x >> (-r & 63));
|
|
}
|
|
|
|
#endif
|
|
|
|
static inline uint64_t hi_dword(uint64_t val) {
|
|
return val >> 32;
|
|
}
|
|
|
|
static inline uint64_t lo_dword(uint64_t val) {
|
|
return val & 0xFFFFFFFF;
|
|
}
|
|
|
|
static inline uint64_t mul128(uint64_t multiplier, uint64_t multiplicand, uint64_t* product_hi) {
|
|
// multiplier = ab = a * 2^32 + b
|
|
// multiplicand = cd = c * 2^32 + d
|
|
// ab * cd = a * c * 2^64 + (a * d + b * c) * 2^32 + b * d
|
|
uint64_t a = hi_dword(multiplier);
|
|
uint64_t b = lo_dword(multiplier);
|
|
uint64_t c = hi_dword(multiplicand);
|
|
uint64_t d = lo_dword(multiplicand);
|
|
|
|
uint64_t ac = a * c;
|
|
uint64_t ad = a * d;
|
|
uint64_t bc = b * c;
|
|
uint64_t bd = b * d;
|
|
|
|
uint64_t adbc = ad + bc;
|
|
uint64_t adbc_carry = adbc < ad ? 1 : 0;
|
|
|
|
// multiplier * multiplicand = product_hi * 2^64 + product_lo
|
|
uint64_t product_lo = bd + (adbc << 32);
|
|
uint64_t product_lo_carry = product_lo < bd ? 1 : 0;
|
|
*product_hi = ac + (adbc >> 32) + (adbc_carry << 32) + product_lo_carry;
|
|
assert(ac <= *product_hi);
|
|
|
|
return product_lo;
|
|
}
|
|
|
|
static inline uint64_t div_with_reminder(uint64_t dividend, uint32_t divisor, uint32_t* remainder) {
|
|
dividend |= ((uint64_t)*remainder) << 32;
|
|
*remainder = dividend % divisor;
|
|
return dividend / divisor;
|
|
}
|
|
|
|
// Long division with 2^32 base
|
|
static inline uint32_t div128_32(uint64_t dividend_hi, uint64_t dividend_lo, uint32_t divisor, uint64_t* quotient_hi, uint64_t* quotient_lo) {
|
|
uint64_t dividend_dwords[4];
|
|
uint32_t remainder = 0;
|
|
|
|
dividend_dwords[3] = hi_dword(dividend_hi);
|
|
dividend_dwords[2] = lo_dword(dividend_hi);
|
|
dividend_dwords[1] = hi_dword(dividend_lo);
|
|
dividend_dwords[0] = lo_dword(dividend_lo);
|
|
|
|
*quotient_hi = div_with_reminder(dividend_dwords[3], divisor, &remainder) << 32;
|
|
*quotient_hi |= div_with_reminder(dividend_dwords[2], divisor, &remainder);
|
|
*quotient_lo = div_with_reminder(dividend_dwords[1], divisor, &remainder) << 32;
|
|
*quotient_lo |= div_with_reminder(dividend_dwords[0], divisor, &remainder);
|
|
|
|
return remainder;
|
|
}
|
|
|
|
// Long divisor with 2^64 base
|
|
void div128_64(uint64_t dividend_hi, uint64_t dividend_lo, uint64_t divisor, uint64_t* quotient_hi, uint64_t *quotient_lo, uint64_t *remainder_hi, uint64_t *remainder_lo);
|
|
|
|
static inline void add64clamp(uint64_t *value, uint64_t add)
|
|
{
|
|
static const uint64_t maxval = (uint64_t)-1;
|
|
if (*value > maxval - add)
|
|
*value = maxval;
|
|
else
|
|
*value += add;
|
|
}
|
|
|
|
static inline void sub64clamp(uint64_t *value, uint64_t sub)
|
|
{
|
|
if (*value < sub)
|
|
*value = 0;
|
|
else
|
|
*value -= sub;
|
|
}
|
|
|
|
#define IDENT16(x) ((uint16_t) (x))
|
|
#define IDENT32(x) ((uint32_t) (x))
|
|
#define IDENT64(x) ((uint64_t) (x))
|
|
|
|
#define SWAP16(x) ((((uint16_t) (x) & 0x00ff) << 8) | \
|
|
(((uint16_t) (x) & 0xff00) >> 8))
|
|
#define SWAP32(x) ((((uint32_t) (x) & 0x000000ff) << 24) | \
|
|
(((uint32_t) (x) & 0x0000ff00) << 8) | \
|
|
(((uint32_t) (x) & 0x00ff0000) >> 8) | \
|
|
(((uint32_t) (x) & 0xff000000) >> 24))
|
|
#define SWAP64(x) ((((uint64_t) (x) & 0x00000000000000ff) << 56) | \
|
|
(((uint64_t) (x) & 0x000000000000ff00) << 40) | \
|
|
(((uint64_t) (x) & 0x0000000000ff0000) << 24) | \
|
|
(((uint64_t) (x) & 0x00000000ff000000) << 8) | \
|
|
(((uint64_t) (x) & 0x000000ff00000000) >> 8) | \
|
|
(((uint64_t) (x) & 0x0000ff0000000000) >> 24) | \
|
|
(((uint64_t) (x) & 0x00ff000000000000) >> 40) | \
|
|
(((uint64_t) (x) & 0xff00000000000000) >> 56))
|
|
|
|
static inline uint16_t ident16(uint16_t x) { return x; }
|
|
static inline uint32_t ident32(uint32_t x) { return x; }
|
|
static inline uint64_t ident64(uint64_t x) { return x; }
|
|
|
|
#ifndef __OpenBSD__
|
|
# if defined(__ANDROID__) && defined(__swap16) && !defined(swap16)
|
|
# define swap16 __swap16
|
|
# elif !defined(swap16)
|
|
static inline uint16_t swap16(uint16_t x) {
|
|
return ((x & 0x00ff) << 8) | ((x & 0xff00) >> 8);
|
|
}
|
|
# endif
|
|
# if defined(__ANDROID__) && defined(__swap32) && !defined(swap32)
|
|
# define swap32 __swap32
|
|
# elif !defined(swap32)
|
|
static inline uint32_t swap32(uint32_t x) {
|
|
x = ((x & 0x00ff00ff) << 8) | ((x & 0xff00ff00) >> 8);
|
|
return (x << 16) | (x >> 16);
|
|
}
|
|
# endif
|
|
# if defined(__ANDROID__) && defined(__swap64) && !defined(swap64)
|
|
# define swap64 __swap64
|
|
# elif !defined(swap64)
|
|
static inline uint64_t swap64(uint64_t x) {
|
|
x = ((x & 0x00ff00ff00ff00ff) << 8) | ((x & 0xff00ff00ff00ff00) >> 8);
|
|
x = ((x & 0x0000ffff0000ffff) << 16) | ((x & 0xffff0000ffff0000) >> 16);
|
|
return (x << 32) | (x >> 32);
|
|
}
|
|
# endif
|
|
#endif /* __OpenBSD__ */
|
|
|
|
#if defined(__GNUC__)
|
|
#define UNUSED __attribute__((unused))
|
|
#else
|
|
#define UNUSED
|
|
#endif
|
|
static inline void mem_inplace_ident(void *mem UNUSED, size_t n UNUSED) { }
|
|
#undef UNUSED
|
|
|
|
static inline void mem_inplace_swap16(void *mem, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint16_t *) mem)[i] = swap16(((const uint16_t *) mem)[i]);
|
|
}
|
|
}
|
|
static inline void mem_inplace_swap32(void *mem, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint32_t *) mem)[i] = swap32(((const uint32_t *) mem)[i]);
|
|
}
|
|
}
|
|
static inline void mem_inplace_swap64(void *mem, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint64_t *) mem)[i] = swap64(((const uint64_t *) mem)[i]);
|
|
}
|
|
}
|
|
|
|
static inline void memcpy_ident16(void *dst, const void *src, size_t n) {
|
|
memcpy(dst, src, 2 * n);
|
|
}
|
|
static inline void memcpy_ident32(void *dst, const void *src, size_t n) {
|
|
memcpy(dst, src, 4 * n);
|
|
}
|
|
static inline void memcpy_ident64(void *dst, const void *src, size_t n) {
|
|
memcpy(dst, src, 8 * n);
|
|
}
|
|
|
|
static inline void memcpy_swap16(void *dst, const void *src, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint16_t *) dst)[i] = swap16(((const uint16_t *) src)[i]);
|
|
}
|
|
}
|
|
static inline void memcpy_swap32(void *dst, const void *src, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint32_t *) dst)[i] = swap32(((const uint32_t *) src)[i]);
|
|
}
|
|
}
|
|
static inline void memcpy_swap64(void *dst, const void *src, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; i++) {
|
|
((uint64_t *) dst)[i] = swap64(((const uint64_t *) src)[i]);
|
|
}
|
|
}
|
|
|
|
#ifdef _MSC_VER
|
|
# define LITTLE_ENDIAN 1234
|
|
# define BIG_ENDIAN 4321
|
|
# define BYTE_ORDER LITTLE_ENDIAN
|
|
#endif
|
|
|
|
#if !defined(BYTE_ORDER) || !defined(LITTLE_ENDIAN) || !defined(BIG_ENDIAN)
|
|
static_assert(false, "BYTE_ORDER is undefined. Perhaps, GNU extensions are not enabled");
|
|
#endif
|
|
|
|
#if BYTE_ORDER == LITTLE_ENDIAN
|
|
#define SWAP16LE IDENT16
|
|
#define SWAP16BE SWAP16
|
|
#define swap16le ident16
|
|
#define swap16be swap16
|
|
#define mem_inplace_swap16le mem_inplace_ident
|
|
#define mem_inplace_swap16be mem_inplace_swap16
|
|
#define memcpy_swap16le memcpy_ident16
|
|
#define memcpy_swap16be memcpy_swap16
|
|
#define SWAP32LE IDENT32
|
|
#define SWAP32BE SWAP32
|
|
#define swap32le ident32
|
|
#define swap32be swap32
|
|
#define mem_inplace_swap32le mem_inplace_ident
|
|
#define mem_inplace_swap32be mem_inplace_swap32
|
|
#define memcpy_swap32le memcpy_ident32
|
|
#define memcpy_swap32be memcpy_swap32
|
|
#define SWAP64LE IDENT64
|
|
#define SWAP64BE SWAP64
|
|
#define swap64le ident64
|
|
#define swap64be swap64
|
|
#define mem_inplace_swap64le mem_inplace_ident
|
|
#define mem_inplace_swap64be mem_inplace_swap64
|
|
#define memcpy_swap64le memcpy_ident64
|
|
#define memcpy_swap64be memcpy_swap64
|
|
#endif
|
|
|
|
#if BYTE_ORDER == BIG_ENDIAN
|
|
#define SWAP16BE IDENT16
|
|
#define SWAP16LE SWAP16
|
|
#define swap16be ident16
|
|
#define swap16le swap16
|
|
#define mem_inplace_swap16be mem_inplace_ident
|
|
#define mem_inplace_swap16le mem_inplace_swap16
|
|
#define memcpy_swap16be memcpy_ident16
|
|
#define memcpy_swap16le memcpy_swap16
|
|
#define SWAP32BE IDENT32
|
|
#define SWAP32LE SWAP32
|
|
#define swap32be ident32
|
|
#define swap32le swap32
|
|
#define mem_inplace_swap32be mem_inplace_ident
|
|
#define mem_inplace_swap32le mem_inplace_swap32
|
|
#define memcpy_swap32be memcpy_ident32
|
|
#define memcpy_swap32le memcpy_swap32
|
|
#define SWAP64BE IDENT64
|
|
#define SWAP64LE SWAP64
|
|
#define swap64be ident64
|
|
#define swap64le swap64
|
|
#define mem_inplace_swap64be mem_inplace_ident
|
|
#define mem_inplace_swap64le mem_inplace_swap64
|
|
#define memcpy_swap64be memcpy_ident64
|
|
#define memcpy_swap64le memcpy_swap64
|
|
#endif
|