Block #478,314

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 12:15:33 AM · Difficulty 10.4925 · 6,335,808 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a75a07cea3458da8e7a7da4c10e5f7d68e85c50aaa1a140a0d16ece85fd588d

Height

#478,314

Difficulty

10.492517

Transactions

4

Size

1.83 KB

Version

2

Bits

0a7e1592

Nonce

96,713

Timestamp

4/7/2014, 12:15:33 AM

Confirmations

6,335,808

Merkle Root

8dd157f8ec0997ee98dd6fb7ce99c8772b2a5fa76284c01b202c12ad3fd724a1
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.

5.814 × 10⁹⁷(98-digit number)
58142720956285143857…70090863804284893919
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
5.814 × 10⁹⁷(98-digit number)
58142720956285143857…70090863804284893919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.162 × 10⁹⁸(99-digit number)
11628544191257028771…40181727608569787839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.325 × 10⁹⁸(99-digit number)
23257088382514057542…80363455217139575679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.651 × 10⁹⁸(99-digit number)
46514176765028115085…60726910434279151359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.302 × 10⁹⁸(99-digit number)
93028353530056230171…21453820868558302719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.860 × 10⁹⁹(100-digit number)
18605670706011246034…42907641737116605439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.721 × 10⁹⁹(100-digit number)
37211341412022492068…85815283474233210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.442 × 10⁹⁹(100-digit number)
74422682824044984136…71630566948466421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.488 × 10¹⁰⁰(101-digit number)
14884536564808996827…43261133896932843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.976 × 10¹⁰⁰(101-digit number)
29769073129617993654…86522267793865687039
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,757,060 XPM·at block #6,814,121 · 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