Block #307,792

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 6:49:01 PM · Difficulty 9.9943 · 6,498,588 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a608e8cc0e3f1f951163b7c68e2a2d907d7809c9519a00f2395215c6646a539

Height

#307,792

Difficulty

9.994288

Transactions

6

Size

1.30 KB

Version

2

Bits

09fe89b0

Nonce

8,316

Timestamp

12/12/2013, 6:49:01 PM

Confirmations

6,498,588

Merkle Root

931d4d7c684e7999bc97f4f242b7cbb29fc4f4276e9f2a38d724f905c6f9db19
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.

7.062 × 10⁹³(94-digit number)
70628753956115184868…03648634898940088321
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
7.062 × 10⁹³(94-digit number)
70628753956115184868…03648634898940088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.412 × 10⁹⁴(95-digit number)
14125750791223036973…07297269797880176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.825 × 10⁹⁴(95-digit number)
28251501582446073947…14594539595760353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.650 × 10⁹⁴(95-digit number)
56503003164892147894…29189079191520706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.130 × 10⁹⁵(96-digit number)
11300600632978429578…58378158383041413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.260 × 10⁹⁵(96-digit number)
22601201265956859157…16756316766082826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.520 × 10⁹⁵(96-digit number)
45202402531913718315…33512633532165652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.040 × 10⁹⁵(96-digit number)
90404805063827436631…67025267064331304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.808 × 10⁹⁶(97-digit number)
18080961012765487326…34050534128662609921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.616 × 10⁹⁶(97-digit number)
36161922025530974652…68101068257325219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.232 × 10⁹⁶(97-digit number)
72323844051061949304…36202136514650439681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,695,129 XPM·at block #6,806,379 · 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