Block #474,420

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 1:45:43 PM · Difficulty 10.4510 · 6,343,556 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0803a260f879c74711f8cd31a894bee361f9f692b34dc70c595ce16a2175b3ee

Height

#474,420

Difficulty

10.450968

Transactions

4

Size

2.33 KB

Version

2

Bits

0a7372ab

Nonce

11,080

Timestamp

4/4/2014, 1:45:43 PM

Confirmations

6,343,556

Merkle Root

3ee8645d08fa3c302c19a42e647e78b324bf962e549bde972160bf8f50650bf5
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.

7.210 × 10⁹⁷(98-digit number)
72108356778944146562…07504821139677927279
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
7.210 × 10⁹⁷(98-digit number)
72108356778944146562…07504821139677927279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.442 × 10⁹⁸(99-digit number)
14421671355788829312…15009642279355854559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.884 × 10⁹⁸(99-digit number)
28843342711577658625…30019284558711709119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.768 × 10⁹⁸(99-digit number)
57686685423155317250…60038569117423418239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.153 × 10⁹⁹(100-digit number)
11537337084631063450…20077138234846836479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.307 × 10⁹⁹(100-digit number)
23074674169262126900…40154276469693672959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.614 × 10⁹⁹(100-digit number)
46149348338524253800…80308552939387345919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.229 × 10⁹⁹(100-digit number)
92298696677048507600…60617105878774691839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.845 × 10¹⁰⁰(101-digit number)
18459739335409701520…21234211757549383679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.691 × 10¹⁰⁰(101-digit number)
36919478670819403040…42468423515098767359
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,787,878 XPM·at block #6,817,975 · 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