Block #2,261,748

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2017, 2:54:22 PM · Difficulty 10.9521 · 4,570,002 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
112e3065dbc659e760e32046bf449e821efa1976b2f39e6e13878e03ea28ef71

Height

#2,261,748

Difficulty

10.952141

Transactions

3

Size

1.65 KB

Version

2

Bits

0af3bf8a

Nonce

739,307,241

Timestamp

8/21/2017, 2:54:22 PM

Confirmations

4,570,002

Merkle Root

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

9.749 × 10⁹⁶(97-digit number)
97491293695450527526…42496553556561438719
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
9.749 × 10⁹⁶(97-digit number)
97491293695450527526…42496553556561438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.949 × 10⁹⁷(98-digit number)
19498258739090105505…84993107113122877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.899 × 10⁹⁷(98-digit number)
38996517478180211010…69986214226245754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.799 × 10⁹⁷(98-digit number)
77993034956360422021…39972428452491509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.559 × 10⁹⁸(99-digit number)
15598606991272084404…79944856904983019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.119 × 10⁹⁸(99-digit number)
31197213982544168808…59889713809966039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.239 × 10⁹⁸(99-digit number)
62394427965088337616…19779427619932078079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.247 × 10⁹⁹(100-digit number)
12478885593017667523…39558855239864156159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.495 × 10⁹⁹(100-digit number)
24957771186035335046…79117710479728312319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.991 × 10⁹⁹(100-digit number)
49915542372070670093…58235420959456624639
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,898,108 XPM·at block #6,831,749 · 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