Block #378,109

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/27/2014, 2:09:06 PM · Difficulty 10.4227 · 6,438,179 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
684c16a8fd7b2ce97b1f79fc21e4e3df8873426e68636c19bfe2b3a08ae0443c

Height

#378,109

Difficulty

10.422715

Transactions

4

Size

1.00 KB

Version

2

Bits

0a6c370f

Nonce

215,757

Timestamp

1/27/2014, 2:09:06 PM

Confirmations

6,438,179

Merkle Root

e574930fb4699adb4c3fee7db077819560cbd76a2cec6544c5efa4fb654bd12a
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.540 × 10⁹⁵(96-digit number)
15408455151591464925…61960115928334310401
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.540 × 10⁹⁵(96-digit number)
15408455151591464925…61960115928334310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.081 × 10⁹⁵(96-digit number)
30816910303182929850…23920231856668620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.163 × 10⁹⁵(96-digit number)
61633820606365859701…47840463713337241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.232 × 10⁹⁶(97-digit number)
12326764121273171940…95680927426674483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.465 × 10⁹⁶(97-digit number)
24653528242546343880…91361854853348966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.930 × 10⁹⁶(97-digit number)
49307056485092687760…82723709706697932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.861 × 10⁹⁶(97-digit number)
98614112970185375521…65447419413395865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.972 × 10⁹⁷(98-digit number)
19722822594037075104…30894838826791731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.944 × 10⁹⁷(98-digit number)
39445645188074150208…61789677653583462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.889 × 10⁹⁷(98-digit number)
78891290376148300417…23579355307166924801
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,774,421 XPM·at block #6,816,287 · 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