sebhtml

4 ms·

1. 1.▲
   My 2 cents about: Mercurial planning to transition away from SHA-1(lwn.net)

   6 points by sebhtml 6y ago|0 comments
2. 2.▲
   by sebhtml 7y ago

   big.tsv is basically the same line repeated 2 000 000 times: $ awk \ 'BEGIN{for (i=0; i<2000000; i++){print "abcdef\tghijk\tlmnop\tqrstuv\twxyz1234\tABCDEF\tHIJK\tLMNOP\tQRSTUV\tWXYZ123"}}' \ > big.tsv $
3. 3.▲
   by sebhtml 8y ago

   You input length is 101. If you "play" for a long time, eventually, all 64 6-grams will have occurred.
4. 4.▲
   by sebhtml 8y ago

   By using "1" for left (lastKey = 0) and "0" for right (lastKey = 1), I get 12%. A de Bruijn sequence DB(2, k) is spelled by an Eulerian path in the corresponding de Bruijn graph, whose vertices are {0, 1}^k and where any
5. 5.▲
   by sebhtml 8y ago

   I modified the "randomize!" button to inject the de Bruijn sequence DB(2,6), and I get a rate of 50%. Is there an error in my patch ? diff --git a/not-so-random.html b/not-so-random.html index 48c04da..c650b5b 1006