Block #964,394

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2015, 12:22:54 AM · Difficulty 10.8763 · 5,862,444 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c18ee9f07fd43829715db2d3347d472903132d7b0f9b73e97b3d90c69237b247

Height

#964,394

Difficulty

10.876274

Transactions

6

Size

1.45 KB

Version

2

Bits

0ae0537b

Nonce

569,750,527

Timestamp

3/7/2015, 12:22:54 AM

Confirmations

5,862,444

Merkle Root

c5aaded813650fc31c752656171cf9a8b663981b4076764c9b431b9fb81e7dcd
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.111 × 10⁹⁴(95-digit number)
71113861623229673434…29352116554808764321
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.111 × 10⁹⁴(95-digit number)
71113861623229673434…29352116554808764321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.422 × 10⁹⁵(96-digit number)
14222772324645934686…58704233109617528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.844 × 10⁹⁵(96-digit number)
28445544649291869373…17408466219235057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.689 × 10⁹⁵(96-digit number)
56891089298583738747…34816932438470114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.137 × 10⁹⁶(97-digit number)
11378217859716747749…69633864876940229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.275 × 10⁹⁶(97-digit number)
22756435719433495499…39267729753880458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.551 × 10⁹⁶(97-digit number)
45512871438866990998…78535459507760916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.102 × 10⁹⁶(97-digit number)
91025742877733981996…57070919015521832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.820 × 10⁹⁷(98-digit number)
18205148575546796399…14141838031043665921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.641 × 10⁹⁷(98-digit number)
36410297151093592798…28283676062087331841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.282 × 10⁹⁷(98-digit number)
72820594302187185596…56567352124174663681
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,858,871 XPM·at block #6,826,837 · 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