Block #668,504

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/8/2014, 7:18:44 AM · Difficulty 10.9636 · 6,163,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9e4256ff832f4aabdb0e1cc2bd5855cfbb86cd63c8cf61157936e33d0cea451b

Height

#668,504

Difficulty

10.963559

Transactions

10

Size

3.49 KB

Version

2

Bits

0af6abce

Nonce

105,709,886

Timestamp

8/8/2014, 7:18:44 AM

Confirmations

6,163,083

Merkle Root

13a7b1cc589e70b3cd187d974f2754d42cddad3a997568663e6e05d585fdcfb3
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.

5.359 × 10⁹⁵(96-digit number)
53599950939989663751…41911863740448423999
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
5.359 × 10⁹⁵(96-digit number)
53599950939989663751…41911863740448423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.071 × 10⁹⁶(97-digit number)
10719990187997932750…83823727480896847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.143 × 10⁹⁶(97-digit number)
21439980375995865500…67647454961793695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.287 × 10⁹⁶(97-digit number)
42879960751991731001…35294909923587391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.575 × 10⁹⁶(97-digit number)
85759921503983462002…70589819847174783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.715 × 10⁹⁷(98-digit number)
17151984300796692400…41179639694349567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.430 × 10⁹⁷(98-digit number)
34303968601593384800…82359279388699135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.860 × 10⁹⁷(98-digit number)
68607937203186769601…64718558777398271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.372 × 10⁹⁸(99-digit number)
13721587440637353920…29437117554796543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.744 × 10⁹⁸(99-digit number)
27443174881274707840…58874235109593087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.488 × 10⁹⁸(99-digit number)
54886349762549415681…17748470219186175999
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,896,792 XPM·at block #6,831,586 · 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