Block #320,932

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 11:59:50 PM · Difficulty 10.1851 · 6,488,917 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd176a4301be06382789633d60c9ac468e536db4f1190abee936470a79cd530d

Height

#320,932

Difficulty

10.185136

Transactions

18

Size

4.99 KB

Version

2

Bits

0a2f650c

Nonce

35,727

Timestamp

12/19/2013, 11:59:50 PM

Confirmations

6,488,917

Merkle Root

904333c22cbc7c33f0b1a2994085e2881122f4ab9e29be053978e2794f8647a2
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.

9.899 × 10¹⁰³(104-digit number)
98995449108843204089…28930609636641626881
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
9.899 × 10¹⁰³(104-digit number)
98995449108843204089…28930609636641626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.979 × 10¹⁰⁴(105-digit number)
19799089821768640817…57861219273283253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.959 × 10¹⁰⁴(105-digit number)
39598179643537281635…15722438546566507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.919 × 10¹⁰⁴(105-digit number)
79196359287074563271…31444877093133015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.583 × 10¹⁰⁵(106-digit number)
15839271857414912654…62889754186266030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.167 × 10¹⁰⁵(106-digit number)
31678543714829825308…25779508372532060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.335 × 10¹⁰⁵(106-digit number)
63357087429659650617…51559016745064120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.267 × 10¹⁰⁶(107-digit number)
12671417485931930123…03118033490128240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.534 × 10¹⁰⁶(107-digit number)
25342834971863860246…06236066980256481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.068 × 10¹⁰⁶(107-digit number)
50685669943727720493…12472133960512962561
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,722,880 XPM·at block #6,809,848 · 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