Block #478,855

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 8:23:06 AM · Difficulty 10.4978 · 6,335,482 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e3832a8de0f1f9544d4bbad3d29fb08d2d582fe874e39c4b7be53c1031e53bf6

Height

#478,855

Difficulty

10.497813

Transactions

2

Size

419 B

Version

2

Bits

0a7f70b1

Nonce

218,918

Timestamp

4/7/2014, 8:23:06 AM

Confirmations

6,335,482

Merkle Root

7728f8f35ddb49896eb53a66d55132967967952ee991806af457c2297a37a0d6
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.

5.172 × 10⁹⁶(97-digit number)
51721275358034357271…13655368695327113999
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.172 × 10⁹⁶(97-digit number)
51721275358034357271…13655368695327113999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.034 × 10⁹⁷(98-digit number)
10344255071606871454…27310737390654227999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.068 × 10⁹⁷(98-digit number)
20688510143213742908…54621474781308455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.137 × 10⁹⁷(98-digit number)
41377020286427485817…09242949562616911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.275 × 10⁹⁷(98-digit number)
82754040572854971634…18485899125233823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.655 × 10⁹⁸(99-digit number)
16550808114570994326…36971798250467647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.310 × 10⁹⁸(99-digit number)
33101616229141988653…73943596500935295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.620 × 10⁹⁸(99-digit number)
66203232458283977307…47887193001870591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.324 × 10⁹⁹(100-digit number)
13240646491656795461…95774386003741183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.648 × 10⁹⁹(100-digit number)
26481292983313590923…91548772007482367999
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,758,758 XPM·at block #6,814,336 · 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