Block #300,244

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 11:54:34 AM · Difficulty 9.9922 · 6,508,603 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5fc589341fb7af85b11867be62dafbf3c7a236d039c7f129bbb4fe2378c48091

Height

#300,244

Difficulty

9.992225

Transactions

16

Size

32.47 KB

Version

2

Bits

09fe0277

Nonce

8,797

Timestamp

12/8/2013, 11:54:34 AM

Confirmations

6,508,603

Merkle Root

d9969774ae7a114a9a40672f5a55ea8022dd39a19d55843e312d68dad14478df
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.640 × 10⁹⁴(95-digit number)
46400835353309582340…36023926241858595841
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.640 × 10⁹⁴(95-digit number)
46400835353309582340…36023926241858595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.280 × 10⁹⁴(95-digit number)
92801670706619164680…72047852483717191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.856 × 10⁹⁵(96-digit number)
18560334141323832936…44095704967434383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.712 × 10⁹⁵(96-digit number)
37120668282647665872…88191409934868766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.424 × 10⁹⁵(96-digit number)
74241336565295331744…76382819869737533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.484 × 10⁹⁶(97-digit number)
14848267313059066348…52765639739475066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.969 × 10⁹⁶(97-digit number)
29696534626118132697…05531279478950133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.939 × 10⁹⁶(97-digit number)
59393069252236265395…11062558957900267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.187 × 10⁹⁷(98-digit number)
11878613850447253079…22125117915800535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.375 × 10⁹⁷(98-digit number)
23757227700894506158…44250235831601070081
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,714,824 XPM·at block #6,808,846 · 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