Search results

Create the page "J" on this wiki! See also the search results found.

• Wladimir van der Laan
  }}'''Wladimir J. van der Laan''' is the current [[Core maintainer|maintainer]] of [[Bitcoin
  1 KB (167 words) - 17:52, 30 December 2023
• Non-specialized hardware comparison
  ! Model !! Mhash/s !! Mhash/J !! Mhash/s/$<ref name='amazon_20110625'/> !! Watts !! Clock !! SP !! SDK !! ...z; cmd line args: VECTORS BFI_INT AGGRESSION=11 WORKSIZE=128; power and MH/J calculated using Power = C*f*v^2 w/ assumption of 175 W at stock settings w
  131 KB (14,245 words) - 23:09, 13 February 2023
• ASIC
  ...in [[hash per second|hash rate]] (e.g. Gh/s) at a certain efficiency (e.g. J/Gh). While cost is another factor, this is often a relatively fixed factor
  8 KB (1,229 words) - 00:26, 24 April 2019
• Libbitcoin Client
  ...20120725.pdf "The security impact of a new cryptographic library" - Daniel J. Bernstein et. al.]</ref>
  7 KB (885 words) - 01:23, 9 March 2021
• Avalon4 mini
  make -j 4
  3 KB (372 words) - 08:08, 16 November 2015
• List of Bitcoin mining ASICs
  |mining=8Gh:(0.3/8)J@0.7V,12Gh:(0.3/8)J@0.7V,6Gh:(0.2/6)J@0.55V,9Gh:(0.2/9)J@0.55V, |mining=(24/64)Gh:(130/24)J
  100 KB (13,759 words) - 12:54, 22 January 2018
• BIP 0103
  Thanks to Gregory Maxwell and Wladimir J. van der Laan for their suggestions.
  6 KB (920 words) - 12:35, 11 October 2019
• Avalon6
  # make -j 4
  22 KB (3,104 words) - 07:59, 15 August 2016
• BIP 0002
  Random J. User <address@dom.ain>
  34 KB (5,448 words) - 06:34, 18 December 2023
• BIP 0124
  Define {'''K'''_k}_j to be the jth element of the sorted keys for derivation index k.
  6 KB (903 words) - 10:12, 1 January 2021
• BIP 0173
  |s||3||j||n||5||4||k||h
  20 KB (3,132 words) - 15:56, 15 December 2021
• BIP 0155
  Author: Wladimir J. van der Laan <laanwj@gmail.com>
  8 KB (1,266 words) - 15:48, 15 December 2021
• BIP 0136
  |j | style="background: #EEEEBB; color: black; text-align : center;" | j
  30 KB (4,018 words) - 15:52, 15 December 2021
• BIP 0114
  for (unsigned int j = 0; j < depth; j++) memcpy(path[j].begin(), &pathdata[32 * j], 32);
  23 KB (3,500 words) - 10:13, 1 January 2021
• BIP 0052
  for (int j = 0; j < 64; ++j) { sum += matrix[i][j] * vector[j];
  22 KB (3,346 words) - 19:40, 16 January 2022
• BIP 0340
  ...(j - i)''-byte array with a copy of the ''i''-th byte (inclusive) to the ''j''-th byte (exclusive) of ''x''.
  39 KB (6,306 words) - 09:34, 29 May 2023
• BIP 0341
  ** For ''j'' in ''[0,1,...,m-1]'': *** Let ''e_j = c[33+32j:65+32j]''.
  43 KB (6,814 words) - 18:04, 29 June 2023
• BIP 0371
  ...+6azoA6wJfG5v6l/3FP9XJEmZkIEOQG6YqhD1v35fZ4S8HQqabOIyBDILC/FvARtT6nvmFZJKp/J+XSmtIOoRVdhIZ2w7rRsqzAYhXBUJKbdMGgSVS3i0tgNel6XgeKWg8o7JbVR7/ums6AOsDNlw4V9 ...+6azoA6wJfG5v6l/3FP9XJEmZkIEOQG6YqhD1v35fZ4S8HQqabOIyBDILC/FvARtT6nvmFZJKp/J+XSmtIOoRVdhIZ2w7rRsqzAYhXBUJKbdMGgSVS3i0tgNel6XgeKWg8o7JbVR7/ums6AOsDNlw4V9
  33 KB (5,541 words) - 05:11, 14 December 2023
• Message signing
  ...the first byte and the ''(j-1)''-th byte as the last byte (''i &ge; 0'', ''j &ge; 0'').
  18 KB (2,932 words) - 06:14, 6 August 2022
• BIP 0093
  for j in l: m = bech32_mul(m, (x if i == j else i) ^ j)
  38 KB (5,537 words) - 05:05, 30 March 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)