Block #303,714

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 12:56:11 PM · Difficulty 9.9931 · 6,506,660 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
db60b1600a70d98d6f368e3722330141dab8fde328ce38c89289e87e2b4e25cb

Height

#303,714

Difficulty

9.993100

Transactions

16

Size

5.94 KB

Version

2

Bits

09fe3bc5

Nonce

141,026

Timestamp

12/10/2013, 12:56:11 PM

Confirmations

6,506,660

Merkle Root

3518ce880692021421958f8cd4d2fdf975733f9a9675d48746774d6b99dcb659
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.467 × 10⁹¹(92-digit number)
84678448264716243552…51289248659534162001
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.467 × 10⁹¹(92-digit number)
84678448264716243552…51289248659534162001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.693 × 10⁹²(93-digit number)
16935689652943248710…02578497319068324001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.387 × 10⁹²(93-digit number)
33871379305886497421…05156994638136648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.774 × 10⁹²(93-digit number)
67742758611772994842…10313989276273296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.354 × 10⁹³(94-digit number)
13548551722354598968…20627978552546592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.709 × 10⁹³(94-digit number)
27097103444709197936…41255957105093184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.419 × 10⁹³(94-digit number)
54194206889418395873…82511914210186368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.083 × 10⁹⁴(95-digit number)
10838841377883679174…65023828420372736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.167 × 10⁹⁴(95-digit number)
21677682755767358349…30047656840745472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.335 × 10⁹⁴(95-digit number)
43355365511534716698…60095313681490944001
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,727,068 XPM·at block #6,810,373 · 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