Search results

Jump to: navigation, search
  • For example, imagine a block with three transactions ''a'', ''b'' and ''c''. The Merkle tree is: d3 = dhash(c)
    59 KB (8,414 words) - 18:08, 30 July 2021
  • <code>tomb lock bitcoin.tomb -k bitcoin.tomb.key</code> <blockquote><code>C:\Program Files\Bitcoin\bitcoin.exe -datadir=E:\Bitcoin</code></blockquote><
    24 KB (3,885 words) - 22:09, 17 June 2020
  • ...public keys are 52 characters and start with a capital L or K on mainnet (c on testnet). This is the same private key in (mainnet) wallet import format
    7 KB (1,091 words) - 14:14, 4 May 2019
  • |C |K
    7 KB (1,076 words) - 22:03, 28 October 2021
  • ...name="electrum-310-wif" /> etc<ref name="segvan-wif" />) instead of 5 (or c instead of 9 on testnet). This is the private key.
    4 KB (690 words) - 22:04, 28 October 2021
  • |K ''or'' L |c
    6 KB (929 words) - 21:35, 28 October 2021
  • ...ns. Authority to send coins is determined by two positive constants, t and k. The following txn rule limits the stake signing keys' spending authority: ...hange Returned to Public Key >= all coins sent to other addresses * {max(k,k*(t/coin-years on public key)}
    31 KB (5,050 words) - 13:34, 20 September 2019
  • ...de. An extended public key is represented as (K, c), with K = point(k) and c the chain code. ...tion CKDpriv((k<sub>par</sub>, c<sub>par</sub>), i) &rarr; (k<sub>i</sub>, c<sub>i</sub>) computes a child extended private key from the parent extended
    24 KB (4,015 words) - 16:50, 21 August 2020
  • ...é bitcoiny]], ale v konečnom dôsledku je bitcoin len číslo priradené k [[Address|bitcoinovej adrese]]. Fyzický bitcoin je objekt, napríklad min * Existujú viaceré služby, kde sa bitcoiny dajú [[buying bitcoins|kúpiť]] za tradičné meny
    44 KB (7,257 words) - 01:56, 10 June 2019
  • ...brute-force running time, being O(2^k) where k is the hash size eg SHA256, k=256, and if a pre-image was found anyone could very efficiently verify it b ...so that H(x)=H(x'), this can be done in much lower work O(sqrt(2^k))=O(2^(k/2)) because you can proceed by computing many H(x) values and storing them
    17 KB (2,742 words) - 18:33, 30 April 2019
  • ...the message block is read in per round, the amount of a left rotate and a k constant. The design of the sub block and the overall layout of the compres dLeft := rotleft(10) (c)
    5 KB (687 words) - 23:32, 30 June 2014
  • ...: Asus EAH4350 Silent. Memory at 400MHz. Runs at 60°C with ambient at 25°C. ...ows7 || -w 64, SDK 2.4, Cat 11.4. Model: Sony Vaio NW. OC core 680->825. U/C memory 800->500.
    131 KB (14,247 words) - 01:43, 10 June 2019
  • |s||3||j||n||5||4||k||h |c||e||6||m||u||a||7||l
    20 KB (3,128 words) - 17:59, 24 September 2019
  • * <code>write_bits_big_endian(stream, n, k)</code> appends the <code>k</code> least significant bits of integer <code>n</code> to the end of the s * <code>read_bits_big_endian(stream, k)</code> reads the next available <code>k</code> bits from the stream and interprets them as the least significant bi
    17 KB (2,527 words) - 15:18, 25 October 2019
  • (A or B) and (C or D or E) and (F or G) A and C and F
    23 KB (3,500 words) - 10:13, 1 January 2021
  • * Let ''k<sub>0</sub>'' be the 64-bit integer obtained by interpreting the first 8 by * Let ''k<sub>1</sub>'' be the 64-bit integer obtained by interpreting the second 8 b
    20 KB (3,092 words) - 23:56, 5 November 2019
  • ...due]) if they exist, which can be checked by squaring and comparing with ''c''.</ref> and ''has_even_y(P)'', or fails if no such point exists. The funct *** Let ''c = x<sup>3</sup> + 7 mod p''.
    35 KB (5,654 words) - 21:30, 12 February 2021
  • ** The last stack element is called the control block ''c'', and must have length ''33 + 32m'', for a value of ''m'' that is an integ ** Let ''p = c[1:33]'' and let ''P = lift_x(int(p))'' where ''lift_x'' and ''[:]'' are def
    39 KB (6,256 words) - 10:13, 1 January 2021