Block #2,268,515

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/26/2017, 7:25:16 AM · Difficulty 10.9525 · 4,571,561 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ab47ed4d2b792abb9a2eba2b8cd2e0f0d8c5673dfe0f2255b4a399efb8909c61

Height

#2,268,515

Difficulty

10.952479

Transactions

4

Size

878 B

Version

2

Bits

0af3d5b1

Nonce

1,275,827,371

Timestamp

8/26/2017, 7:25:16 AM

Confirmations

4,571,561

Merkle Root

f8aebd67d7e1c4dc570b27014673be30a0fc9d2f314de503f76216440c568f44
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.002 × 10⁹⁶(97-digit number)
20025145120570171729…66755403987415372799
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.002 × 10⁹⁶(97-digit number)
20025145120570171729…66755403987415372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.005 × 10⁹⁶(97-digit number)
40050290241140343458…33510807974830745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.010 × 10⁹⁶(97-digit number)
80100580482280686916…67021615949661491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.602 × 10⁹⁷(98-digit number)
16020116096456137383…34043231899322982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.204 × 10⁹⁷(98-digit number)
32040232192912274766…68086463798645964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.408 × 10⁹⁷(98-digit number)
64080464385824549533…36172927597291929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.281 × 10⁹⁸(99-digit number)
12816092877164909906…72345855194583859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.563 × 10⁹⁸(99-digit number)
25632185754329819813…44691710389167718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.126 × 10⁹⁸(99-digit number)
51264371508659639626…89383420778335436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.025 × 10⁹⁹(100-digit number)
10252874301731927925…78766841556670873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.050 × 10⁹⁹(100-digit number)
20505748603463855850…57533683113341747199
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,964,915 XPM·at block #6,840,075 · 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