Block #1,815,569

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2016, 9:54:47 AM · Difficulty 10.7954 · 5,001,534 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d760e01e3052fb352460d1425b2dbaf0e93ef622073379b1daaf42820c2f3e3

Height

#1,815,569

Difficulty

10.795373

Transactions

4

Size

1.91 KB

Version

2

Bits

0acb9d89

Nonce

1,809,690,774

Timestamp

10/20/2016, 9:54:47 AM

Confirmations

5,001,534

Merkle Root

8c543d344e8f86cfa8c91990fa7c132b853a7c7c0846025b2bce2d043e082714
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.764 × 10⁹⁴(95-digit number)
17640357383279594483…16512044845203208099
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.764 × 10⁹⁴(95-digit number)
17640357383279594483…16512044845203208099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.528 × 10⁹⁴(95-digit number)
35280714766559188966…33024089690406416199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.056 × 10⁹⁴(95-digit number)
70561429533118377933…66048179380812832399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.411 × 10⁹⁵(96-digit number)
14112285906623675586…32096358761625664799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.822 × 10⁹⁵(96-digit number)
28224571813247351173…64192717523251329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.644 × 10⁹⁵(96-digit number)
56449143626494702347…28385435046502659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.128 × 10⁹⁶(97-digit number)
11289828725298940469…56770870093005318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.257 × 10⁹⁶(97-digit number)
22579657450597880938…13541740186010636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.515 × 10⁹⁶(97-digit number)
45159314901195761877…27083480372021273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.031 × 10⁹⁶(97-digit number)
90318629802391523755…54166960744042547199
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,780,862 XPM·at block #6,817,102 · 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