Block #2,475,835

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2018, 2:40:35 PM · Difficulty 10.9641 · 4,367,500 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa07f038369b1dea3cb2785c4bcd85688f600165afc9a0607714f33cd54a3332

Height

#2,475,835

Difficulty

10.964136

Transactions

7

Size

5.69 KB

Version

2

Bits

0af6d19a

Nonce

216,204,235

Timestamp

1/16/2018, 2:40:35 PM

Confirmations

4,367,500

Merkle Root

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

4.132 × 10⁹⁴(95-digit number)
41328303929637880644…71500866634451355839
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
4.132 × 10⁹⁴(95-digit number)
41328303929637880644…71500866634451355839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.265 × 10⁹⁴(95-digit number)
82656607859275761288…43001733268902711679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.653 × 10⁹⁵(96-digit number)
16531321571855152257…86003466537805423359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.306 × 10⁹⁵(96-digit number)
33062643143710304515…72006933075610846719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.612 × 10⁹⁵(96-digit number)
66125286287420609030…44013866151221693439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.322 × 10⁹⁶(97-digit number)
13225057257484121806…88027732302443386879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.645 × 10⁹⁶(97-digit number)
26450114514968243612…76055464604886773759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.290 × 10⁹⁶(97-digit number)
52900229029936487224…52110929209773547519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.058 × 10⁹⁷(98-digit number)
10580045805987297444…04221858419547095039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.116 × 10⁹⁷(98-digit number)
21160091611974594889…08443716839094190079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.232 × 10⁹⁷(98-digit number)
42320183223949189779…16887433678188380159
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,991,042 XPM·at block #6,843,334 · 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