Showing posts with label Scientific Software. Show all posts
Showing posts with label Scientific Software. Show all posts

Monday, October 5, 2026

Research Journal Entry 22 — When One Problem Is Solved and the Next One Appears

In the last several stages of the AR-1.7 Architecture Stress Audit, we have been trying to answer what sounds like a fairly simple question:

When the architecture successfully establishes one piece of information, what exactly gives it permission to use that information in the next step?

The answer has turned out to be much more important than the question first appears.

For this journal entry, I will refer frequently to individual checkpoints (CPs). A checkpoint is a preserved stage in the audit where the current reasoning, decisions, unresolved questions, review results, and relevant project state are recorded before moving forward.

The work through Checkpoint 78 (CP78) has now produced an interesting milestone.

One missing part of the architecture was identified, specified, separately reviewed, adopted, and successfully applied.

And then we stopped.

Because successfully solving that problem did not give us permission to assume the answer to the next one.

From a Missing Rule to a New Open Question — conceptual workflow showing AR-1.7 progress from CP63 through CP78: a missing rule is identified and defined, a bounded policy-material contract survives independent review and is prospectively adopted, its bounded application succeeds, but the audit stops because evaluation continuation remains open and blocked rather than established.

Finding a Missing Rule

Earlier in this part of the audit, we were tracing how information moves through a narrowly defined portion of the architecture.

At CP63, we encountered a gap.

The architecture already had a rule identifying an eligible source of information, but that rule deliberately did not define the read and completion behavior necessary to obtain the corresponding result.

It would have been tempting to say that the intended behavior was obvious and simply continue.

We did not.

Instead, the missing behavior was isolated and a narrowly scoped rule was proposed for the specific case under investigation.

Even then, the audit did not claim that this new rule was technically forced. Deferring it remained a legitimate option. The proposal had to be reviewed and explicitly adopted before it could become governing architecture.

Solving One Problem Exposed Another

That work eventually allowed the original bounded chain of information to be established.

But then another question appeared.

Suppose we later obtain another legitimate piece of information. What allows the architecture to say that the new information belongs to the same ongoing evaluation rather than to a different one?

That sounds subtle, but it matters.

The architecture cannot simply assume that two related observations belong together because they look similar, occur near one another, share a source, or would be convenient to combine.

There has to be a defined reason for treating them as belonging to the same semantic process.

At CP71, the audit could establish the original bounded evaluation scope, but the rules needed to establish later continuity and admission were still blocked.

Importantly, blocked did not mean false.

We had not demonstrated that continuation was impossible. We had demonstrated that the architecture did not yet contain sufficient positive authority to claim it.

Several Reasonable-Looking Answers Were Not Enough

The next checkpoints tried to determine what such authority would actually require.

Could the same context be enough?

Could the same source relationship be enough?

Could temporal order be enough?

Could the absence of a known ending mean that the original evaluation was still continuing?

Again and again, the answer was essentially the same:

Not from the rules we currently have.

At CP73, a proposed continuation mechanism was reviewed and found incomplete. The problem was not that the proposal had been proven impossible. The problem was that it depended on source and input relationships that had not actually been established.

So the proposal was not silently repaired and promoted.

The missing requirement remained visible.

Narrowing the Question

CP74 and CP75 continued narrowing the problem.

By CP75, we could describe the missing piece much more precisely.

What we needed was a bounded operation that could take independently certified source information, establish that it was eligible for a particular policy role, and produce a well-defined evidence state without quietly inventing additional source facts or broader lifecycle semantics.

That distinction matters.

The architecture needed a legitimate way to represent and combine certain certified evidence.

It did not yet need permission to claim that an entire evaluation continued indefinitely, that a new observation had joined it, or that some later lifecycle event had occurred.

Those were separate questions.

A Contract Finally Survived

At CP76, something important changed.

For the first time in this sequence, one complete and coherent new architecture contract survived the separate adversarial review.

The proposed contract was deliberately narrow.

