Block #320,440

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 3:58:38 PM · Difficulty 10.1830 · 6,493,860 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
045784f51ca599c42438b594992bf9242ccc7ceb785d59dec9a7dc7c04ba7ef5

Height

#320,440

Difficulty

10.182955

Transactions

1

Size

901 B

Version

2

Bits

0a2ed61d

Nonce

315,537

Timestamp

12/19/2013, 3:58:38 PM

Confirmations

6,493,860

Merkle Root

b5e3f502bbfc08bf0c0d921d1b1c69ef78af9a702ff5a44425eafbe4a301eb7a
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.251 × 10⁹⁴(95-digit number)
12516770527466834214…92475579330203437441
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.251 × 10⁹⁴(95-digit number)
12516770527466834214…92475579330203437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.503 × 10⁹⁴(95-digit number)
25033541054933668429…84951158660406874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.006 × 10⁹⁴(95-digit number)
50067082109867336859…69902317320813749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.001 × 10⁹⁵(96-digit number)
10013416421973467371…39804634641627499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.002 × 10⁹⁵(96-digit number)
20026832843946934743…79609269283254999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.005 × 10⁹⁵(96-digit number)
40053665687893869487…59218538566509998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.010 × 10⁹⁵(96-digit number)
80107331375787738975…18437077133019996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.602 × 10⁹⁶(97-digit number)
16021466275157547795…36874154266039992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.204 × 10⁹⁶(97-digit number)
32042932550315095590…73748308532079984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.408 × 10⁹⁶(97-digit number)
64085865100630191180…47496617064159969281
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,758,464 XPM·at block #6,814,299 · 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