Block #3,002,674

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2019, 10:32:14 PM · Difficulty 11.2017 · 3,837,993 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc198f9efb01f028e5c18308636fd2f5ac4bbb6881f2c53a891aff47f6842283

Height

#3,002,674

Difficulty

11.201668

Transactions

2

Size

392 B

Version

2

Bits

0b33a083

Nonce

584,681,661

Timestamp

1/9/2019, 10:32:14 PM

Confirmations

3,837,993

Merkle Root

74fa27704413cd6473068030e7a1134d3a743a13e5cfa30b7d7779742e15fc5f
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.

1.276 × 10⁹⁵(96-digit number)
12764964978005994380…29849782190810456639
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.276 × 10⁹⁵(96-digit number)
12764964978005994380…29849782190810456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.552 × 10⁹⁵(96-digit number)
25529929956011988760…59699564381620913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.105 × 10⁹⁵(96-digit number)
51059859912023977521…19399128763241826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.021 × 10⁹⁶(97-digit number)
10211971982404795504…38798257526483653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.042 × 10⁹⁶(97-digit number)
20423943964809591008…77596515052967306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.084 × 10⁹⁶(97-digit number)
40847887929619182017…55193030105934612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.169 × 10⁹⁶(97-digit number)
81695775859238364035…10386060211869224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.633 × 10⁹⁷(98-digit number)
16339155171847672807…20772120423738449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.267 × 10⁹⁷(98-digit number)
32678310343695345614…41544240847476899839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.535 × 10⁹⁷(98-digit number)
65356620687390691228…83088481694953799679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.307 × 10⁹⁸(99-digit number)
13071324137478138245…66176963389907599359
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,969,679 XPM·at block #6,840,666 · 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