Block #749,444

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/2/2014, 6:08:17 AM · Difficulty 10.9764 · 6,083,924 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6c1bacf368f99ac2bfa3cdbc481bb051d281b68f2b258cec9b71746b0e821585

Height

#749,444

Difficulty

10.976365

Transactions

6

Size

1.73 KB

Version

2

Bits

0af9f30b

Nonce

328,613,145

Timestamp

10/2/2014, 6:08:17 AM

Confirmations

6,083,924

Merkle Root

303575d4d801322316edf007de8982e15aa4a10033337d42b2825aa325c1d35c
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.

3.687 × 10⁹⁴(95-digit number)
36872995386463486490…07451679251781222399
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
3.687 × 10⁹⁴(95-digit number)
36872995386463486490…07451679251781222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.374 × 10⁹⁴(95-digit number)
73745990772926972981…14903358503562444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.474 × 10⁹⁵(96-digit number)
14749198154585394596…29806717007124889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.949 × 10⁹⁵(96-digit number)
29498396309170789192…59613434014249779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.899 × 10⁹⁵(96-digit number)
58996792618341578384…19226868028499558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.179 × 10⁹⁶(97-digit number)
11799358523668315676…38453736056999116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.359 × 10⁹⁶(97-digit number)
23598717047336631353…76907472113998233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.719 × 10⁹⁶(97-digit number)
47197434094673262707…53814944227996467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.439 × 10⁹⁶(97-digit number)
94394868189346525415…07629888455992934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.887 × 10⁹⁷(98-digit number)
18878973637869305083…15259776911985868799
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,911,141 XPM·at block #6,833,367 · 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