Block #1,747,501

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/4/2016, 8:44:45 AM · Difficulty 10.7073 · 5,067,311 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
296c146c0871058f76d4c7f70d0ca69dac4bd44d4b76ad276d62444a547b8408

Height

#1,747,501

Difficulty

10.707285

Transactions

47

Size

15.08 KB

Version

2

Bits

0ab510a6

Nonce

759,921,120

Timestamp

9/4/2016, 8:44:45 AM

Confirmations

5,067,311

Merkle Root

ea1446401ca87801e92e9b9273aecbea81eb885bff86309347136de2b7b4df7d
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.094 × 10⁹⁵(96-digit number)
10947046154369005025…42032474614798126721
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.094 × 10⁹⁵(96-digit number)
10947046154369005025…42032474614798126721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.189 × 10⁹⁵(96-digit number)
21894092308738010051…84064949229596253441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.378 × 10⁹⁵(96-digit number)
43788184617476020103…68129898459192506881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.757 × 10⁹⁵(96-digit number)
87576369234952040207…36259796918385013761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.751 × 10⁹⁶(97-digit number)
17515273846990408041…72519593836770027521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.503 × 10⁹⁶(97-digit number)
35030547693980816082…45039187673540055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.006 × 10⁹⁶(97-digit number)
70061095387961632165…90078375347080110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.401 × 10⁹⁷(98-digit number)
14012219077592326433…80156750694160220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.802 × 10⁹⁷(98-digit number)
28024438155184652866…60313501388320440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.604 × 10⁹⁷(98-digit number)
56048876310369305732…20627002776640880641
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,762,582 XPM·at block #6,814,811 · 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