Block #286,006

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/30/2013, 5:33:00 PM · Difficulty 9.9850 · 6,524,451 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
64d8795d2d549c53e9845fb49ab7e5a1f6f71e46c0543918cde82e67f4b8206a

Height

#286,006

Difficulty

9.985036

Transactions

1

Size

1.01 KB

Version

2

Bits

09fc2b55

Nonce

111,568

Timestamp

11/30/2013, 5:33:00 PM

Confirmations

6,524,451

Merkle Root

f05546908738f98652baaee7b8448e7fab20a6b058048cd08fea0ba099d35fc8
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.127 × 10⁹⁸(99-digit number)
11277197557395017963…71014188392671000959
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.127 × 10⁹⁸(99-digit number)
11277197557395017963…71014188392671000959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.255 × 10⁹⁸(99-digit number)
22554395114790035927…42028376785342001919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.510 × 10⁹⁸(99-digit number)
45108790229580071855…84056753570684003839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.021 × 10⁹⁸(99-digit number)
90217580459160143711…68113507141368007679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.804 × 10⁹⁹(100-digit number)
18043516091832028742…36227014282736015359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.608 × 10⁹⁹(100-digit number)
36087032183664057484…72454028565472030719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.217 × 10⁹⁹(100-digit number)
72174064367328114968…44908057130944061439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.443 × 10¹⁰⁰(101-digit number)
14434812873465622993…89816114261888122879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.886 × 10¹⁰⁰(101-digit number)
28869625746931245987…79632228523776245759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.773 × 10¹⁰⁰(101-digit number)
57739251493862491975…59264457047552491519
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,727,743 XPM·at block #6,810,456 · 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