Block #343,622

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 7:16:20 PM · Difficulty 10.1813 · 6,472,263 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3491f78155b237d7cac1a21741991a3f1dbefa45e5c0dc1317dcc8bc21f72ca1

Height

#343,622

Difficulty

10.181266

Transactions

2

Size

1.13 KB

Version

2

Bits

0a2e676d

Nonce

135,927

Timestamp

1/4/2014, 7:16:20 PM

Confirmations

6,472,263

Merkle Root

ecb58441aeedf66c657181bc08affa8d5d27ae7d441ac7c137b31640cf5812e4
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.

6.693 × 10¹⁰⁰(101-digit number)
66937002246072865109…96460710568974337921
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
6.693 × 10¹⁰⁰(101-digit number)
66937002246072865109…96460710568974337921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.338 × 10¹⁰¹(102-digit number)
13387400449214573021…92921421137948675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.677 × 10¹⁰¹(102-digit number)
26774800898429146043…85842842275897351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.354 × 10¹⁰¹(102-digit number)
53549601796858292087…71685684551794703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.070 × 10¹⁰²(103-digit number)
10709920359371658417…43371369103589406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.141 × 10¹⁰²(103-digit number)
21419840718743316834…86742738207178813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.283 × 10¹⁰²(103-digit number)
42839681437486633669…73485476414357626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.567 × 10¹⁰²(103-digit number)
85679362874973267339…46970952828715253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.713 × 10¹⁰³(104-digit number)
17135872574994653467…93941905657430507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.427 × 10¹⁰³(104-digit number)
34271745149989306935…87883811314861015041
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,771,193 XPM·at block #6,815,884 · 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