Block #369,708

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 2:08:48 PM · Difficulty 10.4475 · 6,457,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc3e9bd4348abb4bf36318e927e3dec1ede0959aee4eb6f5ea26f463b7a0b714

Height

#369,708

Difficulty

10.447460

Transactions

2

Size

1.62 KB

Version

2

Bits

0a728cc1

Nonce

2,166

Timestamp

1/21/2014, 2:08:48 PM

Confirmations

6,457,001

Merkle Root

7924a83eb1fd9de969601d7505d56248129a57500f15ec44cf69cf788158f11d
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.

5.453 × 10⁹⁷(98-digit number)
54535685695154729950…34200804470587893759
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
5.453 × 10⁹⁷(98-digit number)
54535685695154729950…34200804470587893759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.090 × 10⁹⁸(99-digit number)
10907137139030945990…68401608941175787519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.181 × 10⁹⁸(99-digit number)
21814274278061891980…36803217882351575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.362 × 10⁹⁸(99-digit number)
43628548556123783960…73606435764703150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.725 × 10⁹⁸(99-digit number)
87257097112247567920…47212871529406300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.745 × 10⁹⁹(100-digit number)
17451419422449513584…94425743058812600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.490 × 10⁹⁹(100-digit number)
34902838844899027168…88851486117625200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.980 × 10⁹⁹(100-digit number)
69805677689798054336…77702972235250401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.396 × 10¹⁰⁰(101-digit number)
13961135537959610867…55405944470500802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.792 × 10¹⁰⁰(101-digit number)
27922271075919221734…10811888941001605119
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,857,824 XPM·at block #6,826,708 · 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