Block #434,694

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 10:42:00 AM · Difficulty 10.3492 · 6,373,460 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54bda69102c4e49a8c953c2cf30f1aeecc79dcb063703ed6ffb2512f993325be

Height

#434,694

Difficulty

10.349201

Transactions

1

Size

937 B

Version

2

Bits

0a59653f

Nonce

137,965

Timestamp

3/8/2014, 10:42:00 AM

Confirmations

6,373,460

Merkle Root

cbf845b1d682202e6001e59029355ea69d7c25e5953c5e1879afa47a9a8cc068
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.794 × 10⁹⁸(99-digit number)
17948996451988765537…00952603464873804801
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.794 × 10⁹⁸(99-digit number)
17948996451988765537…00952603464873804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.589 × 10⁹⁸(99-digit number)
35897992903977531074…01905206929747609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.179 × 10⁹⁸(99-digit number)
71795985807955062148…03810413859495219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.435 × 10⁹⁹(100-digit number)
14359197161591012429…07620827718990438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.871 × 10⁹⁹(100-digit number)
28718394323182024859…15241655437980876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.743 × 10⁹⁹(100-digit number)
57436788646364049718…30483310875961753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.148 × 10¹⁰⁰(101-digit number)
11487357729272809943…60966621751923507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.297 × 10¹⁰⁰(101-digit number)
22974715458545619887…21933243503847014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.594 × 10¹⁰⁰(101-digit number)
45949430917091239774…43866487007694028801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.189 × 10¹⁰⁰(101-digit number)
91898861834182479549…87732974015388057601
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,709,277 XPM·at block #6,808,153 · 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