Block #3,007,311

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 3:33:50 AM · Difficulty 11.2045 · 3,832,661 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b182a7d3c93214bbf24f1b4fa56dc5361d4eb2cae7cb013acc73e601e91af37f

Height

#3,007,311

Difficulty

11.204528

Transactions

15

Size

4.90 KB

Version

2

Bits

0b345bf4

Nonce

463,608,184

Timestamp

1/13/2019, 3:33:50 AM

Confirmations

3,832,661

Merkle Root

a01dfb061bc44766f9a73cd794f0dba0a16109a3acc93a55cb1ddb77c374dd5d
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.441 × 10⁹⁵(96-digit number)
14413373700846850934…92829403884217515519
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.441 × 10⁹⁵(96-digit number)
14413373700846850934…92829403884217515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.882 × 10⁹⁵(96-digit number)
28826747401693701868…85658807768435031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.765 × 10⁹⁵(96-digit number)
57653494803387403737…71317615536870062079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.153 × 10⁹⁶(97-digit number)
11530698960677480747…42635231073740124159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.306 × 10⁹⁶(97-digit number)
23061397921354961494…85270462147480248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.612 × 10⁹⁶(97-digit number)
46122795842709922989…70540924294960496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.224 × 10⁹⁶(97-digit number)
92245591685419845979…41081848589920993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.844 × 10⁹⁷(98-digit number)
18449118337083969195…82163697179841986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.689 × 10⁹⁷(98-digit number)
36898236674167938391…64327394359683973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.379 × 10⁹⁷(98-digit number)
73796473348335876783…28654788719367946239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.475 × 10⁹⁸(99-digit number)
14759294669667175356…57309577438735892479
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,964,081 XPM·at block #6,839,971 · 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