Block #380,496

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2014, 7:32:13 AM · Difficulty 10.4121 · 6,430,063 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c2e60d3b349d211bd95de6ff16729349feb03c8f9457b64e36e0070a45fd4c69

Height

#380,496

Difficulty

10.412066

Transactions

4

Size

1.44 KB

Version

2

Bits

0a697d2d

Nonce

265,246

Timestamp

1/29/2014, 7:32:13 AM

Confirmations

6,430,063

Merkle Root

a65d544a182135d6b9b51f2b4ab355dd3898e46f1fca4ac2bee8c5d7218b01b2
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.149 × 10⁸⁹(90-digit number)
11491542509996564774…63035716962987317211
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.149 × 10⁸⁹(90-digit number)
11491542509996564774…63035716962987317211
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.298 × 10⁸⁹(90-digit number)
22983085019993129548…26071433925974634421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.596 × 10⁸⁹(90-digit number)
45966170039986259097…52142867851949268841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.193 × 10⁸⁹(90-digit number)
91932340079972518195…04285735703898537681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.838 × 10⁹⁰(91-digit number)
18386468015994503639…08571471407797075361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.677 × 10⁹⁰(91-digit number)
36772936031989007278…17142942815594150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.354 × 10⁹⁰(91-digit number)
73545872063978014556…34285885631188301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.470 × 10⁹¹(92-digit number)
14709174412795602911…68571771262376602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.941 × 10⁹¹(92-digit number)
29418348825591205822…37143542524753205761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.883 × 10⁹¹(92-digit number)
58836697651182411645…74287085049506411521
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,728,562 XPM·at block #6,810,558 · 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