Block #320,768

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 9:14:28 PM · Difficulty 10.1851 · 6,496,443 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82bbcc9d56c02c00b4c11815af2298c67030a4d9d191c1a5f821cdb17236e8cd

Height

#320,768

Difficulty

10.185078

Transactions

11

Size

2.95 KB

Version

2

Bits

0a2f6140

Nonce

1,103

Timestamp

12/19/2013, 9:14:28 PM

Confirmations

6,496,443

Merkle Root

061cc55e595baf2e2694e4861ccad6e574a30a5c6e6f5b2676195a2b889cffe7
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.809 × 10¹⁰¹(102-digit number)
18098362680399111050…18895745883180588781
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.809 × 10¹⁰¹(102-digit number)
18098362680399111050…18895745883180588781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.619 × 10¹⁰¹(102-digit number)
36196725360798222100…37791491766361177561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.239 × 10¹⁰¹(102-digit number)
72393450721596444201…75582983532722355121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.447 × 10¹⁰²(103-digit number)
14478690144319288840…51165967065444710241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.895 × 10¹⁰²(103-digit number)
28957380288638577680…02331934130889420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.791 × 10¹⁰²(103-digit number)
57914760577277155361…04663868261778840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.158 × 10¹⁰³(104-digit number)
11582952115455431072…09327736523557681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.316 × 10¹⁰³(104-digit number)
23165904230910862144…18655473047115363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.633 × 10¹⁰³(104-digit number)
46331808461821724289…37310946094230727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.266 × 10¹⁰³(104-digit number)
92663616923643448578…74621892188461455361
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,781,727 XPM·at block #6,817,210 · 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