Block #456,096

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 11:53:54 PM · Difficulty 10.4163 · 6,354,530 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ac4b562bf414646bfc22cc2fac68c0c2d15843f63fb2fd6e9a22dad3a9631f9

Height

#456,096

Difficulty

10.416284

Transactions

2

Size

597 B

Version

2

Bits

0a6a9198

Nonce

107,715

Timestamp

3/22/2014, 11:53:54 PM

Confirmations

6,354,530

Merkle Root

12ea70d8abe1abff2952083abf6129d59c764f4f3f482171145c38a06469d41d
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.028 × 10⁹⁹(100-digit number)
20288843765295117912…16447938010094453761
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.028 × 10⁹⁹(100-digit number)
20288843765295117912…16447938010094453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.057 × 10⁹⁹(100-digit number)
40577687530590235824…32895876020188907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.115 × 10⁹⁹(100-digit number)
81155375061180471648…65791752040377815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.623 × 10¹⁰⁰(101-digit number)
16231075012236094329…31583504080755630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.246 × 10¹⁰⁰(101-digit number)
32462150024472188659…63167008161511260161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.492 × 10¹⁰⁰(101-digit number)
64924300048944377318…26334016323022520321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.298 × 10¹⁰¹(102-digit number)
12984860009788875463…52668032646045040641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.596 × 10¹⁰¹(102-digit number)
25969720019577750927…05336065292090081281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.193 × 10¹⁰¹(102-digit number)
51939440039155501855…10672130584180162561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.038 × 10¹⁰²(103-digit number)
10387888007831100371…21344261168360325121
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,729,094 XPM·at block #6,810,625 · 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