Block #325,302

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/22/2013, 10:38:27 PM · Difficulty 10.2070 · 6,489,816 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0e30ce10b2d4eb7e13c854a14e0e6225dd9491a98cd7233e8984973b9088663

Height

#325,302

Difficulty

10.207020

Transactions

1

Size

1.05 KB

Version

2

Bits

0a34ff46

Nonce

7,092

Timestamp

12/22/2013, 10:38:27 PM

Confirmations

6,489,816

Merkle Root

b524cf2700af254d74fb48d0985189c74ccae20b64fdc6c63ebfcd2905f8e314
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.106 × 10⁹⁹(100-digit number)
21066534904366824769…37472421154991745761
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.106 × 10⁹⁹(100-digit number)
21066534904366824769…37472421154991745761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.213 × 10⁹⁹(100-digit number)
42133069808733649538…74944842309983491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.426 × 10⁹⁹(100-digit number)
84266139617467299076…49889684619966983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.685 × 10¹⁰⁰(101-digit number)
16853227923493459815…99779369239933966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.370 × 10¹⁰⁰(101-digit number)
33706455846986919630…99558738479867932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.741 × 10¹⁰⁰(101-digit number)
67412911693973839261…99117476959735864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.348 × 10¹⁰¹(102-digit number)
13482582338794767852…98234953919471728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.696 × 10¹⁰¹(102-digit number)
26965164677589535704…96469907838943457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.393 × 10¹⁰¹(102-digit number)
53930329355179071408…92939815677886914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.078 × 10¹⁰²(103-digit number)
10786065871035814281…85879631355773829121
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,765,036 XPM·at block #6,815,117 · 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