Block #406,777

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 11:59:42 AM · Difficulty 10.4325 · 6,400,847 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2832ea316d4fd8bb6f720b62ff39506819c74572b5acf90fec0076630c8f092f

Height

#406,777

Difficulty

10.432460

Transactions

1

Size

835 B

Version

2

Bits

0a6eb5b0

Nonce

18,918

Timestamp

2/16/2014, 11:59:42 AM

Confirmations

6,400,847

Merkle Root

6d40492e722c9299e99fc95771e4c009d9961550aac21a295b653ee71775c2f6
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.498 × 10⁹⁹(100-digit number)
34989083191803465152…21148988122169388959
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.498 × 10⁹⁹(100-digit number)
34989083191803465152…21148988122169388959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.997 × 10⁹⁹(100-digit number)
69978166383606930304…42297976244338777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.399 × 10¹⁰⁰(101-digit number)
13995633276721386060…84595952488677555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.799 × 10¹⁰⁰(101-digit number)
27991266553442772121…69191904977355111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.598 × 10¹⁰⁰(101-digit number)
55982533106885544243…38383809954710223359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.119 × 10¹⁰¹(102-digit number)
11196506621377108848…76767619909420446719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.239 × 10¹⁰¹(102-digit number)
22393013242754217697…53535239818840893439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.478 × 10¹⁰¹(102-digit number)
44786026485508435394…07070479637681786879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.957 × 10¹⁰¹(102-digit number)
89572052971016870789…14140959275363573759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.791 × 10¹⁰²(103-digit number)
17914410594203374157…28281918550727147519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.582 × 10¹⁰²(103-digit number)
35828821188406748315…56563837101454295039
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,705,017 XPM·at block #6,807,623 · 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.

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