Search results
Jump to navigation
Jump to search
- ...ub>,c<sub>par</sub>),i<sub>j</sub>)=(k<sub>i<sub>j</sub></sub>,c<sub>i<sub>j</sub></sub>)), cannot be done more efficiently than a 2<sup>256</sup> brute ...27 KB (4,535 words) - 16:56, 24 April 2024
- ...the first byte and the ''(j-1)''-th byte as the last byte (''i ≥ 0'', ''j ≥ 0''). ...18 KB (2,932 words) - 06:14, 6 August 2022
- ...r joule (energy efficiency; 1 joule of energy is 1 watt during 1 second: 1 J = 1 W*s) * W = watt (maximum power consumption, i.e. energy per unit of time: 1 W = 1 J/s) ...23 KB (2,450 words) - 08:21, 28 March 2023
- for (int j = 0; j < 64; ++j) { sum += matrix[i][j] * vector[j]; ...22 KB (3,346 words) - 19:40, 16 January 2022
- ...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
- make -j 4 make -j 4 ...12 KB (1,650 words) - 04:12, 13 July 2016
- ...+6azoA6wJfG5v6l/3FP9XJEmZkIEOQG6YqhD1v35fZ4S8HQqabOIyBDILC/FvARtT6nvmFZJKp/J+XSmtIOoRVdhIZ2w7rRsqzAYhXBUJKbdMGgSVS3i0tgNel6XgeKWg8o7JbVR7/ums6AOsDNlw4V9 ...+6azoA6wJfG5v6l/3FP9XJEmZkIEOQG6YqhD1v35fZ4S8HQqabOIyBDILC/FvARtT6nvmFZJKp/J+XSmtIOoRVdhIZ2w7rRsqzAYhXBUJKbdMGgSVS3i0tgNel6XgeKWg8o7JbVR7/ums6AOsDNlw4V9 ...33 KB (5,541 words) - 05:11, 14 December 2023
- Define {'''K'''<sub>k</sub>}<sub>j</sub> to be the jth element of the sorted keys for derivation index k. ...6 KB (903 words) - 10:12, 1 January 2021
- 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