Block #578,059

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/5/2014, 6:33:36 PM · Difficulty 10.9685 · 6,246,530 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b0f263efafdc167bf5c4781e906bb38ce7cc3e66fb83251b85ac518a7e8d34d

Height

#578,059

Difficulty

10.968477

Transactions

5

Size

5.28 KB

Version

2

Bits

0af7ee15

Nonce

514,105,329

Timestamp

6/5/2014, 6:33:36 PM

Confirmations

6,246,530

Merkle Root

3ee3d2faf8d78a5a2ee7c14a2a32a72bfb8a47129342ffa7b55ba6f425779b56
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.

7.589 × 10⁹⁷(98-digit number)
75896090487200234391…33409148875659249361
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
7.589 × 10⁹⁷(98-digit number)
75896090487200234391…33409148875659249361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.517 × 10⁹⁸(99-digit number)
15179218097440046878…66818297751318498721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.035 × 10⁹⁸(99-digit number)
30358436194880093756…33636595502636997441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.071 × 10⁹⁸(99-digit number)
60716872389760187513…67273191005273994881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.214 × 10⁹⁹(100-digit number)
12143374477952037502…34546382010547989761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.428 × 10⁹⁹(100-digit number)
24286748955904075005…69092764021095979521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.857 × 10⁹⁹(100-digit number)
48573497911808150010…38185528042191959041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.714 × 10⁹⁹(100-digit number)
97146995823616300021…76371056084383918081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.942 × 10¹⁰⁰(101-digit number)
19429399164723260004…52742112168767836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.885 × 10¹⁰⁰(101-digit number)
38858798329446520008…05484224337535672321
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,840,780 XPM·at block #6,824,588 · 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