Block #2,730,140

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/1/2018, 9:40:31 PM · Difficulty 11.6298 · 4,112,677 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
07909c632f8c320d48445ce9bf56d9a32b6e264389abf025adffc857d77261d0

Height

#2,730,140

Difficulty

11.629765

Transactions

4

Size

1.26 KB

Version

2

Bits

0ba1384a

Nonce

961,084,306

Timestamp

7/1/2018, 9:40:31 PM

Confirmations

4,112,677

Merkle Root

427f7b6555593ee58ca30f81338be281f192f62de834320b7b49875bbd1969d9
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.230 × 10⁹⁶(97-digit number)
42309397580745561494…91353590844811397121
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.230 × 10⁹⁶(97-digit number)
42309397580745561494…91353590844811397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.461 × 10⁹⁶(97-digit number)
84618795161491122989…82707181689622794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.692 × 10⁹⁷(98-digit number)
16923759032298224597…65414363379245588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.384 × 10⁹⁷(98-digit number)
33847518064596449195…30828726758491176961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.769 × 10⁹⁷(98-digit number)
67695036129192898391…61657453516982353921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.353 × 10⁹⁸(99-digit number)
13539007225838579678…23314907033964707841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.707 × 10⁹⁸(99-digit number)
27078014451677159356…46629814067929415681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.415 × 10⁹⁸(99-digit number)
54156028903354318713…93259628135858831361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.083 × 10⁹⁹(100-digit number)
10831205780670863742…86519256271717662721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.166 × 10⁹⁹(100-digit number)
21662411561341727485…73038512543435325441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.332 × 10⁹⁹(100-digit number)
43324823122683454970…46077025086870650881
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:57,986,877 XPM·at block #6,842,816 · 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