Block #328,049

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2013, 12:03:23 AM · Difficulty 10.1727 · 6,482,165 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
83afa179e729b01dfe0b399ede7beea0bb8b19b3581203f0baea2e0e217a450d

Height

#328,049

Difficulty

10.172691

Transactions

1

Size

1.01 KB

Version

2

Bits

0a2c357e

Nonce

10,757

Timestamp

12/25/2013, 12:03:23 AM

Confirmations

6,482,165

Merkle Root

b382d45b1c1ca1ff4b5a38bf19aeb9e0a04768bda11816c6bb555a487cd15330
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.

8.188 × 10⁹⁵(96-digit number)
81880572557653305479…19860849310781460481
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
8.188 × 10⁹⁵(96-digit number)
81880572557653305479…19860849310781460481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.637 × 10⁹⁶(97-digit number)
16376114511530661095…39721698621562920961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.275 × 10⁹⁶(97-digit number)
32752229023061322191…79443397243125841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.550 × 10⁹⁶(97-digit number)
65504458046122644383…58886794486251683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.310 × 10⁹⁷(98-digit number)
13100891609224528876…17773588972503367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.620 × 10⁹⁷(98-digit number)
26201783218449057753…35547177945006735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.240 × 10⁹⁷(98-digit number)
52403566436898115507…71094355890013470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.048 × 10⁹⁸(99-digit number)
10480713287379623101…42188711780026941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.096 × 10⁹⁸(99-digit number)
20961426574759246202…84377423560053882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.192 × 10⁹⁸(99-digit number)
41922853149518492405…68754847120107765761
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,725,786 XPM·at block #6,810,213 · 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