Block #304,455

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 10:35:22 PM · Difficulty 9.9933 · 6,505,104 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e4ecaf860d0562523707d7acde19f029938a09c36e48676cb421305296965008

Height

#304,455

Difficulty

9.993342

Transactions

12

Size

54.81 KB

Version

2

Bits

09fe4ba8

Nonce

64,016

Timestamp

12/10/2013, 10:35:22 PM

Confirmations

6,505,104

Merkle Root

841a7529e8f25c1423168972905fc87f07d47e3be3ee75f67e7d260da5efe734
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.983 × 10⁹⁴(95-digit number)
19837683529707288272…82542014156670442321
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.983 × 10⁹⁴(95-digit number)
19837683529707288272…82542014156670442321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.967 × 10⁹⁴(95-digit number)
39675367059414576544…65084028313340884641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.935 × 10⁹⁴(95-digit number)
79350734118829153089…30168056626681769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.587 × 10⁹⁵(96-digit number)
15870146823765830617…60336113253363538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.174 × 10⁹⁵(96-digit number)
31740293647531661235…20672226506727077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.348 × 10⁹⁵(96-digit number)
63480587295063322471…41344453013454154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.269 × 10⁹⁶(97-digit number)
12696117459012664494…82688906026908308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.539 × 10⁹⁶(97-digit number)
25392234918025328988…65377812053816616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.078 × 10⁹⁶(97-digit number)
50784469836050657977…30755624107633233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.015 × 10⁹⁷(98-digit number)
10156893967210131595…61511248215266467841
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,720,547 XPM·at block #6,809,558 · 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