Block #361,252

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2014, 10:47:58 PM · Difficulty 10.4059 · 6,463,246 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6b2c3d1f52ff08f97c71952e5da2ea20a16e93ac7ac4f67e28a75c52c7e1980b

Height

#361,252

Difficulty

10.405852

Transactions

11

Size

2.95 KB

Version

2

Bits

0a67e5e3

Nonce

28,747

Timestamp

1/15/2014, 10:47:58 PM

Confirmations

6,463,246

Merkle Root

336b4e62023cf389792a00fe855168a6b92160786e28b1646e276ba5f0616444
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.

6.955 × 10⁹⁵(96-digit number)
69558113440100801006…62101730859409856001
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
6.955 × 10⁹⁵(96-digit number)
69558113440100801006…62101730859409856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.391 × 10⁹⁶(97-digit number)
13911622688020160201…24203461718819712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.782 × 10⁹⁶(97-digit number)
27823245376040320402…48406923437639424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.564 × 10⁹⁶(97-digit number)
55646490752080640805…96813846875278848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.112 × 10⁹⁷(98-digit number)
11129298150416128161…93627693750557696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.225 × 10⁹⁷(98-digit number)
22258596300832256322…87255387501115392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.451 × 10⁹⁷(98-digit number)
44517192601664512644…74510775002230784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.903 × 10⁹⁷(98-digit number)
89034385203329025288…49021550004461568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.780 × 10⁹⁸(99-digit number)
17806877040665805057…98043100008923136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.561 × 10⁹⁸(99-digit number)
35613754081331610115…96086200017846272001
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,840,057 XPM·at block #6,824,497 · 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