Block #301,346

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 3:32:06 AM · Difficulty 9.9925 · 6,512,866 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e69d270f14789b82cfd8d2b9cb63392178f6d480050c86d0a5e3a4c469c5081d

Height

#301,346

Difficulty

9.992507

Transactions

21

Size

6.09 KB

Version

2

Bits

09fe14f4

Nonce

8,585

Timestamp

12/9/2013, 3:32:06 AM

Confirmations

6,512,866

Merkle Root

9f886cba4b636ddee04c870c71a0dc0b4c4b16b5d44625e2f89f8967dcd93de7
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.588 × 10⁸⁹(90-digit number)
85880924029661167220…84432594550855160791
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.588 × 10⁸⁹(90-digit number)
85880924029661167220…84432594550855160791
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.717 × 10⁹⁰(91-digit number)
17176184805932233444…68865189101710321581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.435 × 10⁹⁰(91-digit number)
34352369611864466888…37730378203420643161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.870 × 10⁹⁰(91-digit number)
68704739223728933776…75460756406841286321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.374 × 10⁹¹(92-digit number)
13740947844745786755…50921512813682572641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.748 × 10⁹¹(92-digit number)
27481895689491573510…01843025627365145281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.496 × 10⁹¹(92-digit number)
54963791378983147020…03686051254730290561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.099 × 10⁹²(93-digit number)
10992758275796629404…07372102509460581121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.198 × 10⁹²(93-digit number)
21985516551593258808…14744205018921162241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.397 × 10⁹²(93-digit number)
43971033103186517616…29488410037842324481
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,757,764 XPM·at block #6,814,211 · 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