Block #389,561

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 1:57:39 PM · Difficulty 10.4203 · 6,418,620 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0ca20fc8bcc94b8abeb2a5f62c9c3b8ecf895482ca064acb550dabbf63f62db3

Height

#389,561

Difficulty

10.420298

Transactions

3

Size

1.10 KB

Version

2

Bits

0a6b98a1

Nonce

88,332

Timestamp

2/4/2014, 1:57:39 PM

Confirmations

6,418,620

Merkle Root

466c0dfbb85baecba755d1ff95b601748074fb12f768b0d1551018bbdf6dd91f
Transactions (3)
1 in → 1 out9.2205 XPM116 B
6 in → 1 out55.4200 XPM728 B
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.

4.590 × 10¹⁰⁵(106-digit number)
45905077522668125047…07136808189080347681
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
4.590 × 10¹⁰⁵(106-digit number)
45905077522668125047…07136808189080347681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.181 × 10¹⁰⁵(106-digit number)
91810155045336250095…14273616378160695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.836 × 10¹⁰⁶(107-digit number)
18362031009067250019…28547232756321390721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.672 × 10¹⁰⁶(107-digit number)
36724062018134500038…57094465512642781441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.344 × 10¹⁰⁶(107-digit number)
73448124036269000076…14188931025285562881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.468 × 10¹⁰⁷(108-digit number)
14689624807253800015…28377862050571125761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.937 × 10¹⁰⁷(108-digit number)
29379249614507600030…56755724101142251521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.875 × 10¹⁰⁷(108-digit number)
58758499229015200061…13511448202284503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.175 × 10¹⁰⁸(109-digit number)
11751699845803040012…27022896404569006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.350 × 10¹⁰⁸(109-digit number)
23503399691606080024…54045792809138012161
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,709,497 XPM·at block #6,808,180 · 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