Block #352,808

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 2:01:29 PM · Difficulty 10.3123 · 6,474,303 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84c3e898b1a450be3ee40703b49620ef3397ad7f12a9607244687832995dd6b4

Height

#352,808

Difficulty

10.312300

Transactions

9

Size

2.34 KB

Version

2

Bits

0a4ff2e6

Nonce

68,719

Timestamp

1/10/2014, 2:01:29 PM

Confirmations

6,474,303

Merkle Root

ed1b024c9683652068d046531aacdfcdc57113897b107451135f3119f992b49e
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.703 × 10⁹⁸(99-digit number)
37031541561525782591…83106169688702128081
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.703 × 10⁹⁸(99-digit number)
37031541561525782591…83106169688702128081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.406 × 10⁹⁸(99-digit number)
74063083123051565183…66212339377404256161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.481 × 10⁹⁹(100-digit number)
14812616624610313036…32424678754808512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.962 × 10⁹⁹(100-digit number)
29625233249220626073…64849357509617024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.925 × 10⁹⁹(100-digit number)
59250466498441252146…29698715019234049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.185 × 10¹⁰⁰(101-digit number)
11850093299688250429…59397430038468098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.370 × 10¹⁰⁰(101-digit number)
23700186599376500858…18794860076936197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.740 × 10¹⁰⁰(101-digit number)
47400373198753001717…37589720153872394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.480 × 10¹⁰⁰(101-digit number)
94800746397506003434…75179440307744788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.896 × 10¹⁰¹(102-digit number)
18960149279501200686…50358880615489576961
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,861,067 XPM·at block #6,827,110 · 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