Block #318,268

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 6:03:22 AM · Difficulty 10.1598 · 6,497,858 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6732ef629be93cfea5da1d4263685b5b0b65602c26162502fb1d5e511bf909c4

Height

#318,268

Difficulty

10.159814

Transactions

1

Size

1.08 KB

Version

2

Bits

0a28e98c

Nonce

15,485

Timestamp

12/18/2013, 6:03:22 AM

Confirmations

6,497,858

Merkle Root

7c9f39524e4b926c395168cff2138c2ea05991f0840f961d1603f744da9e9df9
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.851 × 10⁹⁵(96-digit number)
88514187893315426325…09512407430577297921
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.851 × 10⁹⁵(96-digit number)
88514187893315426325…09512407430577297921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.770 × 10⁹⁶(97-digit number)
17702837578663085265…19024814861154595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.540 × 10⁹⁶(97-digit number)
35405675157326170530…38049629722309191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.081 × 10⁹⁶(97-digit number)
70811350314652341060…76099259444618383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.416 × 10⁹⁷(98-digit number)
14162270062930468212…52198518889236766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.832 × 10⁹⁷(98-digit number)
28324540125860936424…04397037778473533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.664 × 10⁹⁷(98-digit number)
56649080251721872848…08794075556947066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.132 × 10⁹⁸(99-digit number)
11329816050344374569…17588151113894133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.265 × 10⁹⁸(99-digit number)
22659632100688749139…35176302227788267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.531 × 10⁹⁸(99-digit number)
45319264201377498278…70352604455576535041
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,773,133 XPM·at block #6,816,125 · 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