Block #2,256,842

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/18/2017, 5:56:24 AM · Difficulty 10.9515 · 4,583,954 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b73550ca4adc050b41aba649d50f75292592514a0bdbf92dc2755a2e31754069

Height

#2,256,842

Difficulty

10.951539

Transactions

66

Size

18.89 KB

Version

2

Bits

0af3980b

Nonce

75,682,677

Timestamp

8/18/2017, 5:56:24 AM

Confirmations

4,583,954

Merkle Root

50bbd55102083436a1abcf7cc02281010985457e221b22bafb536d0389f36181
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.

1.116 × 10⁹⁶(97-digit number)
11168598895337950343…72883092971386053121
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
1.116 × 10⁹⁶(97-digit number)
11168598895337950343…72883092971386053121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.233 × 10⁹⁶(97-digit number)
22337197790675900686…45766185942772106241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.467 × 10⁹⁶(97-digit number)
44674395581351801373…91532371885544212481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.934 × 10⁹⁶(97-digit number)
89348791162703602746…83064743771088424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.786 × 10⁹⁷(98-digit number)
17869758232540720549…66129487542176849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.573 × 10⁹⁷(98-digit number)
35739516465081441098…32258975084353699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.147 × 10⁹⁷(98-digit number)
71479032930162882196…64517950168707399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.429 × 10⁹⁸(99-digit number)
14295806586032576439…29035900337414799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.859 × 10⁹⁸(99-digit number)
28591613172065152878…58071800674829598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.718 × 10⁹⁸(99-digit number)
57183226344130305757…16143601349659197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.143 × 10⁹⁹(100-digit number)
11436645268826061151…32287202699318394881
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,970,715 XPM·at block #6,840,795 · 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