It defined three logical operations called PUBLISH, MATERIALIZE, and ADD.

In simplified terms, these operations provide a controlled way to:

  • recognize independently certified information as eligible for a specific policy role,
  • represent that information as a partial evidence basis, and
  • add another independently qualified piece of evidence while preserving its provenance and history.

The contract did not create new physical or program events. It did not establish complete evaluation input. It did not establish continuation. It did not authorize implementation.

It provided a complete, coherent proposed solution to one narrowly defined architecture problem.

And even after surviving review, it was still not automatically made part of the architecture.

Review Is Not Adoption

At CP77, the complete bounded contract was explicitly adopted prospectively as an architecture-governance decision.

A separate post-decision review then checked the adopted wording against the existing architecture and found it consistent.

But the checkpoint preserved an especially important distinction:

CONTRACT ADOPTED ≠ PREMISES SATISFIED HERE ≠ MATERIAL TRANSFORMATION EXISTS ≠ SAME EVALUATION CONTINUES.

In other words, deciding that a rule is legitimate does not mean that the conditions required to use the rule have actually occurred.

And successfully using that rule would still not automatically establish some larger conclusion that the rule was never designed to prove.

Then We Actually Applied It

That brings us to CP78.

The audit returned to the original bounded case and asked whether the newly adopted contract could actually be applied using premises that had already been established under the accepted architecture.

This time, the answer was yes.

The necessary source relationships and policy eligibility were certified.

The PUBLISH operations were certified.

The MATERIALIZE operations were certified.

The ADD operations were certified.

The resulting bounded evidence basis was established while preserving the distinct histories and provenance of the information being combined.

No artificial history was created in which mutually exclusive alternatives somehow occurred together.

No arbitrary chronological order was invented merely because the evidence could be combined.

Within its deliberately narrow scope, the new contract worked.

And Then We Stopped Again

This is the part of the result that I think matters most.

Having successfully transformed the evidence, it would have been very easy to take the next conceptual step:

The evidence changed, therefore the same evaluation continued.

But the architecture does not currently justify that conclusion.

The successful evidence transformation established a before-and-after relationship for the material being represented.

It did not establish the corresponding before-and-after relationship for the evaluation itself.

At CP78, there was still no accepted rule positively producing an evaluation successor and preserving its identity across that transformation.

Therefore the after-evaluation was not established.

Continuation remained OPEN / BLOCKED.

Not false.

Not disproven.

Not assumed.

Open.

Why This Matters for the Architecture

This may seem like an extraordinary amount of effort devoted to a very small distinction.

But this is exactly the kind of distinction that can eventually determine whether a scientific software system is testing a model or quietly building assumptions into the test itself.

Suppose we allowed the software to infer that the same evaluation continued simply because an evidence transformation succeeded.

Later, an executable test might depend on that inferred continuation.

The test could pass.

We could then mistakenly interpret the passing test as evidence that the architecture was correct.

But the test would actually contain part of the architecture it was supposedly testing.

That would violate a principle we recorded earlier in this audit:

A test should check the contract. It should not secretly invent the contract.

CP78 gives us a concrete example of what following that principle looks like.

Progress Can End With Another Open Question

At CP78, one part of the architecture now says something it could not say before.

A narrowly defined policy-material operation has been specified, challenged, reviewed, adopted, and successfully applied to its original bounded case.

That is progress.

But the next question—whether that transformation belongs to a continuing evaluation—still lacks sufficient architectural authority.

So we stopped there.

Not because the previous work failed, but because it succeeded only as far as the evidence and the adopted rules allow.

Solving one missing step does not grant permission to assume the next one.

Research Status

Research area: BTLB-SIM / AR-1.7 Architecture Stress Audit
Checkpoint represented: CP78
Bounded policy-material application: CERTIFIED
Evaluation continuation: OPEN / BLOCKED
Exact Try-handler routes closed: 0/15
Production code changes from this audit work: None
AR-1.7 readiness: NOT READY

