Block #3,010,915

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2019, 4:20:16 PM · Difficulty 11.1978 · 3,833,644 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6f7d13417425582baa7963976719180ecf4f3ea4b4d826b6988398e8b1109363

Height

#3,010,915

Difficulty

11.197841

Transactions

22

Size

6.74 KB

Version

2

Bits

0b32a5b2

Nonce

145,094,398

Timestamp

1/15/2019, 4:20:16 PM

Confirmations

3,833,644

Merkle Root

5b7faea7d3b584c5eedfe173d1eef0224d6836379f3010c18c5e92c955cc2cf3
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.

5.578 × 10⁹⁶(97-digit number)
55781400090115137167…69230347126933831681
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
5.578 × 10⁹⁶(97-digit number)
55781400090115137167…69230347126933831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.115 × 10⁹⁷(98-digit number)
11156280018023027433…38460694253867663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.231 × 10⁹⁷(98-digit number)
22312560036046054867…76921388507735326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.462 × 10⁹⁷(98-digit number)
44625120072092109734…53842777015470653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.925 × 10⁹⁷(98-digit number)
89250240144184219468…07685554030941306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.785 × 10⁹⁸(99-digit number)
17850048028836843893…15371108061882613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.570 × 10⁹⁸(99-digit number)
35700096057673687787…30742216123765227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.140 × 10⁹⁸(99-digit number)
71400192115347375574…61484432247530455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.428 × 10⁹⁹(100-digit number)
14280038423069475114…22968864495060910081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.856 × 10⁹⁹(100-digit number)
28560076846138950229…45937728990121820161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.712 × 10⁹⁹(100-digit number)
57120153692277900459…91875457980243640321
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,000,874 XPM·at block #6,844,558 · 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