Block #2,237,226

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2017, 10:40:31 PM · Difficulty 10.9463 · 4,607,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
973f23341798f7f88df97e3934e8dfb2942f9fa1237697def354c2648acfd788

Height

#2,237,226

Difficulty

10.946280

Transactions

6

Size

2.89 KB

Version

2

Bits

0af23f6a

Nonce

1,275,212,504

Timestamp

8/4/2017, 10:40:31 PM

Confirmations

4,607,276

Merkle Root

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

8.800 × 10⁹³(94-digit number)
88001265611407678102…46393561176226551041
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
8.800 × 10⁹³(94-digit number)
88001265611407678102…46393561176226551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.760 × 10⁹⁴(95-digit number)
17600253122281535620…92787122352453102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.520 × 10⁹⁴(95-digit number)
35200506244563071241…85574244704906204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.040 × 10⁹⁴(95-digit number)
70401012489126142482…71148489409812408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.408 × 10⁹⁵(96-digit number)
14080202497825228496…42296978819624816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.816 × 10⁹⁵(96-digit number)
28160404995650456992…84593957639249633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.632 × 10⁹⁵(96-digit number)
56320809991300913985…69187915278499266561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.126 × 10⁹⁶(97-digit number)
11264161998260182797…38375830556998533121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.252 × 10⁹⁶(97-digit number)
22528323996520365594…76751661113997066241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.505 × 10⁹⁶(97-digit number)
45056647993040731188…53503322227994132481
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:58,000,413 XPM·at block #6,844,501 · 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