Block #3,559,744

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2020, 8:21:24 AM · Difficulty 10.9097 · 3,246,633 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cbae9943661248427d7947ab92018a8e89791260663b552c3e4e4a6a0dbe450a

Height

#3,559,744

Difficulty

10.909699

Transactions

17

Size

3.26 KB

Version

2

Bits

0ae8e206

Nonce

1,799,042,674

Timestamp

2/16/2020, 8:21:24 AM

Confirmations

3,246,633

Merkle Root

2252e9b097ac28e82931a429e4d78edc51ca8656d3734ae3575e70a14d5aaedf
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.

3.559 × 10⁹³(94-digit number)
35595383612804031348…24906658110737661761
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
3.559 × 10⁹³(94-digit number)
35595383612804031348…24906658110737661761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.119 × 10⁹³(94-digit number)
71190767225608062696…49813316221475323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.423 × 10⁹⁴(95-digit number)
14238153445121612539…99626632442950647041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.847 × 10⁹⁴(95-digit number)
28476306890243225078…99253264885901294081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.695 × 10⁹⁴(95-digit number)
56952613780486450157…98506529771802588161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.139 × 10⁹⁵(96-digit number)
11390522756097290031…97013059543605176321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.278 × 10⁹⁵(96-digit number)
22781045512194580062…94026119087210352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.556 × 10⁹⁵(96-digit number)
45562091024389160125…88052238174420705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.112 × 10⁹⁵(96-digit number)
91124182048778320251…76104476348841410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.822 × 10⁹⁶(97-digit number)
18224836409755664050…52208952697682821121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,695,105 XPM·at block #6,806,376 · 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.

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