Block #486,867

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/11/2014, 7:55:37 PM · Difficulty 10.6335 · 6,319,711 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
deef8c23b0ab0aee597eff323a34df03546015b8edbb83123d4c6452c93a5ab1

Height

#486,867

Difficulty

10.633534

Transactions

4

Size

1.25 KB

Version

2

Bits

0aa22f49

Nonce

40,036,217

Timestamp

4/11/2014, 7:55:37 PM

Confirmations

6,319,711

Merkle Root

c6a6394ec3a645d664bfa64e751c01c825439457ed90c47ea11aef42940cfee4
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.

9.463 × 10⁹⁸(99-digit number)
94632823438039835731…38837238058905781759
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
9.463 × 10⁹⁸(99-digit number)
94632823438039835731…38837238058905781759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.892 × 10⁹⁹(100-digit number)
18926564687607967146…77674476117811563519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.785 × 10⁹⁹(100-digit number)
37853129375215934292…55348952235623127039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.570 × 10⁹⁹(100-digit number)
75706258750431868584…10697904471246254079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.514 × 10¹⁰⁰(101-digit number)
15141251750086373716…21395808942492508159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.028 × 10¹⁰⁰(101-digit number)
30282503500172747433…42791617884985016319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.056 × 10¹⁰⁰(101-digit number)
60565007000345494867…85583235769970032639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.211 × 10¹⁰¹(102-digit number)
12113001400069098973…71166471539940065279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.422 × 10¹⁰¹(102-digit number)
24226002800138197947…42332943079880130559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.845 × 10¹⁰¹(102-digit number)
48452005600276395894…84665886159760261119
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 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
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 1CC formula:

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