Block #222,731

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/22/2013, 10:43:18 AM · Difficulty 9.9396 · 6,593,452 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7fdfe494e0c097c49d2dd42d5d697d7d60da3ba85ea8da4b2d33717d1b55dc45

Height

#222,731

Difficulty

9.939574

Transactions

3

Size

1.90 KB

Version

2

Bits

09f087e9

Nonce

378,319

Timestamp

10/22/2013, 10:43:18 AM

Confirmations

6,593,452

Merkle Root

92b42b81e7e5ee0bc0a2c9155f96119306fbea74b029a8cd9146d6246278115b
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.

2.041 × 10⁹⁵(96-digit number)
20418749692918632713…03796815242026649599
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
2.041 × 10⁹⁵(96-digit number)
20418749692918632713…03796815242026649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.083 × 10⁹⁵(96-digit number)
40837499385837265426…07593630484053299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.167 × 10⁹⁵(96-digit number)
81674998771674530853…15187260968106598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.633 × 10⁹⁶(97-digit number)
16334999754334906170…30374521936213196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.266 × 10⁹⁶(97-digit number)
32669999508669812341…60749043872426393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.533 × 10⁹⁶(97-digit number)
65339999017339624683…21498087744852787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.306 × 10⁹⁷(98-digit number)
13067999803467924936…42996175489705574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.613 × 10⁹⁷(98-digit number)
26135999606935849873…85992350979411148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.227 × 10⁹⁷(98-digit number)
52271999213871699746…71984701958822297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.045 × 10⁹⁸(99-digit number)
10454399842774339949…43969403917644595199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,773,590 XPM·at block #6,816,182 · 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