Block #391,358

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 6:27:29 PM · Difficulty 10.4296 · 6,435,818 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a62a133be109cb315e4caa6e72e9032b569cbdc0c87eedd8d290a3787868ae1

Height

#391,358

Difficulty

10.429601

Transactions

5

Size

1.09 KB

Version

2

Bits

0a6dfa5d

Nonce

17,673

Timestamp

2/5/2014, 6:27:29 PM

Confirmations

6,435,818

Merkle Root

73b57089abf8afac7fbc8dbca2aa88f20bb7f784d8930bafa656604f0f332e1c
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.

3.322 × 10¹⁰²(103-digit number)
33226100335896360854…71215700730634567681
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
3.322 × 10¹⁰²(103-digit number)
33226100335896360854…71215700730634567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.645 × 10¹⁰²(103-digit number)
66452200671792721709…42431401461269135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.329 × 10¹⁰³(104-digit number)
13290440134358544341…84862802922538270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.658 × 10¹⁰³(104-digit number)
26580880268717088683…69725605845076541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.316 × 10¹⁰³(104-digit number)
53161760537434177367…39451211690153082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.063 × 10¹⁰⁴(105-digit number)
10632352107486835473…78902423380306165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.126 × 10¹⁰⁴(105-digit number)
21264704214973670946…57804846760612331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.252 × 10¹⁰⁴(105-digit number)
42529408429947341893…15609693521224663041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.505 × 10¹⁰⁴(105-digit number)
85058816859894683787…31219387042449326081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.701 × 10¹⁰⁵(106-digit number)
17011763371978936757…62438774084898652161
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,861,505 XPM·at block #6,827,175 · 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