Search results
Jump to navigation
Jump to search
- for j in l: m = bech32_mul(m, (x if i == j else i) ^ j) ...38 KB (5,536 words) - 04:47, 31 May 2024
- |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
- | William J. Luther, Josiah Olson | William J. Luther ...20 KB (2,679 words) - 03:00, 1 July 2020
- ** For ''j'' in ''[0,1,...,m-1]'': *** Let ''e<sub>j</sub> = c[33+32j:65+32j]''. ...43 KB (6,814 words) - 18:04, 29 June 2023
- ...(j - i)''-byte array with a copy of the ''i''-th byte (inclusive) to the ''j''-th byte (exclusive) of ''x''. * For ''j = 1 .. u'': ...68 KB (10,863 words) - 04:28, 29 May 2024
- Thanks to Gregory Maxwell and Wladimir J. van der Laan for their suggestions. ...6 KB (920 words) - 12:35, 11 October 2019
- |j | style="background: #EEEEBB; color: black; text-align : center;" | j ...30 KB (4,018 words) - 15:52, 15 December 2021
- Random J. User <address@dom.ain> Random J. User ...16 KB (2,623 words) - 10:02, 1 January 2021
- Author: Wladimir J. van der Laan <laanwj@gmail.com> ...8 KB (1,315 words) - 22:59, 26 April 2024
- ...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
- for (unsigned int j = 0; j < depth; j++) memcpy(path[j].begin(), &pathdata[32 * j], 32); ...23 KB (3,500 words) - 19:01, 13 May 2024
- ...uggested<ref>Sattath, O. On the insecurity of quantum Bitcoin mining. Int. J. Inf. Secur. 19, 291–302 (2020). https://doi.org/10.1007/s10207-020-00493-9 ...ockchain: Research and Applications, 4(3), 100141. https://doi.org/10.1016/j.bcra.2023.100141 </ref> it was shown that the optimal mining time for the f ...9 KB (1,374 words) - 08:42, 15 May 2024
- ...pears for the first time before an occurrence of <tt>@j</tt> for some <tt>j < i</tt>; for example, the first placeholder is always <tt>@0</tt>, the nex ...26 KB (3,980 words) - 17:22, 13 May 2024
- ...(j - i)''-byte array with a copy of the ''i''-th byte (inclusive) to the ''j''-th byte (exclusive) of ''x''. ...39 KB (6,291 words) - 17:37, 6 May 2024
- ...rely require the ability to hash and concatenate values on the stack. <ref>J. Rubin, "[bitcoin-dev] OP_CAT Makes Bitcoin Quantum Secure [was CheckSigFro ...10 KB (1,649 words) - 20:08, 6 May 2024
- xc3sprog -c cm1 -v -j ...11 KB (1,809 words) - 08:14, 16 September 2012
- ...at a paper with solutions could be written. The lead developer is Wladimir J. van der Laan, who took over the role on 8 April 2014.<ref name="hunt"/> [[ ...13 KB (1,766 words) - 07:50, 26 September 2022
- sudo make -j 4 ...12 KB (1,602 words) - 22:45, 13 April 2015
- make -j 4 ...16 KB (2,158 words) - 02:31, 21 July 2015
- |s||3||j||n||5||4||k||h ...20 KB (3,196 words) - 18:51, 25 April 2024