Block #434,242

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 3:58:15 AM · Difficulty 10.3429 · 6,383,634 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e5eee64d6e0c2d96f93b7b7338208502507acbe130bb345e04730b81fe094b9

Height

#434,242

Difficulty

10.342886

Transactions

3

Size

1.03 KB

Version

2

Bits

0a57c75b

Nonce

773,759

Timestamp

3/8/2014, 3:58:15 AM

Confirmations

6,383,634

Merkle Root

b7c5322b8284876a45860a668d13d318b58e936b2d6ea420cadfdfa3d02892a3
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.391 × 10⁹⁹(100-digit number)
23911134434505247182…14801174173305079681
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.391 × 10⁹⁹(100-digit number)
23911134434505247182…14801174173305079681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.782 × 10⁹⁹(100-digit number)
47822268869010494365…29602348346610159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.564 × 10⁹⁹(100-digit number)
95644537738020988730…59204696693220318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.912 × 10¹⁰⁰(101-digit number)
19128907547604197746…18409393386440637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.825 × 10¹⁰⁰(101-digit number)
38257815095208395492…36818786772881274881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.651 × 10¹⁰⁰(101-digit number)
76515630190416790984…73637573545762549761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.530 × 10¹⁰¹(102-digit number)
15303126038083358196…47275147091525099521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.060 × 10¹⁰¹(102-digit number)
30606252076166716393…94550294183050199041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.121 × 10¹⁰¹(102-digit number)
61212504152333432787…89100588366100398081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.224 × 10¹⁰²(103-digit number)
12242500830466686557…78201176732200796161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.448 × 10¹⁰²(103-digit number)
24485001660933373115…56402353464401592321
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,787,067 XPM·at block #6,817,875 · 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