Block #213,667

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/17/2013, 12:16:40 AM · Difficulty 9.9221 · 6,592,890 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de04fc2902ba89f37b76a5723c80d9da7f83ff3bed93d1130341c7a24aab5cfd

Height

#213,667

Difficulty

9.922132

Transactions

2

Size

4.43 KB

Version

2

Bits

09ec10de

Nonce

8,673

Timestamp

10/17/2013, 12:16:40 AM

Confirmations

6,592,890

Merkle Root

54326c9ccdd885178924a30c38da31a1350d84efaff449b64945facf2eb8184e
Transactions (2)
1 in → 1 out10.2300 XPM109 B
29 in → 1 out250.6400 XPM4.24 KB
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.631 × 10⁹¹(92-digit number)
26315754933065489866…78148741805513507199
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.631 × 10⁹¹(92-digit number)
26315754933065489866…78148741805513507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.263 × 10⁹¹(92-digit number)
52631509866130979732…56297483611027014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.052 × 10⁹²(93-digit number)
10526301973226195946…12594967222054028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.105 × 10⁹²(93-digit number)
21052603946452391892…25189934444108057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.210 × 10⁹²(93-digit number)
42105207892904783785…50379868888216115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.421 × 10⁹²(93-digit number)
84210415785809567571…00759737776432230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.684 × 10⁹³(94-digit number)
16842083157161913514…01519475552864460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.368 × 10⁹³(94-digit number)
33684166314323827028…03038951105728921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.736 × 10⁹³(94-digit number)
67368332628647654057…06077902211457843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.347 × 10⁹⁴(95-digit number)
13473666525729530811…12155804422915686399
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,696,551 XPM·at block #6,806,556 · 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