Block #856,215

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 10:13:26 PM · Difficulty 10.9681 · 5,961,746 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2dfdc05603bf729b788993c82833ccb40baf7041e5a7c886b1c330fd3d936e9f

Height

#856,215

Difficulty

10.968136

Transactions

11

Size

3.52 KB

Version

2

Bits

0af7d7ca

Nonce

375,356,302

Timestamp

12/16/2014, 10:13:26 PM

Confirmations

5,961,746

Merkle Root

5ab18a4cd4f3f32c4e7ab0ee35258ba67755543815e1501be3d9831927eb4b35
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.

9.790 × 10⁹³(94-digit number)
97908429725313303723…80769597378680147751
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
9.790 × 10⁹³(94-digit number)
97908429725313303723…80769597378680147751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.958 × 10⁹⁴(95-digit number)
19581685945062660744…61539194757360295501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.916 × 10⁹⁴(95-digit number)
39163371890125321489…23078389514720591001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.832 × 10⁹⁴(95-digit number)
78326743780250642978…46156779029441182001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.566 × 10⁹⁵(96-digit number)
15665348756050128595…92313558058882364001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.133 × 10⁹⁵(96-digit number)
31330697512100257191…84627116117764728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.266 × 10⁹⁵(96-digit number)
62661395024200514383…69254232235529456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.253 × 10⁹⁶(97-digit number)
12532279004840102876…38508464471058912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.506 × 10⁹⁶(97-digit number)
25064558009680205753…77016928942117824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.012 × 10⁹⁶(97-digit number)
50129116019360411506…54033857884235648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10025823203872082301…08067715768471296001
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:57,787,757 XPM·at block #6,817,960 · 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