Block #373,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2014, 10:44:22 AM · Difficulty 10.4246 · 6,439,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
27d5fd994b26bc290770e35909c1cbd71681be20122b4341f87b58c38865a819

Height

#373,614

Difficulty

10.424640

Transactions

17

Size

3.99 KB

Version

2

Bits

0a6cb537

Nonce

10,583

Timestamp

1/24/2014, 10:44:22 AM

Confirmations

6,439,077

Merkle Root

c9791bf0029998e1c589a36c6520f5d9e5347c682f3a5e6353c3d93398560dc4
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.826 × 10⁹⁸(99-digit number)
18260310651706751925…92749754418988249601
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.826 × 10⁹⁸(99-digit number)
18260310651706751925…92749754418988249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.652 × 10⁹⁸(99-digit number)
36520621303413503850…85499508837976499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.304 × 10⁹⁸(99-digit number)
73041242606827007700…70999017675952998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.460 × 10⁹⁹(100-digit number)
14608248521365401540…41998035351905996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.921 × 10⁹⁹(100-digit number)
29216497042730803080…83996070703811993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.843 × 10⁹⁹(100-digit number)
58432994085461606160…67992141407623987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.168 × 10¹⁰⁰(101-digit number)
11686598817092321232…35984282815247974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.337 × 10¹⁰⁰(101-digit number)
23373197634184642464…71968565630495948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.674 × 10¹⁰⁰(101-digit number)
46746395268369284928…43937131260991897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.349 × 10¹⁰⁰(101-digit number)
93492790536738569856…87874262521983795201
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,745,563 XPM·at block #6,812,690 · 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