Block #858,479

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 3:53:39 PM · Difficulty 10.9667 · 5,984,914 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50e6e91034ff7d5a8063f9d213c254185431f9e66f1e8f75ac4372145452ded3

Height

#858,479

Difficulty

10.966691

Transactions

11

Size

2.40 KB

Version

2

Bits

0af7790b

Nonce

930,719,279

Timestamp

12/18/2014, 3:53:39 PM

Confirmations

5,984,914

Merkle Root

9adfc7f3f4e5f452e82eb73d36dec38f3296f3302164580957780555bade7387
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.

3.042 × 10⁹⁴(95-digit number)
30429004476497817855…84746791218813377841
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
3.042 × 10⁹⁴(95-digit number)
30429004476497817855…84746791218813377841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.085 × 10⁹⁴(95-digit number)
60858008952995635711…69493582437626755681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.217 × 10⁹⁵(96-digit number)
12171601790599127142…38987164875253511361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.434 × 10⁹⁵(96-digit number)
24343203581198254284…77974329750507022721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.868 × 10⁹⁵(96-digit number)
48686407162396508569…55948659501014045441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.737 × 10⁹⁵(96-digit number)
97372814324793017138…11897319002028090881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.947 × 10⁹⁶(97-digit number)
19474562864958603427…23794638004056181761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.894 × 10⁹⁶(97-digit number)
38949125729917206855…47589276008112363521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.789 × 10⁹⁶(97-digit number)
77898251459834413710…95178552016224727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.557 × 10⁹⁷(98-digit number)
15579650291966882742…90357104032449454081
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,991,508 XPM·at block #6,843,392 · 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