Block #246,396

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2013, 2:40:08 AM · Difficulty 9.9643 · 6,560,744 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63c79cbe23bdf0dd40b2de06934fe28f4af9f41c035a712ffe11c02a0dfacfaa

Height

#246,396

Difficulty

9.964276

Transactions

2

Size

867 B

Version

2

Bits

09f6dad1

Nonce

122,893

Timestamp

11/6/2013, 2:40:08 AM

Confirmations

6,560,744

Merkle Root

a217dc63beac5370a16586b81c8b540c013447c175a803b1b8bb17988e86c179
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.948 × 10⁹²(93-digit number)
49480684441363545436…03087931467604770481
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.948 × 10⁹²(93-digit number)
49480684441363545436…03087931467604770481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.896 × 10⁹²(93-digit number)
98961368882727090873…06175862935209540961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.979 × 10⁹³(94-digit number)
19792273776545418174…12351725870419081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.958 × 10⁹³(94-digit number)
39584547553090836349…24703451740838163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.916 × 10⁹³(94-digit number)
79169095106181672698…49406903481676327681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.583 × 10⁹⁴(95-digit number)
15833819021236334539…98813806963352655361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.166 × 10⁹⁴(95-digit number)
31667638042472669079…97627613926705310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.333 × 10⁹⁴(95-digit number)
63335276084945338158…95255227853410621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.266 × 10⁹⁵(96-digit number)
12667055216989067631…90510455706821242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.533 × 10⁹⁵(96-digit number)
25334110433978135263…81020911413642485761
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,701,127 XPM·at block #6,807,139 · 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