Block #310,524

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 2:53:17 AM · Difficulty 9.9952 · 6,506,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dc1615f82854d6fe1cd70987d7694af38ce97be9937767703da561ba8b280cea

Height

#310,524

Difficulty

9.995210

Transactions

5

Size

1.22 KB

Version

2

Bits

09fec610

Nonce

21,136

Timestamp

12/14/2013, 2:53:17 AM

Confirmations

6,506,107

Merkle Root

0eb3560b14590c595656b2fa180502ff4f243ccd9e13c58b189315bddd8d9fc8
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.729 × 10⁹³(94-digit number)
87294575767883292413…17804417757782615521
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.729 × 10⁹³(94-digit number)
87294575767883292413…17804417757782615521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.745 × 10⁹⁴(95-digit number)
17458915153576658482…35608835515565231041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.491 × 10⁹⁴(95-digit number)
34917830307153316965…71217671031130462081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.983 × 10⁹⁴(95-digit number)
69835660614306633930…42435342062260924161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.396 × 10⁹⁵(96-digit number)
13967132122861326786…84870684124521848321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.793 × 10⁹⁵(96-digit number)
27934264245722653572…69741368249043696641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.586 × 10⁹⁵(96-digit number)
55868528491445307144…39482736498087393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.117 × 10⁹⁶(97-digit number)
11173705698289061428…78965472996174786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.234 × 10⁹⁶(97-digit number)
22347411396578122857…57930945992349573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.469 × 10⁹⁶(97-digit number)
44694822793156245715…15861891984699146241
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,777,162 XPM·at block #6,816,630 · 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