Block #392,451

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 11:30:46 AM · Difficulty 10.4386 · 6,416,299 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cddddeef5f8377b4cf628cfd429420789362231dab4986a7cb734b18ca24eaca

Height

#392,451

Difficulty

10.438587

Transactions

8

Size

2.16 KB

Version

2

Bits

0a704739

Nonce

39,489

Timestamp

2/6/2014, 11:30:46 AM

Confirmations

6,416,299

Merkle Root

5c67cd2f66d2bd3f698f23c1bd084541b5586f04eaf3f6149d58dcd78e8f94b9
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.

8.175 × 10⁹⁴(95-digit number)
81752571995662694778…52796432412927482839
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
8.175 × 10⁹⁴(95-digit number)
81752571995662694778…52796432412927482839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.635 × 10⁹⁵(96-digit number)
16350514399132538955…05592864825854965679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.270 × 10⁹⁵(96-digit number)
32701028798265077911…11185729651709931359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.540 × 10⁹⁵(96-digit number)
65402057596530155822…22371459303419862719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.308 × 10⁹⁶(97-digit number)
13080411519306031164…44742918606839725439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.616 × 10⁹⁶(97-digit number)
26160823038612062328…89485837213679450879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.232 × 10⁹⁶(97-digit number)
52321646077224124657…78971674427358901759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.046 × 10⁹⁷(98-digit number)
10464329215444824931…57943348854717803519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.092 × 10⁹⁷(98-digit number)
20928658430889649863…15886697709435607039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.185 × 10⁹⁷(98-digit number)
41857316861779299726…31773395418871214079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.371 × 10⁹⁷(98-digit number)
83714633723558599452…63546790837742428159
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,714,049 XPM·at block #6,808,749 · 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