Block #2,269,877

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2017, 5:56:28 AM · Difficulty 10.9526 · 4,572,083 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
701c4939e33bad4bdb891392c5def96ae68f2f409ecbbd8bcf866bcdef0144d5

Height

#2,269,877

Difficulty

10.952624

Transactions

3

Size

3.53 KB

Version

2

Bits

0af3df2b

Nonce

983,262,011

Timestamp

8/27/2017, 5:56:28 AM

Confirmations

4,572,083

Merkle Root

6d6cda88ed543a96cf917c19b4f45e426ee2ee543b34ef2e146a6712351fbb9c
Transactions (3)
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.531 × 10⁹⁵(96-digit number)
25315997309209819172…79201739425208814079
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.531 × 10⁹⁵(96-digit number)
25315997309209819172…79201739425208814079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.063 × 10⁹⁵(96-digit number)
50631994618419638345…58403478850417628159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.012 × 10⁹⁶(97-digit number)
10126398923683927669…16806957700835256319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.025 × 10⁹⁶(97-digit number)
20252797847367855338…33613915401670512639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.050 × 10⁹⁶(97-digit number)
40505595694735710676…67227830803341025279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.101 × 10⁹⁶(97-digit number)
81011191389471421352…34455661606682050559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.620 × 10⁹⁷(98-digit number)
16202238277894284270…68911323213364101119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.240 × 10⁹⁷(98-digit number)
32404476555788568541…37822646426728202239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.480 × 10⁹⁷(98-digit number)
64808953111577137082…75645292853456404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.296 × 10⁹⁸(99-digit number)
12961790622315427416…51290585706912808959
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,980,061 XPM·at block #6,841,959 · 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