Search results
Create the page "J" on this wiki! See also the search results found.
- 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
- ...(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
- ...rely require the ability to hash and concatenate values on the stack. <ref>J. Rubin, "[bitcoin-dev] OP_CAT Makes Bitcoin Quantum Secure [was CheckSigFro10 KB (1,649 words) - 20:08, 6 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 nex26 KB (3,980 words) - 17:22, 13 May 2024
- |s||3||j||n||5||4||k||h49 KB (7,978 words) - 04:49, 31 May 2024