Block #3,012,866

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2019, 3:08:37 AM · Difficulty 11.1761 · 3,803,163 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
febc833e7efe75dd1b2c208cde509f658909bf35d32471e1a466fe5f7bbe989a

Height

#3,012,866

Difficulty

11.176125

Transactions

7

Size

2.26 KB

Version

2

Bits

0b2d1684

Nonce

22,110,375

Timestamp

1/17/2019, 3:08:37 AM

Confirmations

3,803,163

Merkle Root

fd32c6a74c32326e4b5c50ec4f977699f0ec0ffeead679541383596393695bf9
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.

7.380 × 10⁹⁶(97-digit number)
73804306329897095614…46936425986046648319
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
7.380 × 10⁹⁶(97-digit number)
73804306329897095614…46936425986046648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.476 × 10⁹⁷(98-digit number)
14760861265979419122…93872851972093296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.952 × 10⁹⁷(98-digit number)
29521722531958838245…87745703944186593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.904 × 10⁹⁷(98-digit number)
59043445063917676491…75491407888373186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.180 × 10⁹⁸(99-digit number)
11808689012783535298…50982815776746373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.361 × 10⁹⁸(99-digit number)
23617378025567070596…01965631553492746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.723 × 10⁹⁸(99-digit number)
47234756051134141193…03931263106985492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.446 × 10⁹⁸(99-digit number)
94469512102268282386…07862526213970984959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.889 × 10⁹⁹(100-digit number)
18893902420453656477…15725052427941969919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.778 × 10⁹⁹(100-digit number)
37787804840907312954…31450104855883939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.557 × 10⁹⁹(100-digit number)
75575609681814625909…62900209711767879679
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,772,345 XPM·at block #6,816,028 · 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