Block #335,995

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/30/2013, 3:41:38 PM · Difficulty 10.1440 · 6,478,433 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8f7447e1287a5c386b960a79dd85ded9f5e587a0e46837a1610e9fce0a82ca0b

Height

#335,995

Difficulty

10.143980

Transactions

1

Size

1.01 KB

Version

2

Bits

0a24dbde

Nonce

14,233

Timestamp

12/30/2013, 3:41:38 PM

Confirmations

6,478,433

Merkle Root

3848bad54b49827429b45dd77cd095edf1e609e2cab529c510abe1b5f7f28c75
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.156 × 10⁹¹(92-digit number)
11569182844373699745…93919580719430891579
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.156 × 10⁹¹(92-digit number)
11569182844373699745…93919580719430891579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.313 × 10⁹¹(92-digit number)
23138365688747399491…87839161438861783159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.627 × 10⁹¹(92-digit number)
46276731377494798983…75678322877723566319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.255 × 10⁹¹(92-digit number)
92553462754989597967…51356645755447132639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.851 × 10⁹²(93-digit number)
18510692550997919593…02713291510894265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.702 × 10⁹²(93-digit number)
37021385101995839186…05426583021788530559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.404 × 10⁹²(93-digit number)
74042770203991678373…10853166043577061119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.480 × 10⁹³(94-digit number)
14808554040798335674…21706332087154122239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.961 × 10⁹³(94-digit number)
29617108081596671349…43412664174308244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.923 × 10⁹³(94-digit number)
59234216163193342699…86825328348616488959
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,759,491 XPM·at block #6,814,427 · 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