Block #985,736

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2015, 1:57:06 PM · Difficulty 10.8476 · 5,830,200 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d83f46a36411bcbdc9f4b5e05abd913322afb13743fd5f4c81f8cc5220e5a25

Height

#985,736

Difficulty

10.847637

Transactions

2

Size

1.00 KB

Version

2

Bits

0ad8febc

Nonce

247,519,530

Timestamp

3/22/2015, 1:57:06 PM

Confirmations

5,830,200

Merkle Root

95643b5275260b9f695add1b2e8ab211e166991725d5f34852b26b093107c382
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.458 × 10⁹⁷(98-digit number)
34585976365391038953…96721758767779563519
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.458 × 10⁹⁷(98-digit number)
34585976365391038953…96721758767779563519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.917 × 10⁹⁷(98-digit number)
69171952730782077907…93443517535559127039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.383 × 10⁹⁸(99-digit number)
13834390546156415581…86887035071118254079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.766 × 10⁹⁸(99-digit number)
27668781092312831163…73774070142236508159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.533 × 10⁹⁸(99-digit number)
55337562184625662326…47548140284473016319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.106 × 10⁹⁹(100-digit number)
11067512436925132465…95096280568946032639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.213 × 10⁹⁹(100-digit number)
22135024873850264930…90192561137892065279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.427 × 10⁹⁹(100-digit number)
44270049747700529860…80385122275784130559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.854 × 10⁹⁹(100-digit number)
88540099495401059721…60770244551568261119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.770 × 10¹⁰⁰(101-digit number)
17708019899080211944…21540489103136522239
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,771,601 XPM·at block #6,815,935 · 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