Block #2,771,893

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/30/2018, 2:21:05 PM · Difficulty 11.6617 · 4,066,546 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83d72a5c6f1dec2b7970b9b34e775036e047b2f6f17a9e363a8030e3a1205a9d

Height

#2,771,893

Difficulty

11.661693

Transactions

39

Size

10.70 KB

Version

2

Bits

0ba964bd

Nonce

855,594,112

Timestamp

7/30/2018, 2:21:05 PM

Confirmations

4,066,546

Merkle Root

22c76b8a3d46434bc719a98e0ebb767b45bfa6d6d079a9a9bb8b29f3815cb295
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.

3.699 × 10⁹⁵(96-digit number)
36990233844660023267…39492373358853119999
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
3.699 × 10⁹⁵(96-digit number)
36990233844660023267…39492373358853119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.398 × 10⁹⁵(96-digit number)
73980467689320046535…78984746717706239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.479 × 10⁹⁶(97-digit number)
14796093537864009307…57969493435412479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.959 × 10⁹⁶(97-digit number)
29592187075728018614…15938986870824959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.918 × 10⁹⁶(97-digit number)
59184374151456037228…31877973741649919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.183 × 10⁹⁷(98-digit number)
11836874830291207445…63755947483299839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.367 × 10⁹⁷(98-digit number)
23673749660582414891…27511894966599679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.734 × 10⁹⁷(98-digit number)
47347499321164829783…55023789933199359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.469 × 10⁹⁷(98-digit number)
94694998642329659566…10047579866398719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.893 × 10⁹⁸(99-digit number)
18938999728465931913…20095159732797439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.787 × 10⁹⁸(99-digit number)
37877999456931863826…40190319465594879999
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,951,788 XPM·at block #6,838,438 · 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