Block #215,459

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/18/2013, 2:31:56 AM · Difficulty 9.9255 · 6,592,687 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de11409da7fbffa7603a57c7c1dfdcef187501a2cfbc0cf07ff182d3dad216e1

Height

#215,459

Difficulty

9.925503

Transactions

2

Size

425 B

Version

2

Bits

09ecedc6

Nonce

50,376

Timestamp

10/18/2013, 2:31:56 AM

Confirmations

6,592,687

Merkle Root

678e393602c24d12fc4f0fd645e094a171fe80483446a52b8fb6a7f08a0274b3
Transactions (2)
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.

1.709 × 10⁹⁵(96-digit number)
17099488196570236380…91321231798399245799
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
1.709 × 10⁹⁵(96-digit number)
17099488196570236380…91321231798399245799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.419 × 10⁹⁵(96-digit number)
34198976393140472760…82642463596798491599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.839 × 10⁹⁵(96-digit number)
68397952786280945521…65284927193596983199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.367 × 10⁹⁶(97-digit number)
13679590557256189104…30569854387193966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.735 × 10⁹⁶(97-digit number)
27359181114512378208…61139708774387932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.471 × 10⁹⁶(97-digit number)
54718362229024756417…22279417548775865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.094 × 10⁹⁷(98-digit number)
10943672445804951283…44558835097551731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.188 × 10⁹⁷(98-digit number)
21887344891609902566…89117670195103462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.377 × 10⁹⁷(98-digit number)
43774689783219805133…78235340390206924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.754 × 10⁹⁷(98-digit number)
87549379566439610267…56470680780413849599
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,709,211 XPM·at block #6,808,145 · 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.

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