Block #2,634,549

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 10:46:30 PM · Difficulty 11.2517 · 4,209,279 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
edfa72767221e7737725467926ebf795c2b3d01bae5027237297c6d07d8456f6

Height

#2,634,549

Difficulty

11.251735

Transactions

5

Size

2.29 KB

Version

2

Bits

0b4071ae

Nonce

592,711,854

Timestamp

4/28/2018, 10:46:30 PM

Confirmations

4,209,279

Merkle Root

c5232cf2fc5f48c63e5b62b64e934c8de95dd630427fd3cbafe7670a3f7201ce
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.728 × 10⁹⁴(95-digit number)
17288080316633958144…49115098137407230719
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.728 × 10⁹⁴(95-digit number)
17288080316633958144…49115098137407230719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.457 × 10⁹⁴(95-digit number)
34576160633267916288…98230196274814461439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.915 × 10⁹⁴(95-digit number)
69152321266535832577…96460392549628922879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.383 × 10⁹⁵(96-digit number)
13830464253307166515…92920785099257845759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.766 × 10⁹⁵(96-digit number)
27660928506614333031…85841570198515691519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.532 × 10⁹⁵(96-digit number)
55321857013228666062…71683140397031383039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.106 × 10⁹⁶(97-digit number)
11064371402645733212…43366280794062766079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.212 × 10⁹⁶(97-digit number)
22128742805291466424…86732561588125532159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.425 × 10⁹⁶(97-digit number)
44257485610582932849…73465123176251064319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.851 × 10⁹⁶(97-digit number)
88514971221165865699…46930246352502128639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.770 × 10⁹⁷(98-digit number)
17702994244233173139…93860492705004257279
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,995,000 XPM·at block #6,843,827 · 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