Block #2,471,338

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 4:39:38 PM · Difficulty 10.9619 · 4,373,828 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ec53c66294ade1e0614813f4557eabd6795a1da746e19551397722a9b3c7dae

Height

#2,471,338

Difficulty

10.961861

Transactions

62

Size

17.95 KB

Version

2

Bits

0af63c83

Nonce

1,918,535,192

Timestamp

1/13/2018, 4:39:38 PM

Confirmations

4,373,828

Merkle Root

1e43f8b52849235e250969c746a33fbeeac38772dd044dfd48fd8f54c9d6027d
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.

2.054 × 10⁹⁶(97-digit number)
20544476119017486209…03394904526069063679
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
2.054 × 10⁹⁶(97-digit number)
20544476119017486209…03394904526069063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.108 × 10⁹⁶(97-digit number)
41088952238034972418…06789809052138127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.217 × 10⁹⁶(97-digit number)
82177904476069944836…13579618104276254719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.643 × 10⁹⁷(98-digit number)
16435580895213988967…27159236208552509439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.287 × 10⁹⁷(98-digit number)
32871161790427977934…54318472417105018879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.574 × 10⁹⁷(98-digit number)
65742323580855955869…08636944834210037759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.314 × 10⁹⁸(99-digit number)
13148464716171191173…17273889668420075519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.629 × 10⁹⁸(99-digit number)
26296929432342382347…34547779336840151039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.259 × 10⁹⁸(99-digit number)
52593858864684764695…69095558673680302079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.051 × 10⁹⁹(100-digit number)
10518771772936952939…38191117347360604159
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:58,005,758 XPM·at block #6,845,165 · 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