Block #3,491,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2019, 8:28:59 AM · Difficulty 10.9573 · 3,346,892 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a78476c47297446357a1a371448aa782198d6037843de0e19d627f63ada3dfa4

Height

#3,491,684

Difficulty

10.957281

Transactions

2

Size

78.58 KB

Version

2

Bits

0af5105a

Nonce

153,441,723

Timestamp

12/28/2019, 8:28:59 AM

Confirmations

3,346,892

Merkle Root

76433addd285adc6a6ad7a7b919d0a24fb9332d1d2f433bf22a1fa9046a35f20
Transactions (2)
1 in → 1 out9.1300 XPM110 B
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.231 × 10⁹⁴(95-digit number)
32310692834231163648…62641276040709894921
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.231 × 10⁹⁴(95-digit number)
32310692834231163648…62641276040709894921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.462 × 10⁹⁴(95-digit number)
64621385668462327296…25282552081419789841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.292 × 10⁹⁵(96-digit number)
12924277133692465459…50565104162839579681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.584 × 10⁹⁵(96-digit number)
25848554267384930918…01130208325679159361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.169 × 10⁹⁵(96-digit number)
51697108534769861837…02260416651358318721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.033 × 10⁹⁶(97-digit number)
10339421706953972367…04520833302716637441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.067 × 10⁹⁶(97-digit number)
20678843413907944735…09041666605433274881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.135 × 10⁹⁶(97-digit number)
41357686827815889470…18083333210866549761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.271 × 10⁹⁶(97-digit number)
82715373655631778940…36166666421733099521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.654 × 10⁹⁷(98-digit number)
16543074731126355788…72333332843466199041
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,952,894 XPM·at block #6,838,575 · 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