Block #1,168,318

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/24/2015, 12:40:53 PM · Difficulty 10.9354 · 5,658,481 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d931d1f34dc132cd4cedf5eb97b07856c3406fb3fdfa1dfd1fd952466c08240d

Height

#1,168,318

Difficulty

10.935437

Transactions

3

Size

1.65 KB

Version

2

Bits

0aef78cb

Nonce

679,045,273

Timestamp

7/24/2015, 12:40:53 PM

Confirmations

5,658,481

Merkle Root

d69ee67f8173f1d75739fd23dae332304cefb0d05c88932643946b9955876a95
Transactions (3)
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.

2.309 × 10⁹⁵(96-digit number)
23096493231411206890…32975731282578479999
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
2.309 × 10⁹⁵(96-digit number)
23096493231411206890…32975731282578479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.619 × 10⁹⁵(96-digit number)
46192986462822413781…65951462565156959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.238 × 10⁹⁵(96-digit number)
92385972925644827562…31902925130313919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.847 × 10⁹⁶(97-digit number)
18477194585128965512…63805850260627839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.695 × 10⁹⁶(97-digit number)
36954389170257931024…27611700521255679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.390 × 10⁹⁶(97-digit number)
73908778340515862049…55223401042511359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.478 × 10⁹⁷(98-digit number)
14781755668103172409…10446802085022719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.956 × 10⁹⁷(98-digit number)
29563511336206344819…20893604170045439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.912 × 10⁹⁷(98-digit number)
59127022672412689639…41787208340090879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.182 × 10⁹⁸(99-digit number)
11825404534482537927…83574416680181759999
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,858,555 XPM·at block #6,826,798 · 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