Block #411,816

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 2:39:31 AM · Difficulty 10.4164 · 6,404,967 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e533c699372656eb8be48b8062c930ee2e40a2b8e075e8ed727109bf370ba6d5

Height

#411,816

Difficulty

10.416424

Transactions

4

Size

2.40 KB

Version

2

Bits

0a6a9ac5

Nonce

9,041

Timestamp

2/20/2014, 2:39:31 AM

Confirmations

6,404,967

Merkle Root

a729e2ed9e21ea843421be46f80c964cb605fd7b910eed55ba37eb148db91f2c
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.426 × 10⁹⁹(100-digit number)
14268746208152528125…31385934979948677999
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.426 × 10⁹⁹(100-digit number)
14268746208152528125…31385934979948677999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.853 × 10⁹⁹(100-digit number)
28537492416305056251…62771869959897355999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.707 × 10⁹⁹(100-digit number)
57074984832610112502…25543739919794711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.141 × 10¹⁰⁰(101-digit number)
11414996966522022500…51087479839589423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.282 × 10¹⁰⁰(101-digit number)
22829993933044045000…02174959679178847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.565 × 10¹⁰⁰(101-digit number)
45659987866088090001…04349919358357695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.131 × 10¹⁰⁰(101-digit number)
91319975732176180003…08699838716715391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.826 × 10¹⁰¹(102-digit number)
18263995146435236000…17399677433430783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.652 × 10¹⁰¹(102-digit number)
36527990292870472001…34799354866861567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.305 × 10¹⁰¹(102-digit number)
73055980585740944002…69598709733723135999
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,778,299 XPM·at block #6,816,782 · 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