Block #2,274,688

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/30/2017, 10:14:06 AM · Difficulty 10.9549 · 4,564,146 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
717ce75993572ae89333f8dd2a5f5d1e309263a453b807c1983d0963f07e8b61

Height

#2,274,688

Difficulty

10.954909

Transactions

3

Size

651 B

Version

2

Bits

0af474f2

Nonce

72,194,829

Timestamp

8/30/2017, 10:14:06 AM

Confirmations

4,564,146

Merkle Root

91e8b46ef1eb2ff6a7992b246b1122c7c00080fe2f1d3f7765f19c5a270f4edf
Transactions (3)
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.

9.148 × 10⁹⁵(96-digit number)
91482825352543659739…06287602526705864321
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
9.148 × 10⁹⁵(96-digit number)
91482825352543659739…06287602526705864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.829 × 10⁹⁶(97-digit number)
18296565070508731947…12575205053411728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.659 × 10⁹⁶(97-digit number)
36593130141017463895…25150410106823457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.318 × 10⁹⁶(97-digit number)
73186260282034927791…50300820213646914561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.463 × 10⁹⁷(98-digit number)
14637252056406985558…00601640427293829121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.927 × 10⁹⁷(98-digit number)
29274504112813971116…01203280854587658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.854 × 10⁹⁷(98-digit number)
58549008225627942233…02406561709175316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.170 × 10⁹⁸(99-digit number)
11709801645125588446…04813123418350632961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.341 × 10⁹⁸(99-digit number)
23419603290251176893…09626246836701265921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.683 × 10⁹⁸(99-digit number)
46839206580502353786…19252493673402531841
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,954,933 XPM·at block #6,838,833 · 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