Block #2,300,310

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/18/2017, 4:10:18 PM · Difficulty 10.9329 · 4,507,280 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d264d3a7cb83165ca1864efb1b21f97f7ddb3310ef5622cf724b52ef5602db9b

Height

#2,300,310

Difficulty

10.932904

Transactions

3

Size

652 B

Version

2

Bits

0aeed2cc

Nonce

529,657,092

Timestamp

9/18/2017, 4:10:18 PM

Confirmations

4,507,280

Merkle Root

693996645d1c8fc430063f8e160506785fbcfa870eae26703d8c5a606f94ecb5
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.

8.647 × 10⁹⁵(96-digit number)
86477660040721483736…18232565756044935681
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
8.647 × 10⁹⁵(96-digit number)
86477660040721483736…18232565756044935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.729 × 10⁹⁶(97-digit number)
17295532008144296747…36465131512089871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.459 × 10⁹⁶(97-digit number)
34591064016288593494…72930263024179742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.918 × 10⁹⁶(97-digit number)
69182128032577186989…45860526048359485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.383 × 10⁹⁷(98-digit number)
13836425606515437397…91721052096718970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.767 × 10⁹⁷(98-digit number)
27672851213030874795…83442104193437941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.534 × 10⁹⁷(98-digit number)
55345702426061749591…66884208386875883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.106 × 10⁹⁸(99-digit number)
11069140485212349918…33768416773751767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.213 × 10⁹⁸(99-digit number)
22138280970424699836…67536833547503534081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.427 × 10⁹⁸(99-digit number)
44276561940849399673…35073667095007068161
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,704,747 XPM·at block #6,807,589 · 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.

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