Block #300,730

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 6:21:44 PM · Difficulty 9.9924 · 6,526,028 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be5481413c7e6b7d1cc049000918e7d0a16c3f82a21ee1f863fe4257b27ae403

Height

#300,730

Difficulty

9.992387

Transactions

1

Size

1.08 KB

Version

2

Bits

09fe0d11

Nonce

28

Timestamp

12/8/2013, 6:21:44 PM

Confirmations

6,526,028

Merkle Root

5b478c16ce1d083b4a5be342de3ce9f625f5011a9ff5608428f45649701733da
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.

1.807 × 10⁹⁶(97-digit number)
18070046247401695853…37986879852880276161
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
1.807 × 10⁹⁶(97-digit number)
18070046247401695853…37986879852880276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.614 × 10⁹⁶(97-digit number)
36140092494803391707…75973759705760552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.228 × 10⁹⁶(97-digit number)
72280184989606783414…51947519411521104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.445 × 10⁹⁷(98-digit number)
14456036997921356682…03895038823042209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.891 × 10⁹⁷(98-digit number)
28912073995842713365…07790077646084418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.782 × 10⁹⁷(98-digit number)
57824147991685426731…15580155292168837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.156 × 10⁹⁸(99-digit number)
11564829598337085346…31160310584337674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.312 × 10⁹⁸(99-digit number)
23129659196674170692…62320621168675348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.625 × 10⁹⁸(99-digit number)
46259318393348341384…24641242337350696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.251 × 10⁹⁸(99-digit number)
92518636786696682769…49282484674701393921
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,858,223 XPM·at block #6,826,757 · 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