New physics result: None
New numerical or simulation result: None
New independently reproduced scientific result: None
New physical experimental evidence: None
Evidence-category promotion: None

This work concerns the definition, verification, and internal consistency of the BTLB-SIM research-software architecture. It does not provide evidence for faster-than-light communication, warp propulsion, wormholes, anomalous gravity, or any other new physical phenomenon.

Sunday, October 4, 2026

Research Explained #7 - Why Can “UNKNOWN” Be the Right Answer?

Science is often described as a search for answers.

But there is another skill that matters just as much:

knowing when we do not yet have one.

That sounds simple, but it can become surprisingly difficult when scientific reasoning is translated into software.

Computers are very good at giving definite answers.

True or false.

Pass or fail.

Supported or unsupported.

Yes or no.

But what happens when the available information does not justify either answer?

Sometimes the scientifically correct answer is:

UNKNOWN


UNKNOWN Does Not Mean NO

Imagine that someone asks:

Is the light on in the laboratory?

There are at least three possible answers.

YES — we have reliable information showing that the light is on.

NO — we have reliable information showing that the light is off.

UNKNOWN — we do not currently have enough reliable information to determine whether the light is on or off.

Perhaps nobody checked.

Perhaps the sensor stopped working.

Perhaps two measurements disagree.

Or perhaps the information needed to answer the question was never recorded.

It might be convenient for a computer program to treat UNKNOWN as NO.

But that would add information that we do not actually possess.

We would have changed:

“We don't know whether the light is on.”

into

“The light is off.”

Those are not equivalent statements.


UNKNOWN Is Information

This leads to an important idea.

UNKNOWN is information about the state of our knowledge.

It tells us that the available evidence has not justified choosing one of the more definite alternatives.

That does not mean that anything is possible.

It does not mean that YES and NO are equally likely.

It does not mean that the question can never be answered.

And it does not mean that we should stop investigating.

It means only that the evidence currently available does not justify replacing uncertainty with a stronger claim.


Why This Matters in Scientific Software

Scientific software frequently has to represent incomplete knowledge.

A measurement may be unavailable.

A calculation may fall outside its validated domain.

Required provenance may be missing.

Two computational methods may disagree.

An uncertainty may not yet be quantified.

Or the rules governing a particular situation may themselves still be under investigation.

In each case, forcing the software to produce a more definite answer can make the output look cleaner while making the scientific record less accurate.

Beyond the Light Barrier therefore treats unresolved information as something that must be preserved rather than silently replaced with a convenient value.

For example, the BTLB Software Development Standards require unknown uncertainty to remain unknown rather than being inferred from printed digits or deterministic computer output.

Missing required provenance must likewise be reported rather than fabricated.

The principle is simple:

The software should not claim to know something that the evidence does not establish.


AR-1.7 Gave Us a Practical Example

This issue has become particularly visible during the ongoing AR-1.7 Architecture Stress Audit of the Beyond the Light Barrier simulation framework.

AR-1.7 is deliberately challenging the architecture with difficult cases before important behavioral contracts are frozen into production code.

Some of those investigations involve states represented as UNKNOWN.

At first, it might seem attractive to define one universal rule for what an unknown state means and how it should behave.

The audit has been finding reasons to be more careful.

An unknown state may still exist within a particular context. Information about how that state was reached, what support accumulated around it, who owns related work, or what later operations must occur may still matter.

If the architecture collapses those distinctions too early, later parts of the system may no longer have enough information to make the decision they are supposed to make.

Importantly, AR-1.7 is still in progress.

The project is not claiming that all of the correct rules for UNKNOWN have now been established.

The audit is testing which distinctions must be preserved and which simplifications can actually survive the relevant counter examples.


There Is a Difference Between Unknown and Unimportant

Another possible mistake is to assume that if something is unknown, it can simply be discarded.

But an unknown value may still carry important context.

Consider a scientific measurement whose value was lost because an instrument failed.

