Block #322,548

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 2:04:17 AM · Difficulty 10.1938 · 6,487,632 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61c1f7a6344ecbe4e7b0dde513ada5027f20b5993b3a8f848237111c71071b9a

Height

#322,548

Difficulty

10.193812

Transactions

4

Size

6.35 KB

Version

2

Bits

0a319da2

Nonce

126,125

Timestamp

12/21/2013, 2:04:17 AM

Confirmations

6,487,632

Merkle Root

38bfc14977ab4fa2cf448bb0fb763a619f58410e451cdd2c8e2f4c09dc560f86
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.273 × 10¹⁰¹(102-digit number)
42733324831784252114…20694643054168456281
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.273 × 10¹⁰¹(102-digit number)
42733324831784252114…20694643054168456281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.546 × 10¹⁰¹(102-digit number)
85466649663568504228…41389286108336912561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.709 × 10¹⁰²(103-digit number)
17093329932713700845…82778572216673825121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.418 × 10¹⁰²(103-digit number)
34186659865427401691…65557144433347650241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.837 × 10¹⁰²(103-digit number)
68373319730854803382…31114288866695300481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.367 × 10¹⁰³(104-digit number)
13674663946170960676…62228577733390600961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.734 × 10¹⁰³(104-digit number)
27349327892341921353…24457155466781201921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.469 × 10¹⁰³(104-digit number)
54698655784683842706…48914310933562403841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.093 × 10¹⁰⁴(105-digit number)
10939731156936768541…97828621867124807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.187 × 10¹⁰⁴(105-digit number)
21879462313873537082…95657243734249615361
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,725,509 XPM·at block #6,810,179 · 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