Block #329,321

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2013, 9:34:58 PM · Difficulty 10.1699 · 6,477,048 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9a7cc6ddd0e69a0b03af2bcdd2337481b3ac75e5324745d2f3ce1f5fdc86023

Height

#329,321

Difficulty

10.169892

Transactions

24

Size

6.28 KB

Version

2

Bits

0a2b7e0f

Nonce

295,846

Timestamp

12/25/2013, 9:34:58 PM

Confirmations

6,477,048

Merkle Root

e185c61ced0192ac7811f4b4eb867aca3c3cddbc89c22add13d180e4aa817c5b
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.213 × 10⁹⁷(98-digit number)
12136445554547862409…88254183375749360101
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.213 × 10⁹⁷(98-digit number)
12136445554547862409…88254183375749360101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.427 × 10⁹⁷(98-digit number)
24272891109095724818…76508366751498720201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.854 × 10⁹⁷(98-digit number)
48545782218191449637…53016733502997440401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.709 × 10⁹⁷(98-digit number)
97091564436382899274…06033467005994880801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.941 × 10⁹⁸(99-digit number)
19418312887276579854…12066934011989761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.883 × 10⁹⁸(99-digit number)
38836625774553159709…24133868023979523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.767 × 10⁹⁸(99-digit number)
77673251549106319419…48267736047959046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.553 × 10⁹⁹(100-digit number)
15534650309821263883…96535472095918092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.106 × 10⁹⁹(100-digit number)
31069300619642527767…93070944191836185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.213 × 10⁹⁹(100-digit number)
62138601239285055535…86141888383672371201
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,695,040 XPM·at block #6,806,368 · 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