Block #411,897

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 4:07:05 AM · Difficulty 10.4157 · 6,414,604 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a37287c15cbfd5890606ea9e33df9e69c5adcc7ab28ecb6da5ea7e5c2542ca4a

Height

#411,897

Difficulty

10.415652

Transactions

8

Size

1.73 KB

Version

2

Bits

0a6a682d

Nonce

16,900

Timestamp

2/20/2014, 4:07:05 AM

Confirmations

6,414,604

Merkle Root

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

9.524 × 10⁹³(94-digit number)
95243669596300625583…66183793601225109199
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
9.524 × 10⁹³(94-digit number)
95243669596300625583…66183793601225109199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.904 × 10⁹⁴(95-digit number)
19048733919260125116…32367587202450218399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.809 × 10⁹⁴(95-digit number)
38097467838520250233…64735174404900436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.619 × 10⁹⁴(95-digit number)
76194935677040500466…29470348809800873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.523 × 10⁹⁵(96-digit number)
15238987135408100093…58940697619601747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.047 × 10⁹⁵(96-digit number)
30477974270816200186…17881395239203494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.095 × 10⁹⁵(96-digit number)
60955948541632400373…35762790478406988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.219 × 10⁹⁶(97-digit number)
12191189708326480074…71525580956813977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.438 × 10⁹⁶(97-digit number)
24382379416652960149…43051161913627955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.876 × 10⁹⁶(97-digit number)
48764758833305920298…86102323827255910399
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,856,150 XPM·at block #6,826,500 · 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