Block #456,529

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 7:14:23 AM · Difficulty 10.4157 · 6,375,018 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
96c90bc39ae164206c7dcf2cbff280fc9356e7cfdc6a02ce41aac693ae35f4e9

Height

#456,529

Difficulty

10.415682

Transactions

2

Size

720 B

Version

2

Bits

0a6a6a23

Nonce

13,658,869

Timestamp

3/23/2014, 7:14:23 AM

Confirmations

6,375,018

Merkle Root

a093aace914d1b2cd74a299efcc9842935262b640e2e41084a65eb57e0d2332f
Transactions (2)
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.

1.062 × 10⁹⁴(95-digit number)
10622329175453699504…24740427722595739381
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
1.062 × 10⁹⁴(95-digit number)
10622329175453699504…24740427722595739381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.124 × 10⁹⁴(95-digit number)
21244658350907399008…49480855445191478761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.248 × 10⁹⁴(95-digit number)
42489316701814798016…98961710890382957521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.497 × 10⁹⁴(95-digit number)
84978633403629596032…97923421780765915041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.699 × 10⁹⁵(96-digit number)
16995726680725919206…95846843561531830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.399 × 10⁹⁵(96-digit number)
33991453361451838413…91693687123063660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.798 × 10⁹⁵(96-digit number)
67982906722903676826…83387374246127320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.359 × 10⁹⁶(97-digit number)
13596581344580735365…66774748492254640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.719 × 10⁹⁶(97-digit number)
27193162689161470730…33549496984509281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.438 × 10⁹⁶(97-digit number)
54386325378322941461…67098993969018562561
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,896,467 XPM·at block #6,831,546 · 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