Block #478,466

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 2:48:10 AM · Difficulty 10.4923 · 6,328,435 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4d210a401b3bdc3f9890ee1db798d7e964c6f5519e7b1ee48b059103a4ba3f28

Height

#478,466

Difficulty

10.492345

Transactions

2

Size

1.25 KB

Version

2

Bits

0a7e0a50

Nonce

71,837

Timestamp

4/7/2014, 2:48:10 AM

Confirmations

6,328,435

Merkle Root

7efe0a873e8d0c023e3cf2170ace03bccf7ae6118cebe695349e98104609c998
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.074 × 10⁹⁹(100-digit number)
10743712294856893110…70411214584770951679
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.074 × 10⁹⁹(100-digit number)
10743712294856893110…70411214584770951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.148 × 10⁹⁹(100-digit number)
21487424589713786220…40822429169541903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.297 × 10⁹⁹(100-digit number)
42974849179427572441…81644858339083806719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.594 × 10⁹⁹(100-digit number)
85949698358855144883…63289716678167613439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.718 × 10¹⁰⁰(101-digit number)
17189939671771028976…26579433356335226879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.437 × 10¹⁰⁰(101-digit number)
34379879343542057953…53158866712670453759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.875 × 10¹⁰⁰(101-digit number)
68759758687084115906…06317733425340907519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.375 × 10¹⁰¹(102-digit number)
13751951737416823181…12635466850681815039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.750 × 10¹⁰¹(102-digit number)
27503903474833646362…25270933701363630079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.500 × 10¹⁰¹(102-digit number)
55007806949667292725…50541867402727260159
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,699,317 XPM·at block #6,806,900 · 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