Block #2,275,337

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2017, 9:05:41 PM · Difficulty 10.9549 · 4,561,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef317329ad46441f4f957ece8c0a65bbb1b4e20c204f1d00deaf08563ea44f2d

Height

#2,275,337

Difficulty

10.954903

Transactions

6

Size

1.42 KB

Version

2

Bits

0af47487

Nonce

221,724,369

Timestamp

8/30/2017, 9:05:41 PM

Confirmations

4,561,316

Merkle Root

14c115b7730b829261e8206938ae88e8cb0ec83b610567b6f52f0ec95749a437
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.

8.240 × 10⁹⁴(95-digit number)
82400026098699666856…69015019505517837119
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
8.240 × 10⁹⁴(95-digit number)
82400026098699666856…69015019505517837119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.648 × 10⁹⁵(96-digit number)
16480005219739933371…38030039011035674239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.296 × 10⁹⁵(96-digit number)
32960010439479866742…76060078022071348479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.592 × 10⁹⁵(96-digit number)
65920020878959733485…52120156044142696959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.318 × 10⁹⁶(97-digit number)
13184004175791946697…04240312088285393919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.636 × 10⁹⁶(97-digit number)
26368008351583893394…08480624176570787839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.273 × 10⁹⁶(97-digit number)
52736016703167786788…16961248353141575679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.054 × 10⁹⁷(98-digit number)
10547203340633557357…33922496706283151359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.109 × 10⁹⁷(98-digit number)
21094406681267114715…67844993412566302719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.218 × 10⁹⁷(98-digit number)
42188813362534229430…35689986825132605439
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,937,499 XPM·at block #6,836,652 · 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