Block #2,269,784

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2017, 4:34:15 AM · Difficulty 10.9525 · 4,567,997 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
66b08e32430f721e4daa4362cf760c79fe1c5f78624617858480b1f0cd5c622a

Height

#2,269,784

Difficulty

10.952536

Transactions

13

Size

2.84 KB

Version

2

Bits

0af3d96b

Nonce

802,807,837

Timestamp

8/27/2017, 4:34:15 AM

Confirmations

4,567,997

Merkle Root

e3bc15601cb09467ea33b65ebde2087c10117df49df63212254b2f092f58840d
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.

7.635 × 10⁹⁴(95-digit number)
76350558874087049602…03165243743564239999
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
7.635 × 10⁹⁴(95-digit number)
76350558874087049602…03165243743564239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.527 × 10⁹⁵(96-digit number)
15270111774817409920…06330487487128479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.054 × 10⁹⁵(96-digit number)
30540223549634819840…12660974974256959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.108 × 10⁹⁵(96-digit number)
61080447099269639681…25321949948513919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.221 × 10⁹⁶(97-digit number)
12216089419853927936…50643899897027839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.443 × 10⁹⁶(97-digit number)
24432178839707855872…01287799794055679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.886 × 10⁹⁶(97-digit number)
48864357679415711745…02575599588111359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.772 × 10⁹⁶(97-digit number)
97728715358831423491…05151199176222719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.954 × 10⁹⁷(98-digit number)
19545743071766284698…10302398352445439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.909 × 10⁹⁷(98-digit number)
39091486143532569396…20604796704890879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.818 × 10⁹⁷(98-digit number)
78182972287065138792…41209593409781759999
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,946,585 XPM·at block #6,837,780 · 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