Block #396,227

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 6:47:31 AM · Difficulty 10.4103 · 6,414,769 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1995a3c70a3468a0c3b5ee1f05dbb56963af1a5a68eae1144a436ad487b66bf8

Height

#396,227

Difficulty

10.410251

Transactions

12

Size

3.26 KB

Version

2

Bits

0a69063a

Nonce

80,303

Timestamp

2/9/2014, 6:47:31 AM

Confirmations

6,414,769

Merkle Root

6469945a3b1d7ddb7aabc81037879232bdc9d0978cb02a8f8b28dacf37ae0e77
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.613 × 10⁹⁸(99-digit number)
76133076152392382915…72662601741283391361
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.613 × 10⁹⁸(99-digit number)
76133076152392382915…72662601741283391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.522 × 10⁹⁹(100-digit number)
15226615230478476583…45325203482566782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.045 × 10⁹⁹(100-digit number)
30453230460956953166…90650406965133565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.090 × 10⁹⁹(100-digit number)
60906460921913906332…81300813930267130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.218 × 10¹⁰⁰(101-digit number)
12181292184382781266…62601627860534261761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.436 × 10¹⁰⁰(101-digit number)
24362584368765562533…25203255721068523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.872 × 10¹⁰⁰(101-digit number)
48725168737531125066…50406511442137047041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.745 × 10¹⁰⁰(101-digit number)
97450337475062250132…00813022884274094081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.949 × 10¹⁰¹(102-digit number)
19490067495012450026…01626045768548188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.898 × 10¹⁰¹(102-digit number)
38980134990024900052…03252091537096376321
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,732,070 XPM·at block #6,810,995 · 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