Block #3,400,347

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/21/2019, 1:23:50 AM · Difficulty 10.9877 · 3,426,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
07b8f4171bb37bfc99f5c1f382c29ebfd1bbdb6dd94eeee6bccf9e5c785dc586

Height

#3,400,347

Difficulty

10.987733

Transactions

2

Size

541 B

Version

2

Bits

0afcdc0d

Nonce

578,452,394

Timestamp

10/21/2019, 1:23:50 AM

Confirmations

3,426,998

Merkle Root

f8cdc64ce6623707a3c5ae581010500c6247eeb66cb7025e05b215870a58eee2
Transactions (2)
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.139 × 10⁹⁶(97-digit number)
11395416524955516565…59376884632238351041
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.139 × 10⁹⁶(97-digit number)
11395416524955516565…59376884632238351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.279 × 10⁹⁶(97-digit number)
22790833049911033130…18753769264476702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.558 × 10⁹⁶(97-digit number)
45581666099822066261…37507538528953404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.116 × 10⁹⁶(97-digit number)
91163332199644132522…75015077057906808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.823 × 10⁹⁷(98-digit number)
18232666439928826504…50030154115813616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.646 × 10⁹⁷(98-digit number)
36465332879857653008…00060308231627233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.293 × 10⁹⁷(98-digit number)
72930665759715306017…00120616463254466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.458 × 10⁹⁸(99-digit number)
14586133151943061203…00241232926508933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.917 × 10⁹⁸(99-digit number)
29172266303886122407…00482465853017866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.834 × 10⁹⁸(99-digit number)
58344532607772244814…00964931706035732481
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,862,869 XPM·at block #6,827,344 · 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