Block #2,755,474

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/19/2018, 4:34:15 AM · Difficulty 11.6617 · 4,087,073 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec0db8250bbce2a8f697daa1e61b73e5023ecf8f622e137f249e03a05ca95552

Height

#2,755,474

Difficulty

11.661699

Transactions

33

Size

9.84 KB

Version

2

Bits

0ba9651a

Nonce

1,463,279,513

Timestamp

7/19/2018, 4:34:15 AM

Confirmations

4,087,073

Merkle Root

1bd4a7a316da8cf995cc2f4157481f7a83a3a4b86b0437814d968a01cacec475
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.

4.694 × 10⁹⁵(96-digit number)
46948434990974184528…21774229882244347919
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
4.694 × 10⁹⁵(96-digit number)
46948434990974184528…21774229882244347919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.389 × 10⁹⁵(96-digit number)
93896869981948369057…43548459764488695839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.877 × 10⁹⁶(97-digit number)
18779373996389673811…87096919528977391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.755 × 10⁹⁶(97-digit number)
37558747992779347623…74193839057954783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.511 × 10⁹⁶(97-digit number)
75117495985558695246…48387678115909566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.502 × 10⁹⁷(98-digit number)
15023499197111739049…96775356231819133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.004 × 10⁹⁷(98-digit number)
30046998394223478098…93550712463638266879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.009 × 10⁹⁷(98-digit number)
60093996788446956196…87101424927276533759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.201 × 10⁹⁸(99-digit number)
12018799357689391239…74202849854553067519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.403 × 10⁹⁸(99-digit number)
24037598715378782478…48405699709106135039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.807 × 10⁹⁸(99-digit number)
48075197430757564957…96811399418212270079
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,801 XPM·at block #6,842,546 · 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