Block #352,399

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 7:45:28 AM · Difficulty 10.3072 · 6,473,005 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b9afa81ac532ab3b0718b719ee262612d8da46319c359f5df25936c0d8092558

Height

#352,399

Difficulty

10.307235

Transactions

8

Size

2.42 KB

Version

2

Bits

0a4ea6f9

Nonce

1,434

Timestamp

1/10/2014, 7:45:28 AM

Confirmations

6,473,005

Merkle Root

3386764cead42d26367c22040f4b2af662e510ff2d3641f267c9abdbb919f069
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.

5.452 × 10⁹⁴(95-digit number)
54528008822334490604…47442238696581181121
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
5.452 × 10⁹⁴(95-digit number)
54528008822334490604…47442238696581181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.090 × 10⁹⁵(96-digit number)
10905601764466898120…94884477393162362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.181 × 10⁹⁵(96-digit number)
21811203528933796241…89768954786324724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.362 × 10⁹⁵(96-digit number)
43622407057867592483…79537909572649448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.724 × 10⁹⁵(96-digit number)
87244814115735184967…59075819145298897921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.744 × 10⁹⁶(97-digit number)
17448962823147036993…18151638290597795841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.489 × 10⁹⁶(97-digit number)
34897925646294073986…36303276581195591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.979 × 10⁹⁶(97-digit number)
69795851292588147973…72606553162391183361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.395 × 10⁹⁷(98-digit number)
13959170258517629594…45213106324782366721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.791 × 10⁹⁷(98-digit number)
27918340517035259189…90426212649564733441
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,847,331 XPM·at block #6,825,403 · 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