Block #363,363

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2014, 9:01:43 AM · Difficulty 10.4133 · 6,447,461 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2abf3d0d64873293bb456eb68d7ff0fa6c592b5a46e03e81b3cf73f0126aa5dc

Height

#363,363

Difficulty

10.413252

Transactions

3

Size

890 B

Version

2

Bits

0a69cada

Nonce

90

Timestamp

1/17/2014, 9:01:43 AM

Confirmations

6,447,461

Merkle Root

a06c3931c6a9ed1350520b36301d446353342cb3d3f2735fc735cb3f7bf4117c
Transactions (3)
1 in → 1 out9.2340 XPM116 B
1 in → 1 out476.9800 XPM193 B
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.323 × 10⁹⁵(96-digit number)
13234697435180820674…78380260856556521119
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.323 × 10⁹⁵(96-digit number)
13234697435180820674…78380260856556521119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.646 × 10⁹⁵(96-digit number)
26469394870361641349…56760521713113042239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.293 × 10⁹⁵(96-digit number)
52938789740723282699…13521043426226084479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.058 × 10⁹⁶(97-digit number)
10587757948144656539…27042086852452168959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.117 × 10⁹⁶(97-digit number)
21175515896289313079…54084173704904337919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.235 × 10⁹⁶(97-digit number)
42351031792578626159…08168347409808675839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.470 × 10⁹⁶(97-digit number)
84702063585157252319…16336694819617351679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.694 × 10⁹⁷(98-digit number)
16940412717031450463…32673389639234703359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.388 × 10⁹⁷(98-digit number)
33880825434062900927…65346779278469406719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.776 × 10⁹⁷(98-digit number)
67761650868125801855…30693558556938813439
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,730,693 XPM·at block #6,810,823 · 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.

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