Block #468,527

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 1:51:19 PM · Difficulty 10.4316 · 6,357,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a275aef83645134fbc6fff4a7fd196be2b657aeb0a978efa3d06b05a8884e1d5

Height

#468,527

Difficulty

10.431558

Transactions

4

Size

1.79 KB

Version

2

Bits

0a6e7a9e

Nonce

184,277

Timestamp

3/31/2014, 1:51:19 PM

Confirmations

6,357,896

Merkle Root

8b16b99b1744d499dc07926b042c2e18b3ea8fbd3f8ec8724b3b0ea5c10a2d8e
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.684 × 10⁹¹(92-digit number)
16841885042204275414…64364508765521558081
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.684 × 10⁹¹(92-digit number)
16841885042204275414…64364508765521558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.368 × 10⁹¹(92-digit number)
33683770084408550829…28729017531043116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.736 × 10⁹¹(92-digit number)
67367540168817101659…57458035062086232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.347 × 10⁹²(93-digit number)
13473508033763420331…14916070124172464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.694 × 10⁹²(93-digit number)
26947016067526840663…29832140248344929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.389 × 10⁹²(93-digit number)
53894032135053681327…59664280496689858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.077 × 10⁹³(94-digit number)
10778806427010736265…19328560993379717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.155 × 10⁹³(94-digit number)
21557612854021472530…38657121986759434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.311 × 10⁹³(94-digit number)
43115225708042945061…77314243973518868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.623 × 10⁹³(94-digit number)
86230451416085890123…54628487947037736961
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,855,518 XPM·at block #6,826,422 · 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