Block #3,048,994

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2019, 11:37:34 PM · Difficulty 10.9961 · 3,796,223 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8dd9f0c2de6b2dd5afcd3f691658c5e05a53754f72e384c4f9399add5c010e1

Height

#3,048,994

Difficulty

10.996080

Transactions

7

Size

3.31 KB

Version

2

Bits

0afeff12

Nonce

70,209,520

Timestamp

2/11/2019, 11:37:34 PM

Confirmations

3,796,223

Merkle Root

20a62b1250bc5b2bca54617d657583fdb5b51eff0cdd7e82c131d632cfc6dcd5
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.750 × 10⁹⁵(96-digit number)
47500834066115717190…77887839114819586941
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.750 × 10⁹⁵(96-digit number)
47500834066115717190…77887839114819586941
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.500 × 10⁹⁵(96-digit number)
95001668132231434380…55775678229639173881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.900 × 10⁹⁶(97-digit number)
19000333626446286876…11551356459278347761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.800 × 10⁹⁶(97-digit number)
38000667252892573752…23102712918556695521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.600 × 10⁹⁶(97-digit number)
76001334505785147504…46205425837113391041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.520 × 10⁹⁷(98-digit number)
15200266901157029500…92410851674226782081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.040 × 10⁹⁷(98-digit number)
30400533802314059001…84821703348453564161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.080 × 10⁹⁷(98-digit number)
60801067604628118003…69643406696907128321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.216 × 10⁹⁸(99-digit number)
12160213520925623600…39286813393814256641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.432 × 10⁹⁸(99-digit number)
24320427041851247201…78573626787628513281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.864 × 10⁹⁸(99-digit number)
48640854083702494402…57147253575257026561
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,006,169 XPM·at block #6,845,216 · 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