Block #2,261,864

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2017, 5:04:30 PM · Difficulty 10.9520 · 4,570,702 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d753c88a43522ae6edb4b541f027afa92d12adeb3d4311c2c27c18400256d4a

Height

#2,261,864

Difficulty

10.952019

Transactions

4

Size

878 B

Version

2

Bits

0af3b783

Nonce

380,786,197

Timestamp

8/21/2017, 5:04:30 PM

Confirmations

4,570,702

Merkle Root

d4c1b02bb0327241c6269dd2be5fdde9896a9ece9f2645786b8b4821c166adb1
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.677 × 10⁹⁴(95-digit number)
26779028797867166955…05042776204435118079
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.677 × 10⁹⁴(95-digit number)
26779028797867166955…05042776204435118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.355 × 10⁹⁴(95-digit number)
53558057595734333911…10085552408870236159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.071 × 10⁹⁵(96-digit number)
10711611519146866782…20171104817740472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.142 × 10⁹⁵(96-digit number)
21423223038293733564…40342209635480944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.284 × 10⁹⁵(96-digit number)
42846446076587467128…80684419270961889279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.569 × 10⁹⁵(96-digit number)
85692892153174934257…61368838541923778559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.713 × 10⁹⁶(97-digit number)
17138578430634986851…22737677083847557119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.427 × 10⁹⁶(97-digit number)
34277156861269973703…45475354167695114239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.855 × 10⁹⁶(97-digit number)
68554313722539947406…90950708335390228479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13710862744507989481…81901416670780456959
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,904,686 XPM·at block #6,832,565 · 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