Block #2,991,384

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2019, 7:40:53 PM · Difficulty 11.2626 · 3,847,025 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a72195cecea8b780a5336dd79ab40c3322695b70e9cf822b96b33b44c391123c

Height

#2,991,384

Difficulty

11.262570

Transactions

31

Size

8.13 KB

Version

2

Bits

0b4337c6

Nonce

391,216,455

Timestamp

1/1/2019, 7:40:53 PM

Confirmations

3,847,025

Merkle Root

56c0eddb4971bb8c1a5f02734d30906e5329d83230dc39655ce319aa0d187d8a
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.538 × 10⁹⁴(95-digit number)
35383097811435477298…44738174921525166079
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.538 × 10⁹⁴(95-digit number)
35383097811435477298…44738174921525166079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.076 × 10⁹⁴(95-digit number)
70766195622870954597…89476349843050332159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.415 × 10⁹⁵(96-digit number)
14153239124574190919…78952699686100664319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.830 × 10⁹⁵(96-digit number)
28306478249148381838…57905399372201328639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.661 × 10⁹⁵(96-digit number)
56612956498296763677…15810798744402657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.132 × 10⁹⁶(97-digit number)
11322591299659352735…31621597488805314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.264 × 10⁹⁶(97-digit number)
22645182599318705471…63243194977610629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.529 × 10⁹⁶(97-digit number)
45290365198637410942…26486389955221258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.058 × 10⁹⁶(97-digit number)
90580730397274821884…52972779910442516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.811 × 10⁹⁷(98-digit number)
18116146079454964376…05945559820885032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.623 × 10⁹⁷(98-digit number)
36232292158909928753…11891119641770065919
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,951,544 XPM·at block #6,838,408 · 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