The measurement itself may be unknown.

But we may still know which instrument was involved, when the measurement was attempted, which calibration was active, what other sensors recorded, and why the value is missing.

Throwing away the entire record because one value is unknown would destroy information we actually possess.

Scientific software sometimes faces the same problem.

The unknown part and the known context surrounding it are not necessarily the same thing.


The Same Principle Appears Throughout Research

This is not merely a software-design issue.

The same discipline appears repeatedly in scientific reasoning.

A mathematically consistent model does not tell us by itself whether nature realizes that model.

A successful simulation does not by itself establish that the simulated physical phenomenon exists.

A calculation that has not yet been independently reproduced should not be described as independently reproduced.

Failure to detect a proposed effect in one experiment does not automatically establish that the effect is impossible under every condition.

And an unresolved question should not be converted into a resolved one simply because having an answer would make the next step easier.

In all of these situations, the strength of the conclusion should match the strength of the evidence.


UNKNOWN Should Not Become a Hiding Place

There is an important caution on the other side.

Preserving UNKNOWN does not mean using uncertainty as an excuse to avoid making decisions.

If additional evidence can resolve the question, we should seek it.

If a calculation can determine the answer, we should perform it.

If an experiment can distinguish competing possibilities, we should design the experiment where scientifically and practically justified.

If the architecture lacks a necessary rule, we should investigate and define that rule rather than permanently labeling the problem unknown.

UNKNOWN is not the destination.

It is an honest description of where the evidence currently leaves us.


Research Status

This article explains a research-method and scientific-software principle. It does not report a new physical result.

New mathematical result: None

New simulation result: None

New independently reproduced scientific result: None

New physical experimental evidence: None

New evidence for traversable wormholes, anomalous gravity, warp propulsion, or faster-than-light communication: None

Scientific evidence-category promotion: None

AR-1.7 remains an ongoing software and architecture verification activity. Examples drawn from it here illustrate why preserving unresolved states can matter; they do not represent a new scientific result or a finalized AR-1.7 architecture.


Sometimes Not Knowing Is the Accurate Result

Scientific progress depends on turning unknowns into things we can measure, calculate, test, or constrain.

But doing that honestly requires preserving the distinction between what we know and what we do not.

A computer can always be programmed to produce an answer.

That does not mean the evidence supplied one.

Science is often described as a search for answers.

Trustworthy science also requires recognizing when we do not yet have one.

Sometimes “UNKNOWN” is not a failure to answer the question.

It is the most accurate answer the evidence currently allows.

Monday, September 28, 2026

Research Journal Entry 19 — When Testing the Architecture Reveals the Architecture Isn't Ready

Sometimes the most useful result of trying to write a test is discovering that you are not ready to write the test.

That sounds backwards.

Normally, software development seems to follow a straightforward sequence:

Define the behavior.

Write the test.

Run the test.

Fix what fails.

But our continuing architecture stress audit of BTLB-SIM has reached a more interesting situation.

We have been trying to specify difficult failure scenarios precisely enough that they can eventually become executable tests.

In doing that, we discovered that some of the questions cannot yet be turned into trustworthy tests.

Not because the testing tools are inadequate.

Not because we do not know how to write the code.

But because parts of the architecture still need more precise definitions of what the correct behavior is supposed to mean.

Before we can test the contract,

we have to finish defining the contract.

Why We Are Trying to Break BTLB-SIM

BTLB-SIM is the computational framework being developed to support numerical work across the Beyond the Light Barrier research program.

Because future scientific calculations may depend on it, simply demonstrating that the software works under ordinary conditions is not enough.

AR-1.7, our Architecture Stress Audit, was created to look deliberately for circumstances in which the architecture might fail.

The audit includes problems involving concurrency, interrupted execution, recovery, incomplete or corrupted artifacts, provenance, unusual inputs, dependencies, determinism, reproducibility, and preservation of the scientific record.

