Block #339,501

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 3:57:46 AM · Difficulty 10.1262 · 6,468,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3af01e4b02094a83efeba7baea8510b3849c38e9adc14abcff713f7b94d500a1

Height

#339,501

Difficulty

10.126151

Transactions

7

Size

10.39 KB

Version

2

Bits

0a204b6f

Nonce

75,407

Timestamp

1/2/2014, 3:57:46 AM

Confirmations

6,468,099

Merkle Root

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

4.924 × 10¹⁰⁶(107-digit number)
49249538270258315254…45396323021321017691
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
4.924 × 10¹⁰⁶(107-digit number)
49249538270258315254…45396323021321017691
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.849 × 10¹⁰⁶(107-digit number)
98499076540516630508…90792646042642035381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.969 × 10¹⁰⁷(108-digit number)
19699815308103326101…81585292085284070761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.939 × 10¹⁰⁷(108-digit number)
39399630616206652203…63170584170568141521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.879 × 10¹⁰⁷(108-digit number)
78799261232413304406…26341168341136283041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.575 × 10¹⁰⁸(109-digit number)
15759852246482660881…52682336682272566081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.151 × 10¹⁰⁸(109-digit number)
31519704492965321762…05364673364545132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.303 × 10¹⁰⁸(109-digit number)
63039408985930643525…10729346729090264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.260 × 10¹⁰⁹(110-digit number)
12607881797186128705…21458693458180528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.521 × 10¹⁰⁹(110-digit number)
25215763594372257410…42917386916361057281
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,704,829 XPM·at block #6,807,599 · 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