Block #2,377,707

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/13/2017, 1:21:19 PM · Difficulty 10.8796 · 4,465,316 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b00d47837d3ada2ba1a51558f15d98d16e633789f905cfbe288bd39289d955f

Height

#2,377,707

Difficulty

10.879633

Transactions

6

Size

1.17 KB

Version

2

Bits

0ae12f9d

Nonce

768,347,853

Timestamp

11/13/2017, 1:21:19 PM

Confirmations

4,465,316

Merkle Root

d5340a3d3cafa5e5b3b526413465f0d6cd400eeed65f41c7c112cb3a04f83a66
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.

3.068 × 10⁹⁴(95-digit number)
30682338996623287957…48276562400723799041
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
3.068 × 10⁹⁴(95-digit number)
30682338996623287957…48276562400723799041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.136 × 10⁹⁴(95-digit number)
61364677993246575914…96553124801447598081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.227 × 10⁹⁵(96-digit number)
12272935598649315182…93106249602895196161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.454 × 10⁹⁵(96-digit number)
24545871197298630365…86212499205790392321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.909 × 10⁹⁵(96-digit number)
49091742394597260731…72424998411580784641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.818 × 10⁹⁵(96-digit number)
98183484789194521463…44849996823161569281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.963 × 10⁹⁶(97-digit number)
19636696957838904292…89699993646323138561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.927 × 10⁹⁶(97-digit number)
39273393915677808585…79399987292646277121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.854 × 10⁹⁶(97-digit number)
78546787831355617170…58799974585292554241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.570 × 10⁹⁷(98-digit number)
15709357566271123434…17599949170585108481
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,988,537 XPM·at block #6,843,022 · 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