Block #655,941

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/31/2014, 4:43:08 AM · Difficulty 10.9561 · 6,160,922 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e45a9fe3ecc0f8bb25f28e05302060d06b928c95f7188a3041f0103ad820570

Height

#655,941

Difficulty

10.956139

Transactions

4

Size

884 B

Version

2

Bits

0af4c58d

Nonce

26,959,963

Timestamp

7/31/2014, 4:43:08 AM

Confirmations

6,160,922

Merkle Root

786103983e1904a4cfa13b546235906e9029ad3fff6ab0b96cb39d6616b08c49
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.166 × 10⁹⁵(96-digit number)
41668315815874823349…80152339140673050399
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.166 × 10⁹⁵(96-digit number)
41668315815874823349…80152339140673050399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.333 × 10⁹⁵(96-digit number)
83336631631749646698…60304678281346100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.666 × 10⁹⁶(97-digit number)
16667326326349929339…20609356562692201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.333 × 10⁹⁶(97-digit number)
33334652652699858679…41218713125384403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.666 × 10⁹⁶(97-digit number)
66669305305399717358…82437426250768806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.333 × 10⁹⁷(98-digit number)
13333861061079943471…64874852501537612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.666 × 10⁹⁷(98-digit number)
26667722122159886943…29749705003075225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.333 × 10⁹⁷(98-digit number)
53335444244319773887…59499410006150451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.066 × 10⁹⁸(99-digit number)
10667088848863954777…18998820012300902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.133 × 10⁹⁸(99-digit number)
21334177697727909554…37997640024601804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.266 × 10⁹⁸(99-digit number)
42668355395455819109…75995280049203609599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,778,948 XPM·at block #6,816,862 · 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