「SorachanCoin-core」タグアーカイブ

Blockchain and sha256 [6], Round

void Round(uint32_t a, uint32_t b, uint32_t c, uint32_t& d, uint32_t e, uint32_t f, uint32_t g, uint32_t&a… 続きを読む »

It is a continuation of 3n + 1 conjecture 10.3n + 1 conjecture 10の続きです。 6n + 1 is not suitable because odd num… 続きを読む »

uint32_t Sigma0(uint32_t x) { return (x >> 2 | x << 30) ^ (x >> 13 | x << 19) ^ (x &gt… 続きを読む »

The hash has an initial value. And if operation doesn’t work, this initial value will come out. ハッシュには初期… 続きを読む »

Let’s decipher the center of sha256.さて、sha256の心臓部を解読していきましょう。 uint32_t Sigma1(uint32_t x) { return (x >>… 続きを読む »

Everyone loves it, it’s a combination. (nCk = n! / (n – k)! k!)みんな大好き、コンビネーションです。 11C1 = 11 : odd … 続きを読む »

We found that throwing different hash algorithms into the same inequality distorts the distance space between … 続きを読む »

Recently, it seems that the expression “mapping” is used instead of “correspondence”.C… 続きを読む »

Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. By the way, we often see… 続きを読む »

Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. 今日も準備運動です。前々回、chapter357… 続きを読む »

3 may be a mysterious number.Well, it is practice for solve today too. 3は、ミステリアスな数かもしれません。ところで、今日も練習ですね。頑張りましょ… 続きを読む »

Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. Today is an interesting… 続きを読む »

Before 3n + 1 conjecture, let’s get used to handling integers and do a preparatory exercise. Q: There is… 続きを読む »

For example, 3n – 1 have the property of loop the same number. 3n – 1 :3 -> 8 -> 4 -> 2 -… 続きを読む »

In 3n + 1 conjecture, there is a debate about why there is something to sequence for a long time. (e.g., a1=27… 続きを読む »