Block #1,762,610

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/14/2016, 11:29:54 AM · Difficulty 10.7376 · 5,079,700 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
67af8bb954e4a0398c0734e951539dbe8f3364bdc261dbae43b3ae74e4b43272

Height

#1,762,610

Difficulty

10.737583

Transactions

2

Size

1.28 KB

Version

2

Bits

0abcd241

Nonce

336,488,124

Timestamp

9/14/2016, 11:29:54 AM

Confirmations

5,079,700

Merkle Root

9009c1d302eb5788c03207930a94f4b14fb28e0aa7aee676ff98dabcae69a3a5
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.

4.953 × 10⁹⁵(96-digit number)
49533664036536454048…20157690461076055041
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
4.953 × 10⁹⁵(96-digit number)
49533664036536454048…20157690461076055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.906 × 10⁹⁵(96-digit number)
99067328073072908096…40315380922152110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.981 × 10⁹⁶(97-digit number)
19813465614614581619…80630761844304220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.962 × 10⁹⁶(97-digit number)
39626931229229163238…61261523688608440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.925 × 10⁹⁶(97-digit number)
79253862458458326477…22523047377216880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.585 × 10⁹⁷(98-digit number)
15850772491691665295…45046094754433761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.170 × 10⁹⁷(98-digit number)
31701544983383330591…90092189508867522561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.340 × 10⁹⁷(98-digit number)
63403089966766661182…80184379017735045121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.268 × 10⁹⁸(99-digit number)
12680617993353332236…60368758035470090241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.536 × 10⁹⁸(99-digit number)
25361235986706664472…20737516070940180481
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,982,886 XPM·at block #6,842,309 · 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