Block #435,027

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 3:32:45 PM · Difficulty 10.3546 · 6,382,382 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a23327aa3d35f30bedbb7e68076a7ec1051987cbd56fb51a97ed9f3334220bfe

Height

#435,027

Difficulty

10.354628

Transactions

16

Size

4.09 KB

Version

2

Bits

0a5ac8ea

Nonce

196,499

Timestamp

3/8/2014, 3:32:45 PM

Confirmations

6,382,382

Merkle Root

4df7e441fbbc661aa07ebe04e03ef63095745098b39a2da52dad97a5ec21a616
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.389 × 10⁹⁷(98-digit number)
13899029431989546580…26201750259430263041
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.389 × 10⁹⁷(98-digit number)
13899029431989546580…26201750259430263041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.779 × 10⁹⁷(98-digit number)
27798058863979093160…52403500518860526081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.559 × 10⁹⁷(98-digit number)
55596117727958186320…04807001037721052161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.111 × 10⁹⁸(99-digit number)
11119223545591637264…09614002075442104321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.223 × 10⁹⁸(99-digit number)
22238447091183274528…19228004150884208641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.447 × 10⁹⁸(99-digit number)
44476894182366549056…38456008301768417281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.895 × 10⁹⁸(99-digit number)
88953788364733098113…76912016603536834561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.779 × 10⁹⁹(100-digit number)
17790757672946619622…53824033207073669121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.558 × 10⁹⁹(100-digit number)
35581515345893239245…07648066414147338241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.116 × 10⁹⁹(100-digit number)
71163030691786478490…15296132828294676481
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,783,316 XPM·at block #6,817,408 · 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