Block #2,227,516

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/29/2017, 1:56:34 AM · Difficulty 10.9478 · 4,616,607 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
361a7c94c7d9fa7eff5826b2d99dd21fee15989e75f603f924685dd912e21ec4

Height

#2,227,516

Difficulty

10.947806

Transactions

2

Size

428 B

Version

2

Bits

0af2a365

Nonce

1,478,318,138

Timestamp

7/29/2017, 1:56:34 AM

Confirmations

4,616,607

Merkle Root

241fef88f8c3a5c729c8c7222092e4e9e0f16eb25a975b94845b17e760c286ed
Transactions (2)
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.608 × 10⁹⁶(97-digit number)
16080181574592330971…05028473147231912959
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.608 × 10⁹⁶(97-digit number)
16080181574592330971…05028473147231912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.216 × 10⁹⁶(97-digit number)
32160363149184661942…10056946294463825919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.432 × 10⁹⁶(97-digit number)
64320726298369323885…20113892588927651839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.286 × 10⁹⁷(98-digit number)
12864145259673864777…40227785177855303679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.572 × 10⁹⁷(98-digit number)
25728290519347729554…80455570355710607359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.145 × 10⁹⁷(98-digit number)
51456581038695459108…60911140711421214719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.029 × 10⁹⁸(99-digit number)
10291316207739091821…21822281422842429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.058 × 10⁹⁸(99-digit number)
20582632415478183643…43644562845684858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.116 × 10⁹⁸(99-digit number)
41165264830956367286…87289125691369717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.233 × 10⁹⁸(99-digit number)
82330529661912734573…74578251382739435519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.646 × 10⁹⁹(100-digit number)
16466105932382546914…49156502765478871039
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,997,356 XPM·at block #6,844,122 · 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