Block #322,413

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 11:56:49 PM · Difficulty 10.1931 · 6,504,788 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3827c1840162af45dd3119bdfb89bdc55b10f7cc0ed0decaeffff1c2dc1a387

Height

#322,413

Difficulty

10.193092

Transactions

5

Size

1.80 KB

Version

2

Bits

0a316e81

Nonce

1,633,561

Timestamp

12/20/2013, 11:56:49 PM

Confirmations

6,504,788

Merkle Root

6c6d32073713f61c32ba2beccc7ebef27129c7258cd59c86eac6157a5e77eaf8
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.

5.588 × 10⁹⁷(98-digit number)
55880862402821360277…43883561815460191451
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
5.588 × 10⁹⁷(98-digit number)
55880862402821360277…43883561815460191451
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.117 × 10⁹⁸(99-digit number)
11176172480564272055…87767123630920382901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.235 × 10⁹⁸(99-digit number)
22352344961128544110…75534247261840765801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.470 × 10⁹⁸(99-digit number)
44704689922257088221…51068494523681531601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.940 × 10⁹⁸(99-digit number)
89409379844514176443…02136989047363063201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.788 × 10⁹⁹(100-digit number)
17881875968902835288…04273978094726126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.576 × 10⁹⁹(100-digit number)
35763751937805670577…08547956189452252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.152 × 10⁹⁹(100-digit number)
71527503875611341154…17095912378904505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.430 × 10¹⁰⁰(101-digit number)
14305500775122268230…34191824757809011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.861 × 10¹⁰⁰(101-digit number)
28611001550244536461…68383649515618022401
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,861,705 XPM·at block #6,827,200 · 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