Block #2,271,979

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2017, 2:35:28 PM · Difficulty 10.9540 · 4,558,909 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2cb8ccbc13c18cc55dd1229b019d6a9614e428ffacf05a8ebd400e1ee1cbaa8

Height

#2,271,979

Difficulty

10.954016

Transactions

2

Size

724 B

Version

2

Bits

0af43a69

Nonce

262,045,869

Timestamp

8/28/2017, 2:35:28 PM

Confirmations

4,558,909

Merkle Root

f257ed4123a2ae062916a2b49082f3eed4f069478403bd67d409ddf62d123b71
Transactions (2)
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.129 × 10⁹⁵(96-digit number)
21292252388285692593…17976709127132375679
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.129 × 10⁹⁵(96-digit number)
21292252388285692593…17976709127132375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.258 × 10⁹⁵(96-digit number)
42584504776571385187…35953418254264751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.516 × 10⁹⁵(96-digit number)
85169009553142770374…71906836508529502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.703 × 10⁹⁶(97-digit number)
17033801910628554074…43813673017059005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.406 × 10⁹⁶(97-digit number)
34067603821257108149…87627346034118010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.813 × 10⁹⁶(97-digit number)
68135207642514216299…75254692068236021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.362 × 10⁹⁷(98-digit number)
13627041528502843259…50509384136472043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.725 × 10⁹⁷(98-digit number)
27254083057005686519…01018768272944087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.450 × 10⁹⁷(98-digit number)
54508166114011373039…02037536545888174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.090 × 10⁹⁸(99-digit number)
10901633222802274607…04075073091776348159
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,891,241 XPM·at block #6,830,887 · 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