ICANN TLDs will become available for auction at block 210240, around January 31 to February 2, 2024. As there's interest in preventing ICANN TLD trading on chain, we need to either completely disable claims and permanently seal reservations (soft-fork), or extend the claim period for these reserved names (hard-fork). Names on the reserved list fall into several categories: ROOT (ICANN TLDs),
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[ | |
"ubuntu", | |
"marples", | |
"darksi", | |
"icann", | |
"blockstack", | |
"cloudflare", | |
"gnunet", | |
"eth", | |
"verisign", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[ | |
"marples", | |
"darksi", | |
"eth", | |
"namecheap", | |
"riseup", | |
"webtorrent", | |
"keybase", | |
"m-d", | |
"brave" |
I hereby claim:
- I am nodech on github.
- I am nodech (https://keybase.io/nodech) on keybase.
- I have a public key ASA7HzbXhMFFmvY7khUDLhyRGMiRhTrXM3BJS7S5EcOXowo
To claim this, I am signing this object:
- GDoc: QUIC at 10k feet
- Medium: Why quick is not the next big thing
- YTVideo:QUIC: Replacing TCP for the Web by Jana Iyengar(2018)
- YTVideo:QUIC: in Theory and Practice - Robin Marx | DeltaV 2018
- YTVideo:Fixing HTTP/2 and preparing for HTTP/3 over QUIC - Robin Marx | O'Reilly Velocity Berlin 2019
- YTVideo: HTTP/3 and QUIC: the detials by Robi Marx (2019)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use strict'; | |
const assert = require('assert'); | |
// Code .. | |
console.log(`remainder => ${ffmul25(26, 5)}`); | |
{ | |
const mul = ffmul25(0x1d, 0x02); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const {hd, KeyRing} = require('bcoin'); | |
const {HDPrivateKey} = hd; | |
const mnemonic = 'midnight volcano start infant error drama bulk disorder' | |
+ ' mouse key cliff climb buyer wage ceiling load express earth trick' | |
+ ' broccoli siege math hope attend'; | |
const privateKey = HDPrivateKey.fromPhrase(mnemonic); | |
const deriveSomething = privateKey.derivePath(`m/44'/1/0/0/0`); | |
const ring = KeyRing.fromPrivate(deriveSomething.privateKey); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use strict'; | |
const assert = require('assert'); | |
const bcash = require('..'); | |
const {Stack, Script, Address} = bcash; | |
const {MTX, Outpoint, Input} = bcash; | |
const network = 'regtest'; | |
// fill after receive receiving |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// copyright (c) 2018 the bitcoin developers | |
// distributed under the mit software license, see the accompanying | |
// file copying or http://www.opensource.org/licenses/mit-license.php. | |
#include "test/test_bitcoin.h" | |
#include "policy/policy.h" | |
#include "script/interpreter.h" | |
#include <boost/test/unit_test.hpp> |
NewerOlder