Block #364,377

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/18/2014, 12:49:50 AM · Difficulty 10.4217 · 6,453,436 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c115651609fba36df7b38c63b928bfd866246f8320d322e66037400a46afb60c

Height

#364,377

Difficulty

10.421738

Transactions

5

Size

1.10 KB

Version

2

Bits

0a6bf709

Nonce

270,419

Timestamp

1/18/2014, 12:49:50 AM

Confirmations

6,453,436

Merkle Root

1e9e871aa8a8b098d71e7a35071e51e404639914410fe01ec09a53f3b81b4546
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.077 × 10⁹⁴(95-digit number)
10777878208432868165…30350768398740126439
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.077 × 10⁹⁴(95-digit number)
10777878208432868165…30350768398740126439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.155 × 10⁹⁴(95-digit number)
21555756416865736331…60701536797480252879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.311 × 10⁹⁴(95-digit number)
43111512833731472663…21403073594960505759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.622 × 10⁹⁴(95-digit number)
86223025667462945327…42806147189921011519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.724 × 10⁹⁵(96-digit number)
17244605133492589065…85612294379842023039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.448 × 10⁹⁵(96-digit number)
34489210266985178130…71224588759684046079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.897 × 10⁹⁵(96-digit number)
68978420533970356261…42449177519368092159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.379 × 10⁹⁶(97-digit number)
13795684106794071252…84898355038736184319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.759 × 10⁹⁶(97-digit number)
27591368213588142504…69796710077472368639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.518 × 10⁹⁶(97-digit number)
55182736427176285009…39593420154944737279
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,786,566 XPM·at block #6,817,812 · 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