Block #314,928

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 6:02:01 AM · Difficulty 10.0785 · 6,501,699 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ccf3a2bfd8340ec9af5bca2c85e468179d5504df3adf2458ff1f91a334f0a85

Height

#314,928

Difficulty

10.078465

Transactions

8

Size

5.08 KB

Version

2

Bits

0a141640

Nonce

62,433

Timestamp

12/16/2013, 6:02:01 AM

Confirmations

6,501,699

Merkle Root

3cba11f2f817c495e12937c7111ea980182c3e266df23be3319992d1c2ed227a
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.

6.379 × 10⁹⁸(99-digit number)
63791238730977415649…45795680406574103041
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
6.379 × 10⁹⁸(99-digit number)
63791238730977415649…45795680406574103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.275 × 10⁹⁹(100-digit number)
12758247746195483129…91591360813148206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.551 × 10⁹⁹(100-digit number)
25516495492390966259…83182721626296412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.103 × 10⁹⁹(100-digit number)
51032990984781932519…66365443252592824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.020 × 10¹⁰⁰(101-digit number)
10206598196956386503…32730886505185648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.041 × 10¹⁰⁰(101-digit number)
20413196393912773007…65461773010371297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.082 × 10¹⁰⁰(101-digit number)
40826392787825546015…30923546020742594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.165 × 10¹⁰⁰(101-digit number)
81652785575651092031…61847092041485189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.633 × 10¹⁰¹(102-digit number)
16330557115130218406…23694184082970378241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.266 × 10¹⁰¹(102-digit number)
32661114230260436812…47388368165940756481
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,777,137 XPM·at block #6,816,626 · 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