Block #2,257,327

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/18/2017, 1:50:34 PM · Difficulty 10.9517 · 4,584,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3064df5b24468f3e80084988f5effdc40250d94ca3a60b6bbcfcb8c014ec545

Height

#2,257,327

Difficulty

10.951662

Transactions

3

Size

2.67 KB

Version

2

Bits

0af3a017

Nonce

2,053,884,476

Timestamp

8/18/2017, 1:50:34 PM

Confirmations

4,584,460

Merkle Root

cd1092fb64a18c442483cc9982c863d0ff7a7a4dbc7529250cb7922c624e74c2
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.278 × 10⁹⁵(96-digit number)
12785087183779865258…36457986706949612159
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.278 × 10⁹⁵(96-digit number)
12785087183779865258…36457986706949612159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.557 × 10⁹⁵(96-digit number)
25570174367559730517…72915973413899224319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.114 × 10⁹⁵(96-digit number)
51140348735119461034…45831946827798448639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.022 × 10⁹⁶(97-digit number)
10228069747023892206…91663893655596897279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.045 × 10⁹⁶(97-digit number)
20456139494047784413…83327787311193794559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.091 × 10⁹⁶(97-digit number)
40912278988095568827…66655574622387589119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.182 × 10⁹⁶(97-digit number)
81824557976191137655…33311149244775178239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.636 × 10⁹⁷(98-digit number)
16364911595238227531…66622298489550356479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.272 × 10⁹⁷(98-digit number)
32729823190476455062…33244596979100712959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.545 × 10⁹⁷(98-digit number)
65459646380952910124…66489193958201425919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.309 × 10⁹⁸(99-digit number)
13091929276190582024…32978387916402851839
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,978,674 XPM·at block #6,841,786 · 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