Block #2,749,301

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/15/2018, 1:00:12 AM · Difficulty 11.6478 · 4,089,628 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ffbe9aafa72f1921826ccfe186af8ab8f30caefc87b604fa37d9560d06dc45a9

Height

#2,749,301

Difficulty

11.647810

Transactions

38

Size

10.13 KB

Version

2

Bits

0ba5d6e5

Nonce

473,659,529

Timestamp

7/15/2018, 1:00:12 AM

Confirmations

4,089,628

Merkle Root

2955aebe65b5e955c5498f62a3db164c4627f18dc1a29a43b6186df67e6921f0
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.

2.146 × 10⁹⁵(96-digit number)
21464854586339580387…49579721913686474001
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
2.146 × 10⁹⁵(96-digit number)
21464854586339580387…49579721913686474001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.292 × 10⁹⁵(96-digit number)
42929709172679160774…99159443827372948001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.585 × 10⁹⁵(96-digit number)
85859418345358321548…98318887654745896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.717 × 10⁹⁶(97-digit number)
17171883669071664309…96637775309491792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.434 × 10⁹⁶(97-digit number)
34343767338143328619…93275550618983584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.868 × 10⁹⁶(97-digit number)
68687534676286657238…86551101237967168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.373 × 10⁹⁷(98-digit number)
13737506935257331447…73102202475934336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.747 × 10⁹⁷(98-digit number)
27475013870514662895…46204404951868672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.495 × 10⁹⁷(98-digit number)
54950027741029325790…92408809903737344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.099 × 10⁹⁸(99-digit number)
10990005548205865158…84817619807474688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.198 × 10⁹⁸(99-digit number)
21980011096411730316…69635239614949376001
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,955,695 XPM·at block #6,838,928 · 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