Block #2,039,540

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/26/2017, 3:38:55 PM · Difficulty 10.6793 · 4,775,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab160c099a18a576dbb0a3c6d8dc8f9596057080d58b29f7f839f2cbfb2e4a92

Height

#2,039,540

Difficulty

10.679316

Transactions

2

Size

1.28 KB

Version

2

Bits

0aade7a5

Nonce

322,428,139

Timestamp

3/26/2017, 3:38:55 PM

Confirmations

4,775,601

Merkle Root

9926661a197ff4eeed650c66aceca15725aeb4c9b11b6e54d43cdc14af89ecbb
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.

3.548 × 10⁹⁵(96-digit number)
35485671480147482854…60023266777518964801
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.548 × 10⁹⁵(96-digit number)
35485671480147482854…60023266777518964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.097 × 10⁹⁵(96-digit number)
70971342960294965708…20046533555037929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.419 × 10⁹⁶(97-digit number)
14194268592058993141…40093067110075859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.838 × 10⁹⁶(97-digit number)
28388537184117986283…80186134220151718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.677 × 10⁹⁶(97-digit number)
56777074368235972566…60372268440303436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.135 × 10⁹⁷(98-digit number)
11355414873647194513…20744536880606873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.271 × 10⁹⁷(98-digit number)
22710829747294389026…41489073761213747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.542 × 10⁹⁷(98-digit number)
45421659494588778053…82978147522427494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.084 × 10⁹⁷(98-digit number)
90843318989177556106…65956295044854988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.816 × 10⁹⁸(99-digit number)
18168663797835511221…31912590089709977601
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,765,222 XPM·at block #6,815,140 · 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