Block #393,312

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/7/2014, 2:21:04 AM · Difficulty 10.4357 · 6,433,823 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0e65a6ab05d77069014b5894d7f6ce6027edde0ff940ee7b8ddb136829c06e2a

Height

#393,312

Difficulty

10.435711

Transactions

4

Size

866 B

Version

2

Bits

0a6f8ac9

Nonce

236,852

Timestamp

2/7/2014, 2:21:04 AM

Confirmations

6,433,823

Merkle Root

7b4adfe3a24f5a922c059a182a57eb5b6c4b90ca79a751afa6ab35b56bd74044
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.559 × 10⁹⁹(100-digit number)
15596679935545171333…38128084277245337599
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.559 × 10⁹⁹(100-digit number)
15596679935545171333…38128084277245337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.119 × 10⁹⁹(100-digit number)
31193359871090342666…76256168554490675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.238 × 10⁹⁹(100-digit number)
62386719742180685332…52512337108981350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.247 × 10¹⁰⁰(101-digit number)
12477343948436137066…05024674217962700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.495 × 10¹⁰⁰(101-digit number)
24954687896872274133…10049348435925401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.990 × 10¹⁰⁰(101-digit number)
49909375793744548266…20098696871850803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.981 × 10¹⁰⁰(101-digit number)
99818751587489096532…40197393743701606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.996 × 10¹⁰¹(102-digit number)
19963750317497819306…80394787487403212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.992 × 10¹⁰¹(102-digit number)
39927500634995638613…60789574974806425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.985 × 10¹⁰¹(102-digit number)
79855001269991277226…21579149949612851199
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,861,260 XPM·at block #6,827,134 · 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