Block #373,864

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2014, 2:46:31 PM · Difficulty 10.4257 · 6,436,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27b8e276f500dd6066930c0dd680a21978016b95964a9fdc0d001533ed6e7bf9

Height

#373,864

Difficulty

10.425691

Transactions

4

Size

1.83 KB

Version

2

Bits

0a6cfa13

Nonce

173,944

Timestamp

1/24/2014, 2:46:31 PM

Confirmations

6,436,077

Merkle Root

13bffd7804ed83cb28c02e813fa38d15a09e69c573aa9e53ec81511b26a335c4
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.553 × 10⁹⁸(99-digit number)
65531128615218480056…96632350588125658241
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.553 × 10⁹⁸(99-digit number)
65531128615218480056…96632350588125658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.310 × 10⁹⁹(100-digit number)
13106225723043696011…93264701176251316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.621 × 10⁹⁹(100-digit number)
26212451446087392022…86529402352502632961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.242 × 10⁹⁹(100-digit number)
52424902892174784045…73058804705005265921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.048 × 10¹⁰⁰(101-digit number)
10484980578434956809…46117609410010531841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.096 × 10¹⁰⁰(101-digit number)
20969961156869913618…92235218820021063681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.193 × 10¹⁰⁰(101-digit number)
41939922313739827236…84470437640042127361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.387 × 10¹⁰⁰(101-digit number)
83879844627479654472…68940875280084254721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.677 × 10¹⁰¹(102-digit number)
16775968925495930894…37881750560168509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.355 × 10¹⁰¹(102-digit number)
33551937850991861789…75763501120337018881
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,723,616 XPM·at block #6,809,940 · 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.

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