Block #320,542

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 5:23:56 PM · Difficulty 10.1854 · 6,487,494 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e235af4e516b9332df1362d98fc7ce169de27db3fe5e3246c09baa6a8007b53a

Height

#320,542

Difficulty

10.185363

Transactions

6

Size

2.55 KB

Version

2

Bits

0a2f73f4

Nonce

210,383

Timestamp

12/19/2013, 5:23:56 PM

Confirmations

6,487,494

Merkle Root

0f853ac079f27d1d7141e6c1c61207a68836a3ca47a6e6fb2c73a68e99c3a2e3
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.

2.147 × 10⁹⁶(97-digit number)
21471039765047052456…00566898288198025601
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
2.147 × 10⁹⁶(97-digit number)
21471039765047052456…00566898288198025601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.294 × 10⁹⁶(97-digit number)
42942079530094104913…01133796576396051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.588 × 10⁹⁶(97-digit number)
85884159060188209826…02267593152792102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.717 × 10⁹⁷(98-digit number)
17176831812037641965…04535186305584204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.435 × 10⁹⁷(98-digit number)
34353663624075283930…09070372611168409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.870 × 10⁹⁷(98-digit number)
68707327248150567860…18140745222336819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.374 × 10⁹⁸(99-digit number)
13741465449630113572…36281490444673638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.748 × 10⁹⁸(99-digit number)
27482930899260227144…72562980889347276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.496 × 10⁹⁸(99-digit number)
54965861798520454288…45125961778694553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.099 × 10⁹⁹(100-digit number)
10993172359704090857…90251923557389107201
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,708,333 XPM·at block #6,808,035 · 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