The objective is not to make BTLB-SIM look reliable.

The objective is to discover where it is not yet reliable enough.

From Stress Cases to Witnesses

As the audit became more precise, simply describing a failure scenario in prose was no longer sufficient.

We needed to describe exactly what an implementation would have to observe in order to determine whether the architecture behaved correctly.

We call these descriptions witnesses.

A witness is not evidence for a new physical phenomenon.

In this context, it is a software-verification construct: a precise description of the states, transitions, records, or other observable behavior needed to distinguish an acceptable execution from an unacceptable one.

The current work has expanded this into 36 intended stress witnesses.

At the present checkpoint, the intended semantics of all 36 have been described.

That sounds like we should be ready to implement them.

We are not.

36 Described. 0 Frozen.

There is an important difference between understanding what a witness is intended to investigate and having a sufficiently precise architecture contract to turn that witness into an executable test.

At the AR-1.7 architecture-definition checkpoint described in this entry:

36 of 36 intended witness semantics have been described.

0 of 36 executable graph-and-predicate contracts have been frozen.

That zero is not a failure we need to hide.

It tells us something important about the maturity of the architecture.

While trying to formalize the witnesses, we encountered questions whose answers would determine what the tests themselves should consider correct.

If we guessed those answers while writing the tests, the tests could silently become the architecture specification.

That would reverse the relationship we want.

A test should check the contract.

It should not secretly invent the contract.

Six Architecture Decisions Are Still Open

The unresolved questions are now being tracked explicitly as architecture decisions:

AD-01 through AD-06.

These decisions concern details that matter when execution does not follow the simplest successful path.

Among the issues being examined are how significant execution points are identified, how control-flow and exception transitions are represented, how state is preserved across those transitions, how incomplete operations are distinguished, and how diagnostic information participates in the scientific record.

These may sound like ordinary software-engineering details.

For scientific software, they can affect much more than convenience.

Suppose an operation begins to store a scientific result and is interrupted halfway through.

Suppose a calculation fails while another operation is already in progress.

Suppose an exception changes the route through the program while some state must still be preserved.

If two physically different execution histories accidentally become indistinguishable in the recorded trace, later analysis could misunderstand what actually happened.

That is exactly the kind of ambiguity the architecture needs to prevent.

When the Test Cannot Be Written Yet — BTLB-SIM architecture stress-audit workflow showing how a stress scenario becomes a witness, then either a frozen executable test contract or an unresolved architecture decision requiring contract refinement

Why Not Just Pick an Answer?

We could.

From a programming perspective, it would be easy to choose whichever interpretation seems most convenient and continue implementing tests.

But that would create a scientific-integrity problem.

A test written around an undocumented assumption can pass perfectly while proving only that the software agrees with the assumption hidden inside the test.

Instead, the unresolved behavior is being preserved as unresolved.

Architecture proposals can be written.

Objections can be recorded.

Alternatives can be compared.

And if an existing architecture contract cannot represent the behavior we actually require, any necessary change should be introduced explicitly as a versioned architecture change rather than quietly treated as a clarification.

That makes development slower in the short term.

It should make the scientific record much stronger in the long term.

Even a Rejected Proposal Is Useful

Some of the current architecture work has already gone through proposal and review cycles in which an apparently reasonable solution was not accepted.

Those rejected or revised proposals remain useful.

They record what was considered, which problems were discovered, and why the architecture was not frozen at that point.

This follows the same principle we use elsewhere in the research:

Do not rewrite the history so that the final answer looks inevitable.

If an idea was proposed and later found inadequate, that path belongs in the record.

Production Code Is Still Unchanged

Another important boundary remains in place.

AR-1.7 is still separating discovery and architecture definition from production correction.

The production implementation has not been changed simply to make the emerging stress cases pass.

That separation matters because fixing a problem while we are still trying to characterize it could erase the behavior we need to understand.

First we determine what failed or remains ambiguous.

Then we define what correct behavior should mean.

