Block #480,747

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 11:48:21 AM · Difficulty 10.5226 · 6,326,320 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6fa5ac34545f2a6f7f0495ad7b2a41553326188aa961c5bbd132bc8e6f703e18

Height

#480,747

Difficulty

10.522604

Transactions

2

Size

1.10 KB

Version

2

Bits

0a85c962

Nonce

4,840

Timestamp

4/8/2014, 11:48:21 AM

Confirmations

6,326,320

Merkle Root

423668362b1259cd248b796ea1cc8d8e2c80e59f3e22ec60956b87df2f164fc6
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.913 × 10⁹⁹(100-digit number)
29137918421923479276…59532529411279727361
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.913 × 10⁹⁹(100-digit number)
29137918421923479276…59532529411279727361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.827 × 10⁹⁹(100-digit number)
58275836843846958552…19065058822559454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.165 × 10¹⁰⁰(101-digit number)
11655167368769391710…38130117645118909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.331 × 10¹⁰⁰(101-digit number)
23310334737538783420…76260235290237818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.662 × 10¹⁰⁰(101-digit number)
46620669475077566841…52520470580475637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.324 × 10¹⁰⁰(101-digit number)
93241338950155133683…05040941160951275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.864 × 10¹⁰¹(102-digit number)
18648267790031026736…10081882321902551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.729 × 10¹⁰¹(102-digit number)
37296535580062053473…20163764643805102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.459 × 10¹⁰¹(102-digit number)
74593071160124106946…40327529287610204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.491 × 10¹⁰²(103-digit number)
14918614232024821389…80655058575220408321
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,700,634 XPM·at block #6,807,066 · 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