Block #1,403,075

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2016, 2:22:02 PM · Difficulty 10.8050 · 5,441,432 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a9bbb955d95e2ac104e1e11120d155ad7e56b5cd322968727cc022fa18b22b14

Height

#1,403,075

Difficulty

10.804968

Transactions

2

Size

1.72 KB

Version

2

Bits

0ace125e

Nonce

883,010,160

Timestamp

1/7/2016, 2:22:02 PM

Confirmations

5,441,432

Merkle Root

4c3f575121a660589df6b8e44f683eb1b64b79358a7359802c9e116ed450dd9f
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.124 × 10⁹⁶(97-digit number)
11244386297711921867…67154555126725043199
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.124 × 10⁹⁶(97-digit number)
11244386297711921867…67154555126725043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.248 × 10⁹⁶(97-digit number)
22488772595423843734…34309110253450086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.497 × 10⁹⁶(97-digit number)
44977545190847687468…68618220506900172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.995 × 10⁹⁶(97-digit number)
89955090381695374936…37236441013800345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.799 × 10⁹⁷(98-digit number)
17991018076339074987…74472882027600691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.598 × 10⁹⁷(98-digit number)
35982036152678149974…48945764055201382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.196 × 10⁹⁷(98-digit number)
71964072305356299949…97891528110402764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.439 × 10⁹⁸(99-digit number)
14392814461071259989…95783056220805529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.878 × 10⁹⁸(99-digit number)
28785628922142519979…91566112441611059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.757 × 10⁹⁸(99-digit number)
57571257844285039959…83132224883222118399
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:58,000,454 XPM·at block #6,844,506 · 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