Block #1,503,037

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2016, 3:07:42 AM · Difficulty 10.6484 · 5,312,073 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
657a4a788a61d302c00af5ba1cb37213c260e2d8148c436e252d8ef85d1968eb

Height

#1,503,037

Difficulty

10.648401

Transactions

2

Size

1.11 KB

Version

2

Bits

0aa5fd96

Nonce

967,485,985

Timestamp

3/19/2016, 3:07:42 AM

Confirmations

5,312,073

Merkle Root

d59941f5cb16a6a77b59709e6c1292e41acba1629e31e4bd4255a660d98ca695
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.954 × 10⁹⁵(96-digit number)
49543352558681187688…59974369891688780639
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.954 × 10⁹⁵(96-digit number)
49543352558681187688…59974369891688780639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.908 × 10⁹⁵(96-digit number)
99086705117362375376…19948739783377561279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.981 × 10⁹⁶(97-digit number)
19817341023472475075…39897479566755122559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.963 × 10⁹⁶(97-digit number)
39634682046944950150…79794959133510245119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.926 × 10⁹⁶(97-digit number)
79269364093889900301…59589918267020490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.585 × 10⁹⁷(98-digit number)
15853872818777980060…19179836534040980479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.170 × 10⁹⁷(98-digit number)
31707745637555960120…38359673068081960959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.341 × 10⁹⁷(98-digit number)
63415491275111920241…76719346136163921919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.268 × 10⁹⁸(99-digit number)
12683098255022384048…53438692272327843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.536 × 10⁹⁸(99-digit number)
25366196510044768096…06877384544655687679
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,764,971 XPM·at block #6,815,109 · 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