2016-04-24 12:10:29 +02:00
|
|
|
#include "bitcoin/block.h"
|
2016-08-18 06:53:45 +02:00
|
|
|
#include "bitcoin/pullpush.h"
|
2016-04-24 12:10:29 +02:00
|
|
|
#include "bitcoin/tx.h"
|
|
|
|
#include <ccan/str/hex/hex.h>
|
2017-12-18 07:44:10 +01:00
|
|
|
#include <common/type_to_string.h>
|
2016-04-24 12:10:29 +02:00
|
|
|
|
2020-01-23 15:06:02 +01:00
|
|
|
static void sha256_varint(struct sha256_ctx *ctx, u64 val)
|
|
|
|
{
|
|
|
|
u8 vt[VARINT_MAX_LEN];
|
|
|
|
size_t vtlen;
|
|
|
|
vtlen = varint_put(vt, val);
|
|
|
|
sha256_update(ctx, vt, vtlen);
|
|
|
|
}
|
|
|
|
|
2016-04-24 12:10:29 +02:00
|
|
|
/* Encoding is <blockhdr> <varint-num-txs> <tx>... */
|
2019-07-30 19:51:53 +02:00
|
|
|
struct bitcoin_block *
|
|
|
|
bitcoin_block_from_hex(const tal_t *ctx, const struct chainparams *chainparams,
|
|
|
|
const char *hex, size_t hexlen)
|
2016-04-24 12:10:29 +02:00
|
|
|
{
|
|
|
|
struct bitcoin_block *b;
|
|
|
|
u8 *linear_tx;
|
|
|
|
const u8 *p;
|
|
|
|
size_t len, i, num;
|
2020-01-23 13:38:13 +01:00
|
|
|
struct sha256_ctx shactx;
|
2016-04-24 12:10:29 +02:00
|
|
|
|
|
|
|
if (hexlen && hex[hexlen-1] == '\n')
|
|
|
|
hexlen--;
|
|
|
|
|
|
|
|
/* Set up the block for success. */
|
|
|
|
b = tal(ctx, struct bitcoin_block);
|
|
|
|
|
|
|
|
/* De-hex the array. */
|
|
|
|
len = hex_data_size(hexlen);
|
|
|
|
p = linear_tx = tal_arr(ctx, u8, len);
|
|
|
|
if (!hex_decode(hex, hexlen, linear_tx, len))
|
|
|
|
return tal_free(b);
|
|
|
|
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_init(&shactx);
|
|
|
|
|
2019-04-12 21:57:52 +02:00
|
|
|
b->hdr.version = pull_le32(&p, &len);
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_le32(&shactx, b->hdr.version);
|
|
|
|
|
2019-04-12 21:57:52 +02:00
|
|
|
pull(&p, &len, &b->hdr.prev_hash, sizeof(b->hdr.prev_hash));
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_update(&shactx, &b->hdr.prev_hash, sizeof(b->hdr.prev_hash));
|
|
|
|
|
2019-04-12 21:57:52 +02:00
|
|
|
pull(&p, &len, &b->hdr.merkle_hash, sizeof(b->hdr.merkle_hash));
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_update(&shactx, &b->hdr.merkle_hash, sizeof(b->hdr.merkle_hash));
|
|
|
|
|
2019-04-12 21:57:52 +02:00
|
|
|
b->hdr.timestamp = pull_le32(&p, &len);
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_le32(&shactx, b->hdr.timestamp);
|
2019-04-12 21:57:52 +02:00
|
|
|
|
2019-09-26 00:42:26 +02:00
|
|
|
if (is_elements(chainparams)) {
|
2019-04-12 21:57:52 +02:00
|
|
|
b->elements_hdr = tal(b, struct elements_block_hdr);
|
|
|
|
b->elements_hdr->block_height = pull_le32(&p, &len);
|
2020-01-23 16:00:09 +01:00
|
|
|
sha256_le32(&shactx, b->elements_hdr->block_height);
|
2019-04-12 21:57:52 +02:00
|
|
|
|
|
|
|
size_t challenge_len = pull_varint(&p, &len);
|
2020-01-23 16:00:09 +01:00
|
|
|
sha256_varint(&shactx, challenge_len);
|
|
|
|
sha256_update(&shactx, p, challenge_len);
|
2019-04-12 21:57:52 +02:00
|
|
|
b->elements_hdr->proof.challenge = tal_arr(b->elements_hdr, u8, challenge_len);
|
|
|
|
pull(&p, &len, b->elements_hdr->proof.challenge, challenge_len);
|
|
|
|
|
|
|
|
size_t solution_len = pull_varint(&p, &len);
|
|
|
|
b->elements_hdr->proof.solution = tal_arr(b->elements_hdr, u8, solution_len);
|
|
|
|
pull(&p, &len, b->elements_hdr->proof.solution, solution_len);
|
|
|
|
|
|
|
|
} else {
|
|
|
|
b->hdr.target = pull_le32(&p, &len);
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_le32(&shactx, b->hdr.target);
|
|
|
|
|
2019-04-12 21:57:52 +02:00
|
|
|
b->hdr.nonce = pull_le32(&p, &len);
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_le32(&shactx, b->hdr.nonce);
|
2019-04-12 21:57:52 +02:00
|
|
|
}
|
2020-01-23 13:38:13 +01:00
|
|
|
sha256_double_done(&shactx, &b->hdr.hash.shad);
|
2019-04-12 21:57:52 +02:00
|
|
|
|
2016-04-24 12:10:29 +02:00
|
|
|
num = pull_varint(&p, &len);
|
|
|
|
b->tx = tal_arr(b, struct bitcoin_tx *, num);
|
2019-07-30 19:51:53 +02:00
|
|
|
for (i = 0; i < num; i++) {
|
2016-04-24 12:10:29 +02:00
|
|
|
b->tx[i] = pull_bitcoin_tx(b->tx, &p, &len);
|
2019-07-30 19:51:53 +02:00
|
|
|
b->tx[i]->chainparams = chainparams;
|
|
|
|
}
|
2016-04-24 12:10:29 +02:00
|
|
|
|
|
|
|
/* We should end up not overrunning, nor have extra */
|
|
|
|
if (!p || len)
|
|
|
|
return tal_free(b);
|
|
|
|
|
|
|
|
tal_free(linear_tx);
|
|
|
|
return b;
|
|
|
|
}
|
2016-04-24 12:11:20 +02:00
|
|
|
|
2019-04-13 17:55:06 +02:00
|
|
|
void bitcoin_block_blkid(const struct bitcoin_block *b,
|
|
|
|
struct bitcoin_blkid *out)
|
|
|
|
{
|
|
|
|
struct sha256_ctx shactx;
|
|
|
|
|
|
|
|
sha256_init(&shactx);
|
|
|
|
sha256_le32(&shactx, b->hdr.version);
|
|
|
|
sha256_update(&shactx, &b->hdr.prev_hash, sizeof(b->hdr.prev_hash));
|
|
|
|
sha256_update(&shactx, &b->hdr.merkle_hash, sizeof(b->hdr.merkle_hash));
|
|
|
|
sha256_le32(&shactx, b->hdr.timestamp);
|
|
|
|
|
2019-09-26 00:42:26 +02:00
|
|
|
if (is_elements(chainparams)) {
|
2019-04-13 17:55:06 +02:00
|
|
|
size_t clen = tal_bytelen(b->elements_hdr->proof.challenge);
|
|
|
|
sha256_le32(&shactx, b->elements_hdr->block_height);
|
|
|
|
|
2020-01-23 15:06:02 +01:00
|
|
|
sha256_varint(&shactx, clen);
|
2019-04-13 17:55:06 +02:00
|
|
|
sha256_update(&shactx, b->elements_hdr->proof.challenge, clen);
|
|
|
|
/* The solution is skipped, since that'd create a circular
|
|
|
|
* dependency apparently */
|
|
|
|
} else {
|
|
|
|
sha256_le32(&shactx, b->hdr.target);
|
|
|
|
sha256_le32(&shactx, b->hdr.nonce);
|
|
|
|
}
|
|
|
|
sha256_double_done(&shactx, &out->shad);
|
|
|
|
}
|
|
|
|
|
2017-12-18 07:44:10 +01:00
|
|
|
/* We do the same hex-reversing crud as txids. */
|
2016-04-24 12:11:20 +02:00
|
|
|
bool bitcoin_blkid_from_hex(const char *hexstr, size_t hexstr_len,
|
2017-12-18 07:44:10 +01:00
|
|
|
struct bitcoin_blkid *blockid)
|
2016-04-24 12:11:20 +02:00
|
|
|
{
|
2017-12-18 07:41:52 +01:00
|
|
|
struct bitcoin_txid fake_txid;
|
|
|
|
if (!bitcoin_txid_from_hex(hexstr, hexstr_len, &fake_txid))
|
|
|
|
return false;
|
2017-12-18 07:44:10 +01:00
|
|
|
blockid->shad = fake_txid.shad;
|
2017-12-18 07:41:52 +01:00
|
|
|
return true;
|
2016-04-24 12:11:20 +02:00
|
|
|
}
|
|
|
|
|
2017-12-18 07:44:10 +01:00
|
|
|
bool bitcoin_blkid_to_hex(const struct bitcoin_blkid *blockid,
|
2016-04-24 12:11:20 +02:00
|
|
|
char *hexstr, size_t hexstr_len)
|
|
|
|
{
|
2017-12-18 07:41:52 +01:00
|
|
|
struct bitcoin_txid fake_txid;
|
2017-12-18 07:44:10 +01:00
|
|
|
fake_txid.shad = blockid->shad;
|
2017-12-18 07:41:52 +01:00
|
|
|
return bitcoin_txid_to_hex(&fake_txid, hexstr, hexstr_len);
|
2016-04-24 12:11:20 +02:00
|
|
|
}
|
2017-12-22 02:25:01 +01:00
|
|
|
|
|
|
|
static char *fmt_bitcoin_blkid(const tal_t *ctx,
|
|
|
|
const struct bitcoin_blkid *blkid)
|
|
|
|
{
|
|
|
|
char *hexstr = tal_arr(ctx, char, hex_str_size(sizeof(*blkid)));
|
|
|
|
|
|
|
|
bitcoin_blkid_to_hex(blkid, hexstr, hex_str_size(sizeof(*blkid)));
|
|
|
|
return hexstr;
|
|
|
|
}
|
|
|
|
REGISTER_TYPE_TO_STRING(bitcoin_blkid, fmt_bitcoin_blkid);
|