Block #326,135

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2013, 1:58:20 PM · Difficulty 10.1934 · 6,490,971 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8623be42b0fd37d1ea5edb4bb4ae39b684a0b8ebaa6863f6dd4dad9997ca9800

Height

#326,135

Difficulty

10.193437

Transactions

5

Size

1.08 KB

Version

2

Bits

0a318516

Nonce

41,593

Timestamp

12/23/2013, 1:58:20 PM

Confirmations

6,490,971

Merkle Root

6c034a5111bc04ceeee0bfaea79e9112359222ff3ffb078e0b3ddb06bf431e0b
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.564 × 10⁹⁹(100-digit number)
15647696156650260594…79563586695496610721
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.564 × 10⁹⁹(100-digit number)
15647696156650260594…79563586695496610721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.129 × 10⁹⁹(100-digit number)
31295392313300521188…59127173390993221441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.259 × 10⁹⁹(100-digit number)
62590784626601042376…18254346781986442881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.251 × 10¹⁰⁰(101-digit number)
12518156925320208475…36508693563972885761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.503 × 10¹⁰⁰(101-digit number)
25036313850640416950…73017387127945771521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.007 × 10¹⁰⁰(101-digit number)
50072627701280833901…46034774255891543041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.001 × 10¹⁰¹(102-digit number)
10014525540256166780…92069548511783086081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.002 × 10¹⁰¹(102-digit number)
20029051080512333560…84139097023566172161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.005 × 10¹⁰¹(102-digit number)
40058102161024667121…68278194047132344321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.011 × 10¹⁰¹(102-digit number)
80116204322049334242…36556388094264688641
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,780,887 XPM·at block #6,817,105 · 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