Block #372,387

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 1:48:31 PM · Difficulty 10.4277 · 6,442,098 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5bb13827ad50b8b544a2d87b5507290f95a2008754e908472fe33ab7c14ecfd0

Height

#372,387

Difficulty

10.427689

Transactions

4

Size

2.99 KB

Version

2

Bits

0a6d7d07

Nonce

75,706

Timestamp

1/23/2014, 1:48:31 PM

Confirmations

6,442,098

Merkle Root

741055d25ec7e8add958d9e8acc4110f31a61ee7ba261b6644f44a4def1edeca
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.344 × 10⁹⁹(100-digit number)
13442849680352818294…51878325610577048001
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.344 × 10⁹⁹(100-digit number)
13442849680352818294…51878325610577048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.688 × 10⁹⁹(100-digit number)
26885699360705636588…03756651221154096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.377 × 10⁹⁹(100-digit number)
53771398721411273176…07513302442308192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.075 × 10¹⁰⁰(101-digit number)
10754279744282254635…15026604884616384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.150 × 10¹⁰⁰(101-digit number)
21508559488564509270…30053209769232768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.301 × 10¹⁰⁰(101-digit number)
43017118977129018540…60106419538465536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.603 × 10¹⁰⁰(101-digit number)
86034237954258037081…20212839076931072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.720 × 10¹⁰¹(102-digit number)
17206847590851607416…40425678153862144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.441 × 10¹⁰¹(102-digit number)
34413695181703214832…80851356307724288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.882 × 10¹⁰¹(102-digit number)
68827390363406429665…61702712615448576001
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,759,948 XPM·at block #6,814,484 · 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