Block #1,544,280

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2016, 5:50:32 PM · Difficulty 10.6531 · 5,265,195 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fe664f352fb2f044150223e8925b7e9c509da9843934225f50e9b798afc571b9

Height

#1,544,280

Difficulty

10.653117

Transactions

38

Size

11.74 KB

Version

2

Bits

0aa732a8

Nonce

455,336,846

Timestamp

4/16/2016, 5:50:32 PM

Confirmations

5,265,195

Merkle Root

8ee0c54daa6197a0f5a4b81abc3e1dd17467a501ef87daaafa264ac8e62d3eb8
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.489 × 10⁹⁵(96-digit number)
24892977413845621053…25409097612696718721
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.489 × 10⁹⁵(96-digit number)
24892977413845621053…25409097612696718721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.978 × 10⁹⁵(96-digit number)
49785954827691242106…50818195225393437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.957 × 10⁹⁵(96-digit number)
99571909655382484212…01636390450786874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.991 × 10⁹⁶(97-digit number)
19914381931076496842…03272780901573749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.982 × 10⁹⁶(97-digit number)
39828763862152993684…06545561803147499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.965 × 10⁹⁶(97-digit number)
79657527724305987369…13091123606294999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.593 × 10⁹⁷(98-digit number)
15931505544861197473…26182247212589998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.186 × 10⁹⁷(98-digit number)
31863011089722394947…52364494425179996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.372 × 10⁹⁷(98-digit number)
63726022179444789895…04728988850359992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.274 × 10⁹⁸(99-digit number)
12745204435888957979…09457977700719984641
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,719,872 XPM·at block #6,809,474 · 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