Block #857,947

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 5:29:08 AM · Difficulty 10.9673 · 5,986,883 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
053b014f0852b2d35807fa19ecad4ffe8a427eca0ff6cea252fd7c9cb868ca48

Height

#857,947

Difficulty

10.967268

Transactions

17

Size

3.24 KB

Version

2

Bits

0af79ee1

Nonce

844,796,257

Timestamp

12/18/2014, 5:29:08 AM

Confirmations

5,986,883

Merkle Root

2679e21f1e5377ab4b251359f30a0f9b34eef5d70b0ab8231d3eacf816c6d3b1
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.

4.558 × 10⁹⁶(97-digit number)
45581459560600833069…26334876558864250241
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
4.558 × 10⁹⁶(97-digit number)
45581459560600833069…26334876558864250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.116 × 10⁹⁶(97-digit number)
91162919121201666139…52669753117728500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.823 × 10⁹⁷(98-digit number)
18232583824240333227…05339506235457000961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.646 × 10⁹⁷(98-digit number)
36465167648480666455…10679012470914001921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.293 × 10⁹⁷(98-digit number)
72930335296961332911…21358024941828003841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.458 × 10⁹⁸(99-digit number)
14586067059392266582…42716049883656007681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.917 × 10⁹⁸(99-digit number)
29172134118784533164…85432099767312015361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.834 × 10⁹⁸(99-digit number)
58344268237569066329…70864199534624030721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.166 × 10⁹⁹(100-digit number)
11668853647513813265…41728399069248061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.333 × 10⁹⁹(100-digit number)
23337707295027626531…83456798138496122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.667 × 10⁹⁹(100-digit number)
46675414590055253063…66913596276992245761
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,003,049 XPM·at block #6,844,829 · 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