Block #292,027

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 12:32:39 PM · Difficulty 9.9901 · 6,547,581 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d0705ec89719e24306b5a6fcc02f189a88bbef0362bbb989c2a22d060de6a963

Height

#292,027

Difficulty

9.990101

Transactions

1

Size

1.08 KB

Version

2

Bits

09fd773a

Nonce

217,839

Timestamp

12/3/2013, 12:32:39 PM

Confirmations

6,547,581

Merkle Root

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

7.614 × 10⁹⁶(97-digit number)
76145356202652077364…27745791532369688799
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
7.614 × 10⁹⁶(97-digit number)
76145356202652077364…27745791532369688799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.522 × 10⁹⁷(98-digit number)
15229071240530415472…55491583064739377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.045 × 10⁹⁷(98-digit number)
30458142481060830945…10983166129478755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.091 × 10⁹⁷(98-digit number)
60916284962121661891…21966332258957510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.218 × 10⁹⁸(99-digit number)
12183256992424332378…43932664517915020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.436 × 10⁹⁸(99-digit number)
24366513984848664756…87865329035830041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.873 × 10⁹⁸(99-digit number)
48733027969697329513…75730658071660083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.746 × 10⁹⁸(99-digit number)
97466055939394659026…51461316143320166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.949 × 10⁹⁹(100-digit number)
19493211187878931805…02922632286640332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.898 × 10⁹⁹(100-digit number)
38986422375757863610…05845264573280665599
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,961,153 XPM·at block #6,839,607 · 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