Then we can implement corrections and run the appropriate verification gates.

What This Means for AR-1.7

It would be tempting to look at 36 described witnesses and call the phase nearly complete.

That would not accurately represent the current state.

The executable contracts are not frozen.

Architecture decisions remain open.

Production corrections have not been introduced as part of this work.

The correct status therefore remains:

AR-1.7 — NOT READY

That status is not an embarrassment.

It is information.

The audit has reached a point where trying to make the tests precise has exposed places where the architecture itself must become more precise.

What This Does Not Mean

None of this provides evidence for wormholes, warp drives, anomalous gravity, faster-than-light communication, or faster-than-light propulsion.

No new physical experiment has been performed.

No physical phenomenon has been demonstrated.

No scientific evidence category is promoted by this architecture work.

This is software and architecture verification intended to make future computational research more trustworthy.

The Unexpected Value of Not Being Ready

There is an interesting lesson in reaching a checkpoint where the correct answer is still “not ready.”

We could have written tests around our best guesses.

We could probably have made many of them pass.

And we could then have reported a much more impressive-looking test count.

But a large collection of passing tests is not valuable if some of those tests encode behavior we never properly justified.

Instead, the inability to freeze the tests has itself become useful information.

Sometimes a test finds a bug.

Sometimes a test confirms a contract.

And sometimes trying to write the test reveals that the contract itself isn't ready.

What Comes Next

The immediate task is not to increase the test count.

It is to resolve the architecture decisions carefully enough that the witnesses can be converted into stable executable contracts without hiding assumptions inside them.

Some proposed solutions may survive review.

Others may be revised or rejected.

If an existing contract proves insufficient, a versioned successor may be required.

Only after those decisions are sufficiently resolved should the corresponding witness graphs and predicates be frozen and implemented.

And then we finally get to ask the question the tests were intended to answer:

When the architecture is placed under adversarial conditions,

does it actually preserve the scientific record the way we said it would?


Research Status

Current status: AR-1.7 remains an in-progress BTLB-SIM architecture stress-audit and verification activity.

At the checkpoint described in this journal entry, intended semantics have been described for 36 stress witnesses, while their executable graph-and-predicate contracts remain unfrozen and architecture decisions AD-01 through AD-06 remain unresolved.

Production implementation changes have not been introduced as part of this architecture-definition checkpoint.

This work is software/architecture verification. It is not a physical experiment, independent scientific reproduction, or evidence establishing any proposed faster-than-light phenomenon.

The current project status remains AR-1.7 — NOT READY.


Project Provenance

This journal entry records an in-progress AR-1.7 architecture-definition checkpoint. It should be read as a chronological record of that checkpoint, not as a frozen description of all later AR-1.7 work.

Governing project sources: Beyond the Light Barrier Research Method, Version 1.2; BTLB Software Development Standards, Version 1.1; and Beyond the Light Barrier Research State, Version 1.11.

Subsequent AR-1.7 architecture proposals, reviews, revisions, and eventual implementation or verification results should extend this record rather than retroactively changing the checkpoint described here.

Sources & References

Beyond the Light Barrier. Beyond the Light Barrier Research Method, Version 1.2. Governing project methodology for evidence classification, preservation of negative and unresolved results, reproducibility, correction, and research integrity.

Beyond the Light Barrier. BTLB Software Development Standards, Version 1.1. Project-wide software standards governing scientific software development, provenance, immutable history, verification, versioning, failure preservation, and the separation of software results from scientific evidence.

Beyond the Light Barrier. Beyond the Light Barrier Research State, Version 1.11. Controlling project-state record documenting the AR-1.7 Architecture Stress Audit, its separation of discovery from remediation, its NOT READY status, and the unchanged production-code boundary through the recorded checkpoint.

Research Explained #15 — What Would It Actually Mean for a Signal to Travel Faster Than Light?

The Question Behind the Question Imagine sending a message from Earth to a spacecraft near another star. You press a button,...