Block #2,287,076

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2017, 12:30:28 AM · Difficulty 10.9554 · 4,556,301 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d49a0f070cb08036b07c18cbca1bf547b7b02830d61ff9c9a3e5ba5581158730

Height

#2,287,076

Difficulty

10.955405

Transactions

3

Size

2.41 KB

Version

2

Bits

0af4956f

Nonce

938,271,547

Timestamp

9/8/2017, 12:30:28 AM

Confirmations

4,556,301

Merkle Root

73c1e5146716f53f29359d227211146d9279d28500a1277485c88979c8106a0c
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.

5.605 × 10⁹⁵(96-digit number)
56051451838302292121…26604763513876340159
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
5.605 × 10⁹⁵(96-digit number)
56051451838302292121…26604763513876340159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.121 × 10⁹⁶(97-digit number)
11210290367660458424…53209527027752680319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.242 × 10⁹⁶(97-digit number)
22420580735320916848…06419054055505360639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.484 × 10⁹⁶(97-digit number)
44841161470641833697…12838108111010721279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.968 × 10⁹⁶(97-digit number)
89682322941283667394…25676216222021442559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.793 × 10⁹⁷(98-digit number)
17936464588256733478…51352432444042885119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.587 × 10⁹⁷(98-digit number)
35872929176513466957…02704864888085770239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.174 × 10⁹⁷(98-digit number)
71745858353026933915…05409729776171540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.434 × 10⁹⁸(99-digit number)
14349171670605386783…10819459552343080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.869 × 10⁹⁸(99-digit number)
28698343341210773566…21638919104686161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.739 × 10⁹⁸(99-digit number)
57396686682421547132…43277838209372323839
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,991,381 XPM·at block #6,843,376 · 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