Block #327,412

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/24/2013, 12:59:02 PM · Difficulty 10.1769 · 6,482,921 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
671619f8fed3ed96849ccd1b9b4537054ce979d5108ed1baee5c65362e2cf0a1

Height

#327,412

Difficulty

10.176852

Transactions

16

Size

5.56 KB

Version

2

Bits

0a2d462c

Nonce

52,945

Timestamp

12/24/2013, 12:59:02 PM

Confirmations

6,482,921

Merkle Root

82db655a4fcddd5b7afb06c0eb2ea81f32750e0dcba91b0464186deb0eebbc67
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.

3.993 × 10⁹⁶(97-digit number)
39934273278660260791…09927265746244039681
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
3.993 × 10⁹⁶(97-digit number)
39934273278660260791…09927265746244039681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.986 × 10⁹⁶(97-digit number)
79868546557320521583…19854531492488079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.597 × 10⁹⁷(98-digit number)
15973709311464104316…39709062984976158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.194 × 10⁹⁷(98-digit number)
31947418622928208633…79418125969952317441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.389 × 10⁹⁷(98-digit number)
63894837245856417266…58836251939904634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.277 × 10⁹⁸(99-digit number)
12778967449171283453…17672503879809269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.555 × 10⁹⁸(99-digit number)
25557934898342566906…35345007759618539521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.111 × 10⁹⁸(99-digit number)
51115869796685133813…70690015519237079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.022 × 10⁹⁹(100-digit number)
10223173959337026762…41380031038474158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.044 × 10⁹⁹(100-digit number)
20446347918674053525…82760062076948316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.089 × 10⁹⁹(100-digit number)
40892695837348107050…65520124153896632321
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,726,744 XPM·at block #6,810,332 · 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