Block #2,088,841

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2017, 3:37:22 PM · Difficulty 10.8747 · 4,738,121 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42287654f857dda6b56b122c49b74e4d3ed9f14e4e94d5915fa9859ff7a4091b

Height

#2,088,841

Difficulty

10.874660

Transactions

4

Size

2.12 KB

Version

2

Bits

0adfe9b4

Nonce

512,489,893

Timestamp

4/26/2017, 3:37:22 PM

Confirmations

4,738,121

Merkle Root

ec81e9f39c2c36a166a3e3613f22182cc9d5fcdeff4732f0959c4a9d62582685
Transactions (4)
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.067 × 10⁹⁶(97-digit number)
10677664769201284247…85206123032606049279
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.067 × 10⁹⁶(97-digit number)
10677664769201284247…85206123032606049279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.135 × 10⁹⁶(97-digit number)
21355329538402568494…70412246065212098559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.271 × 10⁹⁶(97-digit number)
42710659076805136988…40824492130424197119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.542 × 10⁹⁶(97-digit number)
85421318153610273977…81648984260848394239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.708 × 10⁹⁷(98-digit number)
17084263630722054795…63297968521696788479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.416 × 10⁹⁷(98-digit number)
34168527261444109590…26595937043393576959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.833 × 10⁹⁷(98-digit number)
68337054522888219181…53191874086787153919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.366 × 10⁹⁸(99-digit number)
13667410904577643836…06383748173574307839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.733 × 10⁹⁸(99-digit number)
27334821809155287672…12767496347148615679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.466 × 10⁹⁸(99-digit number)
54669643618310575345…25534992694297231359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.093 × 10⁹⁹(100-digit number)
10933928723662115069…51069985388594462719
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,859,872 XPM·at block #6,826,961 · 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