Block #2,804,447

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/22/2018, 3:36:00 AM · Difficulty 11.6680 · 4,037,649 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8984ad031ba97600ab570a994770950c8c213b06a7f50b97e0902f70b05e4d03

Height

#2,804,447

Difficulty

11.668037

Transactions

13

Size

4.51 KB

Version

2

Bits

0bab0473

Nonce

1,425,918,887

Timestamp

8/22/2018, 3:36:00 AM

Confirmations

4,037,649

Merkle Root

fd0ba39e770259caa6a67ca22a7e3fae147d1add066d3a0dd6fd49ceda044033
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.

1.198 × 10⁹⁴(95-digit number)
11988150696479965161…12624351215626801601
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
1.198 × 10⁹⁴(95-digit number)
11988150696479965161…12624351215626801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.397 × 10⁹⁴(95-digit number)
23976301392959930322…25248702431253603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.795 × 10⁹⁴(95-digit number)
47952602785919860645…50497404862507206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.590 × 10⁹⁴(95-digit number)
95905205571839721291…00994809725014412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.918 × 10⁹⁵(96-digit number)
19181041114367944258…01989619450028825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.836 × 10⁹⁵(96-digit number)
38362082228735888516…03979238900057651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.672 × 10⁹⁵(96-digit number)
76724164457471777032…07958477800115302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.534 × 10⁹⁶(97-digit number)
15344832891494355406…15916955600230604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.068 × 10⁹⁶(97-digit number)
30689665782988710813…31833911200461209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.137 × 10⁹⁶(97-digit number)
61379331565977421626…63667822400922419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.227 × 10⁹⁷(98-digit number)
12275866313195484325…27335644801844838401
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,981,154 XPM·at block #6,842,095 · 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