Block #2,476,319

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/16/2018, 10:07:44 PM · Difficulty 10.9644 · 4,366,016 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
fa6da53ab43521c2128945b99d2eba0079c7fcd87339c4a0b905b6bae6f8a106

Height

#2,476,319

Difficulty

10.964430

Transactions

55

Size

15.71 KB

Version

2

Bits

0af6e4dc

Nonce

758,080,382

Timestamp

1/16/2018, 10:07:44 PM

Confirmations

4,366,016

Merkle Root

81e480c976b9bb370c89a4a51cf6ba2a9e9adeb88c6bee2ba892a929edab03f9
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

5.574 × 10⁹³(94-digit number)
55742158022947323465…79834569654383146181
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
5.574 × 10⁹³(94-digit number)
55742158022947323465…79834569654383146181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.114 × 10⁹⁴(95-digit number)
11148431604589464693…59669139308766292361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.229 × 10⁹⁴(95-digit number)
22296863209178929386…19338278617532584721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.459 × 10⁹⁴(95-digit number)
44593726418357858772…38676557235065169441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.918 × 10⁹⁴(95-digit number)
89187452836715717544…77353114470130338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.783 × 10⁹⁵(96-digit number)
17837490567343143508…54706228940260677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.567 × 10⁹⁵(96-digit number)
35674981134686287017…09412457880521355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.134 × 10⁹⁵(96-digit number)
71349962269372574035…18824915761042711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.426 × 10⁹⁶(97-digit number)
14269992453874514807…37649831522085422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.853 × 10⁹⁶(97-digit number)
28539984907749029614…75299663044170844161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,983,086 XPM·at block #6,842,334 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy