Block #433,971

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 10:59:58 PM · Difficulty 10.3458 · 6,375,881 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3c28759f6c9ad5dd541acf34243184416b5644a6903167a7a7a2e15d5e8d2bd9

Height

#433,971

Difficulty

10.345758

Transactions

2

Size

428 B

Version

2

Bits

0a588394

Nonce

13,636

Timestamp

3/7/2014, 10:59:58 PM

Confirmations

6,375,881

Merkle Root

0a9d4fbd341eb2d78c331e3a1bd12fb74391e124683df752df0416e0f0d032af
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.

2.546 × 10⁹³(94-digit number)
25464680579997329201…53114419640147942401
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.546 × 10⁹³(94-digit number)
25464680579997329201…53114419640147942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.092 × 10⁹³(94-digit number)
50929361159994658403…06228839280295884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.018 × 10⁹⁴(95-digit number)
10185872231998931680…12457678560591769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.037 × 10⁹⁴(95-digit number)
20371744463997863361…24915357121183539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.074 × 10⁹⁴(95-digit number)
40743488927995726722…49830714242367078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.148 × 10⁹⁴(95-digit number)
81486977855991453445…99661428484734156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.629 × 10⁹⁵(96-digit number)
16297395571198290689…99322856969468313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.259 × 10⁹⁵(96-digit number)
32594791142396581378…98645713938936627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.518 × 10⁹⁵(96-digit number)
65189582284793162756…97291427877873254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.303 × 10⁹⁶(97-digit number)
13037916456958632551…94582855755746508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.607 × 10⁹⁶(97-digit number)
26075832913917265102…89165711511493017601
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,722,903 XPM·at block #6,809,851 · 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