Block #3,444,394

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/22/2019, 8:49:04 PM · Difficulty 10.9786 · 3,363,668 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2388e6fb5ac630e348b1286606a679f1a956b25f54572af8eade29aaa9ab9bb

Height

#3,444,394

Difficulty

10.978588

Transactions

23

Size

6.38 KB

Version

2

Bits

0afa84c1

Nonce

152,248,214

Timestamp

11/22/2019, 8:49:04 PM

Confirmations

3,363,668

Merkle Root

bf2348d8898dd8f4b5f4965e881024c4ede012546d5703a38cb22e51279f23a7
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.279 × 10⁹⁷(98-digit number)
32791440126748197302…79355519526062526721
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.279 × 10⁹⁷(98-digit number)
32791440126748197302…79355519526062526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.558 × 10⁹⁷(98-digit number)
65582880253496394604…58711039052125053441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.311 × 10⁹⁸(99-digit number)
13116576050699278920…17422078104250106881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.623 × 10⁹⁸(99-digit number)
26233152101398557841…34844156208500213761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.246 × 10⁹⁸(99-digit number)
52466304202797115683…69688312417000427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10⁹⁹(100-digit number)
10493260840559423136…39376624834000855041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.098 × 10⁹⁹(100-digit number)
20986521681118846273…78753249668001710081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.197 × 10⁹⁹(100-digit number)
41973043362237692547…57506499336003420161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.394 × 10⁹⁹(100-digit number)
83946086724475385094…15012998672006840321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.678 × 10¹⁰⁰(101-digit number)
16789217344895077018…30025997344013680641
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,708,540 XPM·at block #6,808,061 · 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