Block #1,299,772

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/26/2015, 9:07:59 AM · Difficulty 10.8693 · 5,542,414 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
976c47b7bdc54fde706610e8f18833d52b43c6280f979614f7fc7af291fc7b1a

Height

#1,299,772

Difficulty

10.869311

Transactions

2

Size

3.74 KB

Version

2

Bits

0ade8b29

Nonce

1,210,021,700

Timestamp

10/26/2015, 9:07:59 AM

Confirmations

5,542,414

Merkle Root

7885959c217a115478c507c685b88894904d85983ea0a4c5c17d0cdd4ce513d4
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.

3.278 × 10⁹⁵(96-digit number)
32789347238945271944…26099731969054456639
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
3.278 × 10⁹⁵(96-digit number)
32789347238945271944…26099731969054456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.557 × 10⁹⁵(96-digit number)
65578694477890543888…52199463938108913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.311 × 10⁹⁶(97-digit number)
13115738895578108777…04398927876217826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.623 × 10⁹⁶(97-digit number)
26231477791156217555…08797855752435653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.246 × 10⁹⁶(97-digit number)
52462955582312435110…17595711504871306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.049 × 10⁹⁷(98-digit number)
10492591116462487022…35191423009742612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.098 × 10⁹⁷(98-digit number)
20985182232924974044…70382846019485224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.197 × 10⁹⁷(98-digit number)
41970364465849948088…40765692038970449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.394 × 10⁹⁷(98-digit number)
83940728931699896176…81531384077940899839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.678 × 10⁹⁸(99-digit number)
16788145786339979235…63062768155881799679
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,981,880 XPM·at block #6,842,185 · 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