Block #313,481

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 12:05:50 PM · Difficulty 10.0082 · 6,504,463 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ddce4c782564b1e0724149ba400aef3b99698a4c35d3730a09c71c8dcec050f8

Height

#313,481

Difficulty

10.008230

Transactions

7

Size

1.67 KB

Version

2

Bits

0a021b56

Nonce

177,675

Timestamp

12/15/2013, 12:05:50 PM

Confirmations

6,504,463

Merkle Root

11ea7f37596e9056f88e562d7003ab4af709cc066d6575d1b76bffc0f7fb8585
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.537 × 10¹⁰⁰(101-digit number)
75370892155010931017…25463091236899983361
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.537 × 10¹⁰⁰(101-digit number)
75370892155010931017…25463091236899983361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.507 × 10¹⁰¹(102-digit number)
15074178431002186203…50926182473799966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.014 × 10¹⁰¹(102-digit number)
30148356862004372406…01852364947599933441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.029 × 10¹⁰¹(102-digit number)
60296713724008744813…03704729895199866881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.205 × 10¹⁰²(103-digit number)
12059342744801748962…07409459790399733761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.411 × 10¹⁰²(103-digit number)
24118685489603497925…14818919580799467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.823 × 10¹⁰²(103-digit number)
48237370979206995850…29637839161598935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.647 × 10¹⁰²(103-digit number)
96474741958413991701…59275678323197870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.929 × 10¹⁰³(104-digit number)
19294948391682798340…18551356646395740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.858 × 10¹⁰³(104-digit number)
38589896783365596680…37102713292791480321
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,787,618 XPM·at block #6,817,943 · 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