Block #661,122

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/3/2014, 7:02:36 PM · Difficulty 10.9563 · 6,149,460 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
31ba70ba14a8838b19a664900f617fa46252bc72ed0317102696cf73382d0e25

Height

#661,122

Difficulty

10.956295

Transactions

3

Size

660 B

Version

2

Bits

0af4cfbf

Nonce

44,760,275

Timestamp

8/3/2014, 7:02:36 PM

Confirmations

6,149,460

Merkle Root

cad8aa985d1f9fabcf6d8fba2db796c18fb58013344d52fefe688b31a327e352
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.058 × 10⁹⁹(100-digit number)
40582262506687863916…37424620913320115201
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.058 × 10⁹⁹(100-digit number)
40582262506687863916…37424620913320115201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.116 × 10⁹⁹(100-digit number)
81164525013375727832…74849241826640230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.623 × 10¹⁰⁰(101-digit number)
16232905002675145566…49698483653280460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.246 × 10¹⁰⁰(101-digit number)
32465810005350291133…99396967306560921601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.493 × 10¹⁰⁰(101-digit number)
64931620010700582266…98793934613121843201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.298 × 10¹⁰¹(102-digit number)
12986324002140116453…97587869226243686401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.597 × 10¹⁰¹(102-digit number)
25972648004280232906…95175738452487372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.194 × 10¹⁰¹(102-digit number)
51945296008560465812…90351476904974745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.038 × 10¹⁰²(103-digit number)
10389059201712093162…80702953809949491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.077 × 10¹⁰²(103-digit number)
20778118403424186325…61405907619898982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.155 × 10¹⁰²(103-digit number)
41556236806848372650…22811815239797964801
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,728,748 XPM·at block #6,810,581 · 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.

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