Block #315,623

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 2:46:33 PM · Difficulty 10.1093 · 6,492,684 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ce405e0c9f7d1bedfb204e6cc04f2a57ac7ab57541583db6566adb6397f88656

Height

#315,623

Difficulty

10.109346

Transactions

8

Size

3.74 KB

Version

2

Bits

0a1bfe1b

Nonce

186,435

Timestamp

12/16/2013, 2:46:33 PM

Confirmations

6,492,684

Merkle Root

280ee3b9a67c36793d4ccaa6731db2ceee455fd93c19305da0dc769b76d06d53
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.

2.737 × 10¹⁰¹(102-digit number)
27376038324211545120…03170768124009519361
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
2.737 × 10¹⁰¹(102-digit number)
27376038324211545120…03170768124009519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.475 × 10¹⁰¹(102-digit number)
54752076648423090240…06341536248019038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.095 × 10¹⁰²(103-digit number)
10950415329684618048…12683072496038077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.190 × 10¹⁰²(103-digit number)
21900830659369236096…25366144992076154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.380 × 10¹⁰²(103-digit number)
43801661318738472192…50732289984152309761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.760 × 10¹⁰²(103-digit number)
87603322637476944384…01464579968304619521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.752 × 10¹⁰³(104-digit number)
17520664527495388876…02929159936609239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.504 × 10¹⁰³(104-digit number)
35041329054990777753…05858319873218478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.008 × 10¹⁰³(104-digit number)
70082658109981555507…11716639746436956161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.401 × 10¹⁰⁴(105-digit number)
14016531621996311101…23433279492873912321
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,710,511 XPM·at block #6,808,306 · 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