Block #3,005,852

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2019, 4:03:18 AM · Difficulty 11.1966 · 3,836,719 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ce813af1af4aa43bb62f74bfeefbcd9b89403becfbbcde61c9607262ae3a1b6b

Height

#3,005,852

Difficulty

11.196643

Transactions

10

Size

3.34 KB

Version

2

Bits

0b32572e

Nonce

1,045,532,782

Timestamp

1/12/2019, 4:03:18 AM

Confirmations

3,836,719

Merkle Root

fbe4b2174564412d4f7fa672f93eee8beaa02cd03b7ddd2aec8046aeae03ee75
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.187 × 10⁹³(94-digit number)
31872284912516792435…53425065925760847099
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.187 × 10⁹³(94-digit number)
31872284912516792435…53425065925760847099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.374 × 10⁹³(94-digit number)
63744569825033584871…06850131851521694199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.274 × 10⁹⁴(95-digit number)
12748913965006716974…13700263703043388399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.549 × 10⁹⁴(95-digit number)
25497827930013433948…27400527406086776799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.099 × 10⁹⁴(95-digit number)
50995655860026867897…54801054812173553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.019 × 10⁹⁵(96-digit number)
10199131172005373579…09602109624347107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.039 × 10⁹⁵(96-digit number)
20398262344010747159…19204219248694214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.079 × 10⁹⁵(96-digit number)
40796524688021494318…38408438497388428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.159 × 10⁹⁵(96-digit number)
81593049376042988636…76816876994776857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.631 × 10⁹⁶(97-digit number)
16318609875208597727…53633753989553715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.263 × 10⁹⁶(97-digit number)
32637219750417195454…07267507979107430399
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,984,995 XPM·at block #6,842,570 · 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