Block #356,246

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 3:34:59 PM · Difficulty 10.3744 · 6,470,464 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5e681bc993e93ff79c585267a2edb0189f13beea9d46fc3fc1462e3bc2d0f478

Height

#356,246

Difficulty

10.374435

Transactions

5

Size

1.37 KB

Version

2

Bits

0a5fdb00

Nonce

1,655,340

Timestamp

1/12/2014, 3:34:59 PM

Confirmations

6,470,464

Merkle Root

73ed662645af8a048ce93ec85b434fa6092200a7837704510bdf09a8053379d4
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.

7.672 × 10⁹⁴(95-digit number)
76725945540146770913…75644867500358609199
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
7.672 × 10⁹⁴(95-digit number)
76725945540146770913…75644867500358609199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.534 × 10⁹⁵(96-digit number)
15345189108029354182…51289735000717218399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.069 × 10⁹⁵(96-digit number)
30690378216058708365…02579470001434436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.138 × 10⁹⁵(96-digit number)
61380756432117416730…05158940002868873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.227 × 10⁹⁶(97-digit number)
12276151286423483346…10317880005737747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.455 × 10⁹⁶(97-digit number)
24552302572846966692…20635760011475494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.910 × 10⁹⁶(97-digit number)
49104605145693933384…41271520022950988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.820 × 10⁹⁶(97-digit number)
98209210291387866768…82543040045901977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.964 × 10⁹⁷(98-digit number)
19641842058277573353…65086080091803955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.928 × 10⁹⁷(98-digit number)
39283684116555146707…30172160183607910399
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,832 XPM·at block #6,826,709 · 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