Block #320,293

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 1:33:42 PM · Difficulty 10.1824 · 6,505,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f2297d5cd84717629db80c6b8c982d8314a96d6668cb5c26c02585edf8f4078a

Height

#320,293

Difficulty

10.182419

Transactions

9

Size

40.36 KB

Version

2

Bits

0a2eb304

Nonce

15,498

Timestamp

12/19/2013, 1:33:42 PM

Confirmations

6,505,345

Merkle Root

76c330177db37bf675bd8949ee9e3e2646444846b621de7f269cf95e7e49d4bd
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.126 × 10⁹⁶(97-digit number)
11269073859660366960…01071481707656004321
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.126 × 10⁹⁶(97-digit number)
11269073859660366960…01071481707656004321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.253 × 10⁹⁶(97-digit number)
22538147719320733920…02142963415312008641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.507 × 10⁹⁶(97-digit number)
45076295438641467840…04285926830624017281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.015 × 10⁹⁶(97-digit number)
90152590877282935681…08571853661248034561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.803 × 10⁹⁷(98-digit number)
18030518175456587136…17143707322496069121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.606 × 10⁹⁷(98-digit number)
36061036350913174272…34287414644992138241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.212 × 10⁹⁷(98-digit number)
72122072701826348545…68574829289984276481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.442 × 10⁹⁸(99-digit number)
14424414540365269709…37149658579968552961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.884 × 10⁹⁸(99-digit number)
28848829080730539418…74299317159937105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.769 × 10⁹⁸(99-digit number)
57697658161461078836…48598634319874211841
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,849,208 XPM·at block #6,825,637 · 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