Block #1,744,099

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/1/2016, 8:44:26 PM · Difficulty 10.7184 · 5,088,875 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b86c21aa0062c8b2c7d6468c7fba3dcdf82804f061f6e7b7ee135f1b2ef53f66

Height

#1,744,099

Difficulty

10.718400

Transactions

2

Size

1.46 KB

Version

2

Bits

0ab7e912

Nonce

1,567,258,382

Timestamp

9/1/2016, 8:44:26 PM

Confirmations

5,088,875

Merkle Root

5988169900dae9932da7134a9ba9fd577b91e67a2ea112a465ac9b995e0912b8
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.153 × 10⁹⁵(96-digit number)
11532963724072324343…19414642565664510721
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.153 × 10⁹⁵(96-digit number)
11532963724072324343…19414642565664510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.306 × 10⁹⁵(96-digit number)
23065927448144648687…38829285131329021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.613 × 10⁹⁵(96-digit number)
46131854896289297374…77658570262658042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.226 × 10⁹⁵(96-digit number)
92263709792578594749…55317140525316085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.845 × 10⁹⁶(97-digit number)
18452741958515718949…10634281050632171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.690 × 10⁹⁶(97-digit number)
36905483917031437899…21268562101264343041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.381 × 10⁹⁶(97-digit number)
73810967834062875799…42537124202528686081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.476 × 10⁹⁷(98-digit number)
14762193566812575159…85074248405057372161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.952 × 10⁹⁷(98-digit number)
29524387133625150319…70148496810114744321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.904 × 10⁹⁷(98-digit number)
59048774267250300639…40296993620229488641
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,907,970 XPM·at block #6,832,973 · 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