Block #429,205

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 3:08:20 PM · Difficulty 10.3474 · 6,378,646 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7837fb4922ec45ec6b2048ddf69cb68655d18504e43f572cd92bf14f51ea3bf1

Height

#429,205

Difficulty

10.347365

Transactions

8

Size

2.00 KB

Version

2

Bits

0a58ecef

Nonce

772,754

Timestamp

3/4/2014, 3:08:20 PM

Confirmations

6,378,646

Merkle Root

c7a77421a2f2d2fd703beb4f8f5d833950adb658ebd7b59555fa76c54ea7cb2d
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.615 × 10¹⁰⁰(101-digit number)
16152811355264680354…49435450852137210881
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.615 × 10¹⁰⁰(101-digit number)
16152811355264680354…49435450852137210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.230 × 10¹⁰⁰(101-digit number)
32305622710529360709…98870901704274421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.461 × 10¹⁰⁰(101-digit number)
64611245421058721418…97741803408548843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.292 × 10¹⁰¹(102-digit number)
12922249084211744283…95483606817097687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.584 × 10¹⁰¹(102-digit number)
25844498168423488567…90967213634195374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.168 × 10¹⁰¹(102-digit number)
51688996336846977134…81934427268390748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.033 × 10¹⁰²(103-digit number)
10337799267369395426…63868854536781496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.067 × 10¹⁰²(103-digit number)
20675598534738790853…27737709073562992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.135 × 10¹⁰²(103-digit number)
41351197069477581707…55475418147125985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.270 × 10¹⁰²(103-digit number)
82702394138955163415…10950836294251970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.654 × 10¹⁰³(104-digit number)
16540478827791032683…21901672588503941121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,706,847 XPM·at block #6,807,850 · 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