Block #318,290

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 6:23:43 AM · Difficulty 10.1601 · 6,521,788 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f5ddb4754bd9440676b850237676fdc2203e81628592b007255b1b6d2a3fc45

Height

#318,290

Difficulty

10.160145

Transactions

10

Size

3.63 KB

Version

2

Bits

0a28ff41

Nonce

40,119

Timestamp

12/18/2013, 6:23:43 AM

Confirmations

6,521,788

Merkle Root

e001e517ccaaa478038395e29ab357298779a2465b143c7f27a4286efb6f519e
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.

4.879 × 10⁹⁶(97-digit number)
48795831453775178030…47463717469709790001
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
4.879 × 10⁹⁶(97-digit number)
48795831453775178030…47463717469709790001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.759 × 10⁹⁶(97-digit number)
97591662907550356061…94927434939419580001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.951 × 10⁹⁷(98-digit number)
19518332581510071212…89854869878839160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.903 × 10⁹⁷(98-digit number)
39036665163020142424…79709739757678320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.807 × 10⁹⁷(98-digit number)
78073330326040284849…59419479515356640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.561 × 10⁹⁸(99-digit number)
15614666065208056969…18838959030713280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.122 × 10⁹⁸(99-digit number)
31229332130416113939…37677918061426560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.245 × 10⁹⁸(99-digit number)
62458664260832227879…75355836122853120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.249 × 10⁹⁹(100-digit number)
12491732852166445575…50711672245706240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.498 × 10⁹⁹(100-digit number)
24983465704332891151…01423344491412480001
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,964,931 XPM·at block #6,840,077 · 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