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… 続きを読む »
「SorachanCoin」タグアーカイブ
3n+1_conjecture 13, 3n + 1 seems that see “special”. 3n + 1は特別と感じ取れます。
It is a continuation of 3n + 1 conjecture 10.3n + 1 conjecture 10の続きです。 6n + 1 is not suitable because odd num… 続きを読む »
Blockchain and sha256 [5], Sigma0 and Maj
uint32_t Sigma0(uint32_t x) { return (x >> 2 | x << 30) ^ (x >> 13 | x << 19) ^ (x >… 続きを読む »
Blockchain and sha256 [4], Initialize
The hash has an initial value. And if operation doesn’t work, this initial value will come out. ハッシュには初期… 続きを読む »
Blockchain and sha256 [3], Sigma1 and Ch
Let’s decipher the center of sha256.さて、sha256の心臓部を解読していきましょう。 uint32_t Sigma1(uint32_t x) { return (x >>… 続きを読む »
3n+1_conjecture 12, combination コンビネーション
Everyone loves it, it’s a combination. (nCk = n! / (n – k)! k!)みんな大好き、コンビネーションです。 11C1 = 11 : odd … 続きを読む »
Blockchain and sha256 [2], Hash of distortion 歪みのハッシュ
We found that throwing different hash algorithms into the same inequality distorts the distance space between … 続きを読む »
Blockchain and sha256 [1], About mapping 写像について
Recently, it seems that the expression “mapping” is used instead of “correspondence”.C… 続きを読む »
3n+1_conjecture 11, When 101(binary number) continues 6 times, find the remainder of 7, 2進数101が6回続くとき、これの7の剰余を求めてみましょう。
Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. By the way, we often see… 続きを読む »
3n+1_conjecture 10, n^n + 1 ≡ 0 mod 3, 今度は、足してみるか。
Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. 今日も準備運動です。前々回、chapter357… 続きを読む »
3n+1_conjecture 8, n^n – 1 ≡ 0 mod 3, nのn乗から1を引いた整数が、3で割りきれるときのnを求めてみましょう。
Now, Let’s preparatory exercise for the solution of 3n + 1 conjecture today too. Today is an interesting… 続きを読む »
3n+1_conjecture 7, There is 88 that is the sum of consecutive natural numbers. 連続する自然数の和が88になる、その連続した自然数を求めてみましょう。
Before 3n + 1 conjecture, let’s get used to handling integers and do a preparatory exercise. Q: There is… 続きを読む »
3n+1_conjecture 6, it looks like an orphan block. なんか孤児ブロックに似ている。
For example, 3n – 1 have the property of loop the same number. 3n – 1 :3 -> 8 -> 4 -> 2 -… 続きを読む »
3n+1_conjecture 5, Certainly, there is something to sequence for a long time. But, there is no problem. 題意の規則を辿るのがやたらと長い整数があります。しかし、それは問題ではありません。
In 3n + 1 conjecture, there is a debate about why there is something to sequence for a long time. (e.g., a1=27… 続きを読む »
3n+1_conjecture 3, otherwise … e.g: 5n + 1 さもなければ、5n +1
If you try, you will know immediately, if it is 5n + 1 … not suitable. It’s interesting … and now,… 続きを読む »