Block #2,749,430

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/15/2018, 3:18:22 AM · Difficulty 11.6474 · 4,092,558 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
448603bb94b7523a5ca3b2dfa3b0817b4ad8d87452cc725f8ea241bf11d4d8c7

Height

#2,749,430

Difficulty

11.647353

Transactions

40

Size

11.42 KB

Version

2

Bits

0ba5b8f1

Nonce

13,699,013

Timestamp

7/15/2018, 3:18:22 AM

Confirmations

4,092,558

Merkle Root

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

8.115 × 10⁹⁴(95-digit number)
81151995309424756298…63363925761593157801
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
8.115 × 10⁹⁴(95-digit number)
81151995309424756298…63363925761593157801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.623 × 10⁹⁵(96-digit number)
16230399061884951259…26727851523186315601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.246 × 10⁹⁵(96-digit number)
32460798123769902519…53455703046372631201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.492 × 10⁹⁵(96-digit number)
64921596247539805038…06911406092745262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.298 × 10⁹⁶(97-digit number)
12984319249507961007…13822812185490524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.596 × 10⁹⁶(97-digit number)
25968638499015922015…27645624370981049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.193 × 10⁹⁶(97-digit number)
51937276998031844031…55291248741962099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.038 × 10⁹⁷(98-digit number)
10387455399606368806…10582497483924198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.077 × 10⁹⁷(98-digit number)
20774910799212737612…21164994967848396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.154 × 10⁹⁷(98-digit number)
41549821598425475224…42329989935696793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.309 × 10⁹⁷(98-digit number)
83099643196850950449…84659979871393587201
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,980,290 XPM·at block #6,841,987 · 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