Block #384,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2014, 7:11:42 AM · Difficulty 10.4005 · 6,432,695 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
18beb88dd45e3e3cf3ee1d99d513f1dca76169ca3b4870404e563d36a56919c2

Height

#384,684

Difficulty

10.400455

Transactions

5

Size

1.01 KB

Version

2

Bits

0a668433

Nonce

41,200

Timestamp

2/1/2014, 7:11:42 AM

Confirmations

6,432,695

Merkle Root

7a8bbbaecd90ac9867c268b2aca2c2044ad00f1371af390bd0a66c9dd5cd0c85
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.

8.826 × 10⁹⁴(95-digit number)
88262277538570537394…65517703432731196381
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
8.826 × 10⁹⁴(95-digit number)
88262277538570537394…65517703432731196381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.765 × 10⁹⁵(96-digit number)
17652455507714107478…31035406865462392761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.530 × 10⁹⁵(96-digit number)
35304911015428214957…62070813730924785521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.060 × 10⁹⁵(96-digit number)
70609822030856429915…24141627461849571041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.412 × 10⁹⁶(97-digit number)
14121964406171285983…48283254923699142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.824 × 10⁹⁶(97-digit number)
28243928812342571966…96566509847398284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.648 × 10⁹⁶(97-digit number)
56487857624685143932…93133019694796568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.129 × 10⁹⁷(98-digit number)
11297571524937028786…86266039389593136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.259 × 10⁹⁷(98-digit number)
22595143049874057572…72532078779186273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.519 × 10⁹⁷(98-digit number)
45190286099748115145…45064157558372546561
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,783,073 XPM·at block #6,817,378 · 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